./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_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:12,539 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 02:49:12,540 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 02:49:12,546 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 02:49:12,546 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 02:49:12,547 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 02:49:12,547 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 02:49:12,548 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 02:49:12,549 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 02:49:12,550 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 02:49:12,550 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 02:49:12,550 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 02:49:12,551 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 02:49:12,551 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 02:49:12,552 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 02:49:12,552 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 02:49:12,553 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 02:49:12,554 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 02:49:12,555 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 02:49:12,555 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 02:49:12,556 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 02:49:12,557 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 02:49:12,558 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 02:49:12,558 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 02:49:12,558 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 02:49:12,559 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 02:49:12,559 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 02:49:12,560 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 02:49:12,560 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 02:49:12,561 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 02:49:12,561 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 02:49:12,561 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 02:49:12,561 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 02:49:12,561 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 02:49:12,562 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 02:49:12,562 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 02:49:12,562 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 02:49:12,569 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 02:49:12,570 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 02:49:12,570 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 02:49:12,570 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 02:49:12,571 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 02:49:12,571 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 02:49:12,571 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 02:49:12,571 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 02:49:12,571 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 02:49:12,571 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 02:49:12,571 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 02:49:12,571 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 02:49:12,571 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 02:49:12,572 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 02:49:12,572 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 02:49:12,572 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 02:49:12,572 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 02:49:12,572 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 02:49:12,572 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 02:49:12,572 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 02:49:12,572 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 02:49:12,572 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 02:49:12,573 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 02:49:12,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 02:49:12,573 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 02:49:12,573 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 02:49:12,573 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 02:49:12,573 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 02:49:12,573 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_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:12,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 02:49:12,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 02:49:12,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 02:49:12,600 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 02:49:12,601 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 02:49:12,601 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-12-09 02:49:12,634 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/data/2f9bf9c68/0d8ae870e5d14f5981ac5810be4f9d67/FLAGfebdb1927 [2018-12-09 02:49:13,111 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 02:49:13,112 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-12-09 02:49:13,117 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/data/2f9bf9c68/0d8ae870e5d14f5981ac5810be4f9d67/FLAGfebdb1927 [2018-12-09 02:49:13,125 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/data/2f9bf9c68/0d8ae870e5d14f5981ac5810be4f9d67 [2018-12-09 02:49:13,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 02:49:13,128 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 02:49:13,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 02:49:13,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 02:49:13,131 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 02:49:13,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:49:13" (1/1) ... [2018-12-09 02:49:13,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:13, skipping insertion in model container [2018-12-09 02:49:13,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:49:13" (1/1) ... [2018-12-09 02:49:13,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 02:49:13,154 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 02:49:13,293 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:49:13,298 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 02:49:13,393 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:49:13,416 INFO L195 MainTranslator]: Completed translation [2018-12-09 02:49:13,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:13 WrapperNode [2018-12-09 02:49:13,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 02:49:13,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 02:49:13,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 02:49:13,417 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 02:49:13,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:13" (1/1) ... [2018-12-09 02:49:13,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:13" (1/1) ... [2018-12-09 02:49:13,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:13" (1/1) ... [2018-12-09 02:49:13,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:13" (1/1) ... [2018-12-09 02:49:13,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:13" (1/1) ... [2018-12-09 02:49:13,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:13" (1/1) ... [2018-12-09 02:49:13,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:13" (1/1) ... [2018-12-09 02:49:13,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 02:49:13,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 02:49:13,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 02:49:13,457 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 02:49:13,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:13,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 02:49:13,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 02:49:13,490 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-09 02:49:13,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 02:49:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-09 02:49:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 02:49:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 02:49:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 02:49:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 02:49:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 02:49:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 02:49:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 02:49:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 02:49:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 02:49:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 02:49:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 02:49:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 02:49:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 02:49:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 02:49:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 02:49:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 02:49:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 02:49:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 02:49:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 02:49:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 02:49:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 02:49:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 02:49:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 02:49:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 02:49:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 02:49:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 02:49:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 02:49:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 02:49:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 02:49:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 02:49:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 02:49:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 02:49:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 02:49:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 02:49:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 02:49:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 02:49:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 02:49:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 02:49:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 02:49:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 02:49:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 02:49:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 02:49:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 02:49:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 02:49:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 02:49:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 02:49:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 02:49:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 02:49:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 02:49:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 02:49:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 02:49:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 02:49:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 02:49:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 02:49:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 02:49:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 02:49:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 02:49:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 02:49:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 02:49:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 02:49:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 02:49:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 02:49:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 02:49:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 02:49:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-09 02:49:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 02:49:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 02:49:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 02:49:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 02:49:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 02:49:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 02:49:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 02:49:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 02:49:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 02:49:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 02:49:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 02:49:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 02:49:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 02:49:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 02:49:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 02:49:13,780 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 02:49:13,780 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 02:49:13,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:49:13 BoogieIcfgContainer [2018-12-09 02:49:13,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 02:49:13,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 02:49:13,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 02:49:13,783 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 02:49:13,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:49:13" (1/3) ... [2018-12-09 02:49:13,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fef34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:49:13, skipping insertion in model container [2018-12-09 02:49:13,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:13" (2/3) ... [2018-12-09 02:49:13,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fef34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:49:13, skipping insertion in model container [2018-12-09 02:49:13,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:49:13" (3/3) ... [2018-12-09 02:49:13,785 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-12-09 02:49:13,791 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 02:49:13,796 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-12-09 02:49:13,805 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2018-12-09 02:49:13,819 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 02:49:13,820 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 02:49:13,820 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 02:49:13,820 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 02:49:13,820 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 02:49:13,820 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 02:49:13,820 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 02:49:13,820 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 02:49:13,820 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 02:49:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2018-12-09 02:49:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 02:49:13,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:13,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:13,837 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:13,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:13,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1733579010, now seen corresponding path program 1 times [2018-12-09 02:49:13,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:13,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:13,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:13,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:13,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:13,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:13,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:49:13,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:49:13,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:49:13,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:49:13,995 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 5 states. [2018-12-09 02:49:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:14,150 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-12-09 02:49:14,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:49:14,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 02:49:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:14,158 INFO L225 Difference]: With dead ends: 120 [2018-12-09 02:49:14,158 INFO L226 Difference]: Without dead ends: 117 [2018-12-09 02:49:14,159 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-09 02:49:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-09 02:49:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2018-12-09 02:49:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 02:49:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-12-09 02:49:14,184 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 9 [2018-12-09 02:49:14,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:14,184 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-12-09 02:49:14,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:49:14,185 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-12-09 02:49:14,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 02:49:14,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:14,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:14,185 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:14,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:14,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1733579011, now seen corresponding path program 1 times [2018-12-09 02:49:14,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:14,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:14,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:14,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:14,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:14,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:14,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:49:14,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:49:14,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:49:14,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:49:14,216 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 5 states. [2018-12-09 02:49:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:14,295 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-12-09 02:49:14,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:49:14,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 02:49:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:14,296 INFO L225 Difference]: With dead ends: 94 [2018-12-09 02:49:14,297 INFO L226 Difference]: Without dead ends: 94 [2018-12-09 02:49:14,297 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-09 02:49:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-09 02:49:14,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-09 02:49:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-09 02:49:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-12-09 02:49:14,304 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 9 [2018-12-09 02:49:14,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:14,304 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-12-09 02:49:14,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:49:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-12-09 02:49:14,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 02:49:14,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:14,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:14,305 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:14,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:14,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2093625574, now seen corresponding path program 1 times [2018-12-09 02:49:14,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:14,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:14,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:14,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:14,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:14,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:14,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 02:49:14,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:49:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:49:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:49:14,334 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 3 states. [2018-12-09 02:49:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:14,369 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-12-09 02:49:14,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:49:14,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 02:49:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:14,370 INFO L225 Difference]: With dead ends: 90 [2018-12-09 02:49:14,370 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 02:49:14,371 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-09 02:49:14,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 02:49:14,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-09 02:49:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 02:49:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2018-12-09 02:49:14,376 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 10 [2018-12-09 02:49:14,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:14,377 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2018-12-09 02:49:14,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:49:14,377 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2018-12-09 02:49:14,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 02:49:14,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:14,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:14,378 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:14,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:14,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2093625575, now seen corresponding path program 1 times [2018-12-09 02:49:14,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:14,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:14,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:14,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:14,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:14,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:14,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 02:49:14,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:49:14,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:49:14,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:49:14,407 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 3 states. [2018-12-09 02:49:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:14,438 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-12-09 02:49:14,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:49:14,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 02:49:14,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:14,439 INFO L225 Difference]: With dead ends: 86 [2018-12-09 02:49:14,439 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 02:49:14,439 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-09 02:49:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 02:49:14,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-09 02:49:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 02:49:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2018-12-09 02:49:14,442 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 10 [2018-12-09 02:49:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:14,443 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2018-12-09 02:49:14,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:49:14,443 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-12-09 02:49:14,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 02:49:14,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:14,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:14,443 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:14,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:14,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1720338793, now seen corresponding path program 1 times [2018-12-09 02:49:14,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:14,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:14,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:14,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:14,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:14,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:14,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 02:49:14,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 02:49:14,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 02:49:14,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:49:14,535 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 8 states. [2018-12-09 02:49:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:14,677 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2018-12-09 02:49:14,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 02:49:14,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 02:49:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:14,678 INFO L225 Difference]: With dead ends: 97 [2018-12-09 02:49:14,678 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 02:49:14,679 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-09 02:49:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 02:49:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-12-09 02:49:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-09 02:49:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-12-09 02:49:14,684 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 15 [2018-12-09 02:49:14,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:14,685 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-12-09 02:49:14,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 02:49:14,685 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-12-09 02:49:14,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 02:49:14,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:14,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:14,686 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:14,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:14,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1791173131, now seen corresponding path program 1 times [2018-12-09 02:49:14,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:14,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:14,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:14,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:14,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:14,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:14,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:49:14,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:49:14,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:49:14,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:49:14,746 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2018-12-09 02:49:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:14,837 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-12-09 02:49:14,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:49:14,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-09 02:49:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:14,838 INFO L225 Difference]: With dead ends: 105 [2018-12-09 02:49:14,838 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 02:49:14,838 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-09 02:49:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 02:49:14,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2018-12-09 02:49:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-09 02:49:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-12-09 02:49:14,841 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 16 [2018-12-09 02:49:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:14,841 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-12-09 02:49:14,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:49:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-12-09 02:49:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 02:49:14,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:14,842 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-09 02:49:14,842 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:14,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:14,842 INFO L82 PathProgramCache]: Analyzing trace with hash -863246286, now seen corresponding path program 1 times [2018-12-09 02:49:14,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:14,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:14,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:14,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:14,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:14,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:14,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:49:14,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:49:14,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:49:14,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:49:14,894 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 7 states. [2018-12-09 02:49:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:15,001 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-12-09 02:49:15,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:49:15,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-09 02:49:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:15,001 INFO L225 Difference]: With dead ends: 101 [2018-12-09 02:49:15,002 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 02:49:15,002 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-09 02:49:15,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 02:49:15,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2018-12-09 02:49:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-09 02:49:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-12-09 02:49:15,005 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 25 [2018-12-09 02:49:15,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:15,006 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-12-09 02:49:15,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:49:15,006 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-12-09 02:49:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 02:49:15,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:15,007 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-09 02:49:15,007 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:15,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:15,007 INFO L82 PathProgramCache]: Analyzing trace with hash -863246285, now seen corresponding path program 1 times [2018-12-09 02:49:15,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:15,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:15,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:15,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:15,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:15,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:49:15,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:49:15,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:49:15,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:49:15,091 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 7 states. [2018-12-09 02:49:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:15,200 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-12-09 02:49:15,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:49:15,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-09 02:49:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:15,200 INFO L225 Difference]: With dead ends: 98 [2018-12-09 02:49:15,201 INFO L226 Difference]: Without dead ends: 98 [2018-12-09 02:49:15,201 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-09 02:49:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-09 02:49:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2018-12-09 02:49:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-09 02:49:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-12-09 02:49:15,204 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 25 [2018-12-09 02:49:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:15,204 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-12-09 02:49:15,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:49:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-12-09 02:49:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 02:49:15,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:15,205 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-09 02:49:15,205 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:15,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:15,205 INFO L82 PathProgramCache]: Analyzing trace with hash -863258234, now seen corresponding path program 1 times [2018-12-09 02:49:15,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:15,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:15,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:15,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:15,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:15,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:49:15,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:49:15,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:49:15,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:49:15,225 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 3 states. [2018-12-09 02:49:15,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:15,232 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-12-09 02:49:15,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:49:15,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 02:49:15,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:15,233 INFO L225 Difference]: With dead ends: 72 [2018-12-09 02:49:15,233 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 02:49:15,233 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-09 02:49:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 02:49:15,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-09 02:49:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 02:49:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-12-09 02:49:15,236 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 25 [2018-12-09 02:49:15,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:15,236 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-12-09 02:49:15,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:49:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-12-09 02:49:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 02:49:15,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:15,236 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-09 02:49:15,237 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:15,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:15,237 INFO L82 PathProgramCache]: Analyzing trace with hash -862144052, now seen corresponding path program 1 times [2018-12-09 02:49:15,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:15,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:15,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:15,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:15,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:15,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:49:15,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:49:15,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:49:15,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:49:15,251 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 3 states. [2018-12-09 02:49:15,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:15,258 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-09 02:49:15,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:49:15,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 02:49:15,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:15,259 INFO L225 Difference]: With dead ends: 69 [2018-12-09 02:49:15,259 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 02:49:15,259 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-09 02:49:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 02:49:15,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-12-09 02:49:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 02:49:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-12-09 02:49:15,261 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 25 [2018-12-09 02:49:15,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:15,261 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-12-09 02:49:15,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:49:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-12-09 02:49:15,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 02:49:15,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:15,262 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-09 02:49:15,262 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:15,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:15,262 INFO L82 PathProgramCache]: Analyzing trace with hash -862145304, now seen corresponding path program 1 times [2018-12-09 02:49:15,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:15,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:15,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:15,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:15,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:15,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:15,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:49:15,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:49:15,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:49:15,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:49:15,279 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2018-12-09 02:49:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:15,292 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-12-09 02:49:15,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:49:15,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-12-09 02:49:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:15,293 INFO L225 Difference]: With dead ends: 68 [2018-12-09 02:49:15,293 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 02:49:15,293 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-09 02:49:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 02:49:15,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-12-09 02:49:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 02:49:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-12-09 02:49:15,295 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 25 [2018-12-09 02:49:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:15,296 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-12-09 02:49:15,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:49:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-12-09 02:49:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 02:49:15,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:15,297 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-09 02:49:15,297 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:15,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:15,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1294075165, now seen corresponding path program 1 times [2018-12-09 02:49:15,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:15,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:15,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:15,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:15,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:15,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:49:15,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:49:15,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:49:15,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:49:15,332 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 6 states. [2018-12-09 02:49:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:15,395 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-12-09 02:49:15,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:49:15,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-09 02:49:15,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:15,396 INFO L225 Difference]: With dead ends: 66 [2018-12-09 02:49:15,396 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 02:49:15,396 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-09 02:49:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 02:49:15,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-09 02:49:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 02:49:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-12-09 02:49:15,399 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 28 [2018-12-09 02:49:15,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:15,399 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-12-09 02:49:15,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:49:15,399 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-12-09 02:49:15,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 02:49:15,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:15,400 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-09 02:49:15,400 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:15,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:15,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1461624531, now seen corresponding path program 1 times [2018-12-09 02:49:15,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:15,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:15,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:15,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:15,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:49:15,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:49:15,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:49:15,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:49:15,431 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 5 states. [2018-12-09 02:49:15,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:15,503 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-12-09 02:49:15,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:49:15,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-09 02:49:15,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:15,504 INFO L225 Difference]: With dead ends: 65 [2018-12-09 02:49:15,504 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 02:49:15,504 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-09 02:49:15,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 02:49:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-09 02:49:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 02:49:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-12-09 02:49:15,506 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 29 [2018-12-09 02:49:15,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:15,506 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-12-09 02:49:15,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:49:15,506 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-12-09 02:49:15,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 02:49:15,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:15,507 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-09 02:49:15,507 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:15,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:15,507 INFO L82 PathProgramCache]: Analyzing trace with hash -98352470, now seen corresponding path program 1 times [2018-12-09 02:49:15,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:15,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:15,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:15,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:15,626 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-09 02:49:15,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:15,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:15,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:15,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:15,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 02:49:15,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 02:49:15,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 02:49:15,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 02:49:15,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,731 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-12-09 02:49:15,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:15,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 02:49:15,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:15,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:15,784 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-09 02:49:15,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-12-09 02:49:15,845 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-09 02:49:15,848 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-09 02:49:15,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,885 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-09 02:49:15,888 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-09 02:49:15,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,911 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-09 02:49:15,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-12-09 02:49:15,941 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-09 02:49:15,945 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-09 02:49:15,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,973 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-09 02:49:15,976 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-09 02:49:15,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,985 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-09 02:49:15,985 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,993 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-09 02:49:15,993 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:15,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:16,004 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-09 02:49:16,004 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-12-09 02:49:16,027 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-09 02:49:16,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:49:16,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-12-09 02:49:16,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 02:49:16,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 02:49:16,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2018-12-09 02:49:16,051 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 17 states. [2018-12-09 02:49:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:16,509 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-12-09 02:49:16,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 02:49:16,510 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-12-09 02:49:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:16,510 INFO L225 Difference]: With dead ends: 71 [2018-12-09 02:49:16,510 INFO L226 Difference]: Without dead ends: 71 [2018-12-09 02:49:16,511 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-09 02:49:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-09 02:49:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-12-09 02:49:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 02:49:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-12-09 02:49:16,513 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 30 [2018-12-09 02:49:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:16,513 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-12-09 02:49:16,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 02:49:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-12-09 02:49:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 02:49:16,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:16,514 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-09 02:49:16,514 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:16,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:16,515 INFO L82 PathProgramCache]: Analyzing trace with hash -98352471, now seen corresponding path program 1 times [2018-12-09 02:49:16,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:16,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:16,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:16,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:16,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:16,611 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-09 02:49:16,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:16,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:16,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:16,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:16,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 02:49:16,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 02:49:16,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:16,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:16,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:16,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-09 02:49:16,680 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-09 02:49:16,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:16,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:16,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-12-09 02:49:16,722 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-09 02:49:16,724 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-09 02:49:16,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:16,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:16,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:49:16,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-09 02:49:16,760 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-09 02:49:16,762 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-09 02:49:16,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:16,771 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-09 02:49:16,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:16,779 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-09 02:49:16,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:16,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:16,784 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-09 02:49:16,784 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-12-09 02:49:16,792 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-09 02:49:16,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:49:16,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2018-12-09 02:49:16,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 02:49:16,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 02:49:16,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-12-09 02:49:16,807 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 17 states. [2018-12-09 02:49:17,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:17,124 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-12-09 02:49:17,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 02:49:17,124 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-12-09 02:49:17,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:17,125 INFO L225 Difference]: With dead ends: 70 [2018-12-09 02:49:17,125 INFO L226 Difference]: Without dead ends: 70 [2018-12-09 02:49:17,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2018-12-09 02:49:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-09 02:49:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-12-09 02:49:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 02:49:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-12-09 02:49:17,128 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 30 [2018-12-09 02:49:17,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:17,129 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-12-09 02:49:17,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 02:49:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-12-09 02:49:17,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 02:49:17,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:17,130 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-09 02:49:17,130 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:17,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:17,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1934279712, now seen corresponding path program 1 times [2018-12-09 02:49:17,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:17,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:17,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:17,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:17,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:17,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:17,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:49:17,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 02:49:17,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 02:49:17,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:49:17,202 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 8 states. [2018-12-09 02:49:17,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:17,306 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-09 02:49:17,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:49:17,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-09 02:49:17,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:17,307 INFO L225 Difference]: With dead ends: 67 [2018-12-09 02:49:17,307 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 02:49:17,308 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-09 02:49:17,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 02:49:17,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-09 02:49:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 02:49:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-12-09 02:49:17,310 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 30 [2018-12-09 02:49:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:17,311 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-12-09 02:49:17,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 02:49:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-12-09 02:49:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 02:49:17,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:17,312 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-09 02:49:17,312 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:17,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:17,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1934279711, now seen corresponding path program 1 times [2018-12-09 02:49:17,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:17,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:17,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:17,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:17,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:17,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:17,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 02:49:17,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:49:17,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:49:17,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:49:17,343 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 3 states. [2018-12-09 02:49:17,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:17,366 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-12-09 02:49:17,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:49:17,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 02:49:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:17,367 INFO L225 Difference]: With dead ends: 63 [2018-12-09 02:49:17,367 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 02:49:17,367 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-09 02:49:17,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 02:49:17,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-09 02:49:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 02:49:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-12-09 02:49:17,369 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 30 [2018-12-09 02:49:17,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:17,370 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-12-09 02:49:17,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:49:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-12-09 02:49:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 02:49:17,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:17,371 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-09 02:49:17,371 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:17,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1979694254, now seen corresponding path program 1 times [2018-12-09 02:49:17,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:17,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:17,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:17,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:17,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:17,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:17,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:49:17,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:49:17,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:49:17,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:49:17,399 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 5 states. [2018-12-09 02:49:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:17,418 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-12-09 02:49:17,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:49:17,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-12-09 02:49:17,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:17,419 INFO L225 Difference]: With dead ends: 79 [2018-12-09 02:49:17,419 INFO L226 Difference]: Without dead ends: 79 [2018-12-09 02:49:17,419 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-09 02:49:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-09 02:49:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-12-09 02:49:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 02:49:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-12-09 02:49:17,423 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 34 [2018-12-09 02:49:17,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:17,424 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-12-09 02:49:17,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:49:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-12-09 02:49:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 02:49:17,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:17,424 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-09 02:49:17,425 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr14REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-12-09 02:49:17,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:17,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1979693002, now seen corresponding path program 1 times [2018-12-09 02:49:17,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:49:17,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:49:17,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:17,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:17,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:49:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:49:17,464 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 02:49:17,474 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 02:49:17,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:49:17 BoogieIcfgContainer [2018-12-09 02:49:17,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 02:49:17,485 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 02:49:17,485 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 02:49:17,485 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 02:49:17,486 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:49:13" (3/4) ... [2018-12-09 02:49:17,488 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 02:49:17,488 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 02:49:17,489 INFO L168 Benchmark]: Toolchain (without parser) took 4361.11 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.4 MB). Free memory was 950.6 MB in the beginning and 1.3 GB in the end (delta: -370.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:49:17,489 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:49:17,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -145.6 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:17,490 INFO L168 Benchmark]: Boogie Preprocessor took 39.27 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:49:17,490 INFO L168 Benchmark]: RCFGBuilder took 323.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:17,490 INFO L168 Benchmark]: TraceAbstraction took 3704.00 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 215.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -282.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:49:17,490 INFO L168 Benchmark]: Witness Printer took 2.98 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:49:17,491 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -145.6 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.27 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 323.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3704.00 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 215.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -282.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.98 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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.6s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 1.8s 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.1s 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-09 02:49:18,803 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 02:49:18,804 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 02:49:18,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 02:49:18,811 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 02:49:18,811 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 02:49:18,812 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 02:49:18,813 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 02:49:18,814 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 02:49:18,815 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 02:49:18,815 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 02:49:18,816 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 02:49:18,816 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 02:49:18,817 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 02:49:18,818 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 02:49:18,818 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 02:49:18,819 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 02:49:18,820 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 02:49:18,821 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 02:49:18,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 02:49:18,822 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 02:49:18,822 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 02:49:18,823 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 02:49:18,824 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 02:49:18,824 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 02:49:18,824 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 02:49:18,825 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 02:49:18,825 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 02:49:18,825 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 02:49:18,826 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 02:49:18,826 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 02:49:18,826 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 02:49:18,826 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 02:49:18,826 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 02:49:18,827 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 02:49:18,828 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 02:49:18,828 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-09 02:49:18,838 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 02:49:18,838 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 02:49:18,839 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 02:49:18,839 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 02:49:18,840 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 02:49:18,840 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 02:49:18,840 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 02:49:18,840 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 02:49:18,840 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 02:49:18,840 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 02:49:18,840 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 02:49:18,841 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 02:49:18,841 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 02:49:18,841 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 02:49:18,841 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 02:49:18,841 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 02:49:18,841 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 02:49:18,841 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 02:49:18,841 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 02:49:18,842 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 02:49:18,842 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 02:49:18,842 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 02:49:18,842 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 02:49:18,842 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 02:49:18,842 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 02:49:18,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 02:49:18,843 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 02:49:18,843 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 02:49:18,843 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-09 02:49:18,843 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 02:49:18,843 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 02:49:18,843 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_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:18,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 02:49:18,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 02:49:18,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 02:49:18,876 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 02:49:18,877 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 02:49:18,877 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-12-09 02:49:18,911 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/data/dd1da850a/b2f98b973f9241e1ab7286ec98ef8e74/FLAG8abdae2ff [2018-12-09 02:49:19,357 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 02:49:19,357 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-12-09 02:49:19,363 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/data/dd1da850a/b2f98b973f9241e1ab7286ec98ef8e74/FLAG8abdae2ff [2018-12-09 02:49:19,371 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/bin-2019/uautomizer/data/dd1da850a/b2f98b973f9241e1ab7286ec98ef8e74 [2018-12-09 02:49:19,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 02:49:19,374 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 02:49:19,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 02:49:19,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 02:49:19,378 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 02:49:19,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:49:19" (1/1) ... [2018-12-09 02:49:19,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f01457b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:19, skipping insertion in model container [2018-12-09 02:49:19,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:49:19" (1/1) ... [2018-12-09 02:49:19,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 02:49:19,409 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 02:49:19,560 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:49:19,566 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 02:49:19,592 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:49:19,651 INFO L195 MainTranslator]: Completed translation [2018-12-09 02:49:19,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:19 WrapperNode [2018-12-09 02:49:19,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 02:49:19,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 02:49:19,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 02:49:19,652 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 02:49:19,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:19" (1/1) ... [2018-12-09 02:49:19,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:19" (1/1) ... [2018-12-09 02:49:19,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:19" (1/1) ... [2018-12-09 02:49:19,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:19" (1/1) ... [2018-12-09 02:49:19,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:19" (1/1) ... [2018-12-09 02:49:19,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:19" (1/1) ... [2018-12-09 02:49:19,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:19" (1/1) ... [2018-12-09 02:49:19,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 02:49:19,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 02:49:19,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 02:49:19,684 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 02:49:19,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:19,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 02:49:19,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 02:49:19,715 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-09 02:49:19,715 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 02:49:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-09 02:49:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 02:49:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 02:49:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 02:49:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 02:49:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 02:49:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 02:49:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 02:49:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 02:49:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 02:49:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 02:49:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 02:49:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 02:49:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 02:49:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 02:49:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 02:49:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 02:49:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 02:49:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 02:49:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 02:49:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 02:49:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 02:49:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 02:49:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 02:49:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 02:49:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 02:49:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 02:49:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 02:49:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 02:49:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 02:49:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 02:49:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 02:49:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 02:49:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 02:49:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 02:49:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 02:49:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 02:49:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 02:49:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 02:49:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 02:49:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 02:49:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 02:49:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 02:49:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 02:49:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 02:49:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 02:49:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 02:49:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 02:49:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 02:49:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 02:49:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 02:49:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 02:49:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 02:49:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 02:49:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 02:49:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 02:49:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 02:49:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 02:49:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 02:49:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 02:49:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 02:49:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 02:49:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 02:49:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 02:49:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 02:49:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-09 02:49:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 02:49:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 02:49:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 02:49:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 02:49:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 02:49:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 02:49:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 02:49:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 02:49:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 02:49:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 02:49:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 02:49:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 02:49:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 02:49:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 02:49:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 02:49:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 02:49:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 02:49:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 02:49:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 02:49:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 02:49:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 02:49:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 02:49:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 02:49:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 02:49:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 02:49:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 02:49:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 02:49:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 02:49:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 02:49:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 02:49:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 02:49:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 02:49:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 02:49:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 02:49:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 02:49:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 02:49:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 02:49:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-09 02:49:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 02:49:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 02:49:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 02:49:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 02:49:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 02:49:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 02:49:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 02:49:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 02:49:20,053 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 02:49:20,054 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 02:49:20,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:49:20 BoogieIcfgContainer [2018-12-09 02:49:20,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 02:49:20,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 02:49:20,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 02:49:20,056 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 02:49:20,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:49:19" (1/3) ... [2018-12-09 02:49:20,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453b1225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:49:20, skipping insertion in model container [2018-12-09 02:49:20,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:19" (2/3) ... [2018-12-09 02:49:20,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453b1225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:49:20, skipping insertion in model container [2018-12-09 02:49:20,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:49:20" (3/3) ... [2018-12-09 02:49:20,058 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-12-09 02:49:20,064 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 02:49:20,069 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-12-09 02:49:20,078 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2018-12-09 02:49:20,093 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 02:49:20,093 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 02:49:20,093 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 02:49:20,093 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 02:49:20,094 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 02:49:20,094 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 02:49:20,094 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 02:49:20,094 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 02:49:20,094 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 02:49:20,103 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-12-09 02:49:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 02:49:20,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:20,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:20,110 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:20,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:20,113 INFO L82 PathProgramCache]: Analyzing trace with hash 44321787, now seen corresponding path program 1 times [2018-12-09 02:49:20,116 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:20,116 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:20,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:20,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:20,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 02:49:20,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:20,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:20,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 02:49:20,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:20,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:20,228 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-09 02:49:20,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:20,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:49:20,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-09 02:49:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:20,258 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 02:49:20,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:20,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:49:20,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:49:20,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:49:20,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:49:20,278 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 5 states. [2018-12-09 02:49:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:20,572 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-12-09 02:49:20,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:49:20,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 02:49:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:20,582 INFO L225 Difference]: With dead ends: 88 [2018-12-09 02:49:20,582 INFO L226 Difference]: Without dead ends: 85 [2018-12-09 02:49:20,584 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-09 02:49:20,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-09 02:49:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-12-09 02:49:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-09 02:49:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-12-09 02:49:20,611 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 9 [2018-12-09 02:49:20,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:20,611 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-12-09 02:49:20,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:49:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-12-09 02:49:20,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 02:49:20,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:20,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:20,612 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:20,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:20,612 INFO L82 PathProgramCache]: Analyzing trace with hash 44321788, now seen corresponding path program 1 times [2018-12-09 02:49:20,613 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:20,613 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:20,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:20,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:20,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 02:49:20,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:20,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 02:49:20,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:20,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:20,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 02:49:20,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:20,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:20,701 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-09 02:49:20,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:20,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:20,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:20,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 02:49:20,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:20,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:49:20,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-12-09 02:49:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:20,738 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 02:49:20,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:20,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:49:20,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:49:20,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:49:20,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:49:20,740 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 5 states. [2018-12-09 02:49:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:21,085 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-12-09 02:49:21,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:49:21,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 02:49:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:21,088 INFO L225 Difference]: With dead ends: 110 [2018-12-09 02:49:21,088 INFO L226 Difference]: Without dead ends: 110 [2018-12-09 02:49:21,089 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-09 02:49:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-09 02:49:21,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2018-12-09 02:49:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-09 02:49:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2018-12-09 02:49:21,096 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 9 [2018-12-09 02:49:21,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:21,096 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-12-09 02:49:21,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:49:21,097 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2018-12-09 02:49:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 02:49:21,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:21,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:21,097 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:21,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1373975463, now seen corresponding path program 1 times [2018-12-09 02:49:21,098 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:21,098 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:21,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:21,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:21,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 02:49:21,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 02:49:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:21,150 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 02:49:21,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:21,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 02:49:21,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:49:21,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:49:21,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:49:21,151 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 3 states. [2018-12-09 02:49:21,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:21,237 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-12-09 02:49:21,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:49:21,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 02:49:21,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:21,238 INFO L225 Difference]: With dead ends: 89 [2018-12-09 02:49:21,239 INFO L226 Difference]: Without dead ends: 89 [2018-12-09 02:49:21,239 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-09 02:49:21,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-09 02:49:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-09 02:49:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-09 02:49:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-12-09 02:49:21,243 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 10 [2018-12-09 02:49:21,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:21,243 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-12-09 02:49:21,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:49:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-12-09 02:49:21,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 02:49:21,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:21,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:21,244 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:21,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:21,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1373975464, now seen corresponding path program 1 times [2018-12-09 02:49:21,244 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:21,244 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:21,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:21,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:21,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 02:49:21,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 02:49:21,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-09 02:49:21,300 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 02:49:21,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:21,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 02:49:21,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:49:21,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:49:21,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:49:21,302 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 3 states. [2018-12-09 02:49:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:21,394 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-12-09 02:49:21,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:49:21,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 02:49:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:21,395 INFO L225 Difference]: With dead ends: 85 [2018-12-09 02:49:21,395 INFO L226 Difference]: Without dead ends: 85 [2018-12-09 02:49:21,395 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-09 02:49:21,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-09 02:49:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-09 02:49:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-09 02:49:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-12-09 02:49:21,398 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 10 [2018-12-09 02:49:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:21,398 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-12-09 02:49:21,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:49:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-12-09 02:49:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 02:49:21,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:21,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:21,399 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:21,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:21,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1028212614, now seen corresponding path program 1 times [2018-12-09 02:49:21,399 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:21,400 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:21,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:21,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:21,552 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-09 02:49:21,557 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-09 02:49:21,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,623 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-09 02:49:21,627 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-09 02:49:21,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,653 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-09 02:49:21,653 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,671 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-09 02:49:21,671 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-12-09 02:49:21,705 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-09 02:49:21,708 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-09 02:49:21,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,724 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-09 02:49:21,724 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,737 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-09 02:49:21,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,758 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-09 02:49:21,761 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-09 02:49:21,761 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 02:49:21,779 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,792 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-09 02:49:21,793 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,797 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:21,799 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-09 02:49:21,799 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2018-12-09 02:49:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:21,812 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 02:49:21,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:21,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 02:49:21,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 02:49:21,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 02:49:21,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=38, Unknown=5, NotChecked=0, Total=56 [2018-12-09 02:49:21,814 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 8 states. [2018-12-09 02:49:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:22,358 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-12-09 02:49:22,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 02:49:22,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 02:49:22,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:22,360 INFO L225 Difference]: With dead ends: 93 [2018-12-09 02:49:22,360 INFO L226 Difference]: Without dead ends: 93 [2018-12-09 02:49:22,360 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-09 02:49:22,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-09 02:49:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-12-09 02:49:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-09 02:49:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-12-09 02:49:22,364 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 15 [2018-12-09 02:49:22,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:22,365 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-12-09 02:49:22,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 02:49:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-12-09 02:49:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 02:49:22,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:22,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:22,366 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:22,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1810098092, now seen corresponding path program 1 times [2018-12-09 02:49:22,366 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:22,366 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:22,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:22,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:22,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:22,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 02:49:22,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:22,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:22,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:22,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 02:49:22,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:22,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:49:22,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-09 02:49:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:22,528 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 02:49:22,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:22,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:49:22,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:49:22,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:49:22,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:49:22,530 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 7 states. [2018-12-09 02:49:22,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:22,801 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-12-09 02:49:22,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:49:22,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-09 02:49:22,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:22,802 INFO L225 Difference]: With dead ends: 93 [2018-12-09 02:49:22,802 INFO L226 Difference]: Without dead ends: 93 [2018-12-09 02:49:22,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-09 02:49:22,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-09 02:49:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-09 02:49:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-09 02:49:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-12-09 02:49:22,806 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 16 [2018-12-09 02:49:22,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:22,807 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-12-09 02:49:22,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:49:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-12-09 02:49:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 02:49:22,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:22,807 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-09 02:49:22,808 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:22,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:22,808 INFO L82 PathProgramCache]: Analyzing trace with hash -659541597, now seen corresponding path program 1 times [2018-12-09 02:49:22,808 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:22,808 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:22,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:22,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:22,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 02:49:22,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:22,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:22,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-09 02:49:22,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 02:49:22,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 02:49:22,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:22,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:22,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:22,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 02:49:22,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 02:49:22,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 02:49:22,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:22,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:22,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:22,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-09 02:49:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:22,939 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 02:49:22,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:22,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:49:22,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 02:49:22,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 02:49:22,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:49:22,942 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 8 states. [2018-12-09 02:49:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:23,321 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-12-09 02:49:23,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:49:23,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-12-09 02:49:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:23,323 INFO L225 Difference]: With dead ends: 105 [2018-12-09 02:49:23,323 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 02:49:23,323 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-09 02:49:23,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 02:49:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-12-09 02:49:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-09 02:49:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-12-09 02:49:23,329 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 24 [2018-12-09 02:49:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:23,330 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-12-09 02:49:23,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 02:49:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-12-09 02:49:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 02:49:23,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:23,331 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-09 02:49:23,332 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:23,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:23,332 INFO L82 PathProgramCache]: Analyzing trace with hash -659541596, now seen corresponding path program 1 times [2018-12-09 02:49:23,332 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:23,332 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:23,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:23,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:23,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 02:49:23,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 02:49:23,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:23,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:23,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 02:49:23,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 02:49:23,483 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:23,485 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:23,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:23,493 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-09 02:49:23,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 02:49:23,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 02:49:23,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:23,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:23,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 17 treesize of output 13 [2018-12-09 02:49:23,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 02:49:23,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:23,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:23,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:23,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-09 02:49:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:23,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 02:49:23,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:23,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:49:23,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 02:49:23,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 02:49:23,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:49:23,563 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 8 states. [2018-12-09 02:49:23,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:23,943 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-12-09 02:49:23,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:49:23,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-12-09 02:49:23,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:23,946 INFO L225 Difference]: With dead ends: 102 [2018-12-09 02:49:23,947 INFO L226 Difference]: Without dead ends: 102 [2018-12-09 02:49:23,947 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-09 02:49:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-09 02:49:23,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2018-12-09 02:49:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-09 02:49:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-12-09 02:49:23,955 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 24 [2018-12-09 02:49:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:23,955 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-12-09 02:49:23,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 02:49:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-12-09 02:49:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 02:49:23,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:23,957 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-09 02:49:23,957 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:23,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:23,958 INFO L82 PathProgramCache]: Analyzing trace with hash -659553545, now seen corresponding path program 1 times [2018-12-09 02:49:23,958 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:23,959 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:23,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:24,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:24,045 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 02:49:24,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:24,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:49:24,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:49:24,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:49:24,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:49:24,047 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 4 states. [2018-12-09 02:49:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:24,071 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-12-09 02:49:24,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:49:24,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-12-09 02:49:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:24,072 INFO L225 Difference]: With dead ends: 114 [2018-12-09 02:49:24,072 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 02:49:24,072 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-09 02:49:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 02:49:24,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2018-12-09 02:49:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 02:49:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2018-12-09 02:49:24,075 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 24 [2018-12-09 02:49:24,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:24,076 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2018-12-09 02:49:24,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:49:24,076 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2018-12-09 02:49:24,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 02:49:24,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:24,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:24,076 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:24,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:24,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1071674923, now seen corresponding path program 1 times [2018-12-09 02:49:24,077 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:24,077 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:24,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:24,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:24,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 02:49:24,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 02:49:24,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:24,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:24,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:24,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 02:49:24,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 02:49:24,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 02:49:24,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:24,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:24,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:24,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 02:49:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:24,205 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 02:49:24,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:24,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:49:24,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:49:24,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:49:24,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:49:24,208 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 7 states. [2018-12-09 02:49:24,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:24,420 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-12-09 02:49:24,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:49:24,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-09 02:49:24,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:24,421 INFO L225 Difference]: With dead ends: 114 [2018-12-09 02:49:24,421 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 02:49:24,422 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-09 02:49:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 02:49:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2018-12-09 02:49:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 02:49:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-12-09 02:49:24,425 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 27 [2018-12-09 02:49:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:24,425 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-12-09 02:49:24,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:49:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-12-09 02:49:24,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 02:49:24,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:24,426 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-09 02:49:24,426 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:24,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:24,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1137815676, now seen corresponding path program 1 times [2018-12-09 02:49:24,427 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:24,427 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:24,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:24,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:24,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 02:49:24,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:24,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:24,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-09 02:49:24,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 02:49:24,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 02:49:24,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:24,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:24,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:24,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 02:49:24,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 02:49:24,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 02:49:24,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:24,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:24,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:24,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-09 02:49:24,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:24,584 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 02:49:24,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:24,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:49:24,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 02:49:24,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 02:49:24,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:49:24,587 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 8 states. [2018-12-09 02:49:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:25,023 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-12-09 02:49:25,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:49:25,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-09 02:49:25,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:25,024 INFO L225 Difference]: With dead ends: 113 [2018-12-09 02:49:25,024 INFO L226 Difference]: Without dead ends: 113 [2018-12-09 02:49:25,024 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-09 02:49:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-09 02:49:25,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2018-12-09 02:49:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 02:49:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2018-12-09 02:49:25,026 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 28 [2018-12-09 02:49:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:25,027 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2018-12-09 02:49:25,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 02:49:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2018-12-09 02:49:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 02:49:25,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:25,027 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-09 02:49:25,027 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:25,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:25,028 INFO L82 PathProgramCache]: Analyzing trace with hash 923379735, now seen corresponding path program 1 times [2018-12-09 02:49:25,028 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:25,028 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:25,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:25,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:25,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 02:49:25,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-09 02:49:25,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 02:49:25,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 02:49:25,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 02:49:25,199 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-09 02:49:25,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2018-12-09 02:49:25,261 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-09 02:49:25,264 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-09 02:49:25,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:49:25,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-12-09 02:49:25,334 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-09 02:49:25,338 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-09 02:49:25,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,369 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-09 02:49:25,369 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,377 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-09 02:49:25,377 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2018-12-09 02:49:25,395 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-09 02:49:25,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:49:25,576 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-09 02:49:25,578 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-09 02:49:25,578 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:49:25,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:49:25,600 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-09 02:49:25,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2018-12-09 02:49:25,752 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-09 02:49:25,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,796 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-09 02:49:25,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,832 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-09 02:49:25,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2018-12-09 02:49:25,838 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-09 02:49:25,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,842 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-09 02:49:25,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:25,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 02:49:25,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2018-12-09 02:49:25,858 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-09 02:49:25,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:49:25,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-12-09 02:49:25,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 02:49:25,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 02:49:25,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-09 02:49:25,862 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 17 states. [2018-12-09 02:49:26,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:26,985 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-12-09 02:49:26,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 02:49:26,986 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-12-09 02:49:26,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:26,986 INFO L225 Difference]: With dead ends: 117 [2018-12-09 02:49:26,987 INFO L226 Difference]: Without dead ends: 117 [2018-12-09 02:49:26,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-12-09 02:49:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-09 02:49:26,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2018-12-09 02:49:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 02:49:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-12-09 02:49:26,989 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 29 [2018-12-09 02:49:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:26,989 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-12-09 02:49:26,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 02:49:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-12-09 02:49:26,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 02:49:26,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:26,990 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-09 02:49:26,990 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:26,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:26,991 INFO L82 PathProgramCache]: Analyzing trace with hash 923379736, now seen corresponding path program 1 times [2018-12-09 02:49:26,991 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:26,991 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:27,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:27,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:27,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 02:49:27,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 02:49:27,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-12-09 02:49:27,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:27,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 02:49:27,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:27,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:27,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 02:49:27,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:49:27,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-12-09 02:49:27,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 02:49:27,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 02:49:27,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 02:49:27,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 02:49:27,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,311 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-09 02:49:27,311 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:41 [2018-12-09 02:49:27,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:27,415 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-09 02:49:27,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:27,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:27,433 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-09 02:49:27,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,445 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-09 02:49:27,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:46 [2018-12-09 02:49:27,529 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-09 02:49:27,534 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-09 02:49:27,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,572 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-09 02:49:27,573 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,627 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-09 02:49:27,630 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-09 02:49:27,630 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,674 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,686 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-09 02:49:27,686 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2018-12-09 02:49:27,732 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-09 02:49:27,736 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-09 02:49:27,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,757 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-09 02:49:27,757 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,791 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-09 02:49:27,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-12-09 02:49:27,794 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,816 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-09 02:49:27,816 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,836 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-09 02:49:27,837 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,845 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:27,851 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-09 02:49:27,851 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:68, output treesize:20 [2018-12-09 02:49:27,885 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-09 02:49:27,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:49:29,081 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-09 02:49:29,084 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-09 02:49:29,087 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-09 02:49:29,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:29,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:29,094 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-09 02:49:29,096 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-09 02:49:29,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:29,103 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:29,108 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-09 02:49:29,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-09 02:49:29,112 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:29,123 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:29,268 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-09 02:49:29,270 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-09 02:49:29,271 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:29,274 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:29,276 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-09 02:49:29,278 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-09 02:49:29,279 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:29,282 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:29,401 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-09 02:49:29,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-09 02:49:29,404 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:49:29,416 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-09 02:49:29,418 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-09 02:49:29,422 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-09 02:49:29,422 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-09 02:49:29,434 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-09 02:49:29,555 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-09 02:49:29,558 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-09 02:49:29,558 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-09 02:49:29,570 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-09 02:49:29,572 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-09 02:49:29,575 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-09 02:49:29,575 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-09 02:49:29,586 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-09 02:49:29,706 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-09 02:49:29,706 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2018-12-09 02:49:30,058 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2018-12-09 02:49:30,066 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:49:30,066 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:49:30,067 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-09 02:49:30,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:30,150 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:49:30,150 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:49:30,151 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-09 02:49:30,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:30,239 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:49:30,239 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:49:30,239 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-09 02:49:30,240 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:30,312 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:49:30,312 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:49:30,312 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-09 02:49:30,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:30,381 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:49:30,381 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 02:49:30,381 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-09 02:49:30,382 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:30,450 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-09 02:49:30,450 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 12 variables, input treesize:104, output treesize:47 [2018-12-09 02:49:30,871 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-09 02:49:30,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:49:30,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-12-09 02:49:30,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 02:49:30,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 02:49:30,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-12-09 02:49:30,874 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 21 states. [2018-12-09 02:49:31,867 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2018-12-09 02:49:32,501 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2018-12-09 02:49:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:51,707 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-12-09 02:49:51,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 02:49:51,708 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-12-09 02:49:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:51,709 INFO L225 Difference]: With dead ends: 137 [2018-12-09 02:49:51,709 INFO L226 Difference]: Without dead ends: 137 [2018-12-09 02:49:51,709 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-09 02:49:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-09 02:49:51,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 104. [2018-12-09 02:49:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 02:49:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-12-09 02:49:51,711 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 29 [2018-12-09 02:49:51,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:51,711 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-12-09 02:49:51,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 02:49:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-12-09 02:49:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 02:49:51,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:51,712 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-09 02:49:51,712 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:51,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:51,713 INFO L82 PathProgramCache]: Analyzing trace with hash -912547506, now seen corresponding path program 1 times [2018-12-09 02:49:51,713 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:51,713 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:51,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:51,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:51,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 02:49:51,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:51,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:51,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 02:49:51,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 02:49:51,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:51,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:51,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-12-09 02:49:51,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 02:49:51,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 02:49:51,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:51,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:51,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:51,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-09 02:49:51,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:51,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:51,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-09 02:49:51,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:51,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:51,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-12-09 02:49:51,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 02:49:51,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-09 02:49:51,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:51,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:51,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 02:49:51,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-09 02:49:51,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 02:49:51,893 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-09 02:49:51,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 02:49:51,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 02:49:51,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-09 02:49:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:51,910 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 02:49:51,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:51,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 02:49:51,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 02:49:51,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 02:49:51,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:49:51,913 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 9 states. [2018-12-09 02:49:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:56,386 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-12-09 02:49:56,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:49:56,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-12-09 02:49:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:56,387 INFO L225 Difference]: With dead ends: 128 [2018-12-09 02:49:56,387 INFO L226 Difference]: Without dead ends: 128 [2018-12-09 02:49:56,387 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-09 02:49:56,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-09 02:49:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 105. [2018-12-09 02:49:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 02:49:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-12-09 02:49:56,389 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 29 [2018-12-09 02:49:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:56,389 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-12-09 02:49:56,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 02:49:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-12-09 02:49:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 02:49:56,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:56,389 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-09 02:49:56,389 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:56,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:56,390 INFO L82 PathProgramCache]: Analyzing trace with hash -912547505, now seen corresponding path program 1 times [2018-12-09 02:49:56,390 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:56,390 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:56,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:56,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:49:56,443 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 02:49:56,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:56,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 02:49:56,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:49:56,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:49:56,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:49:56,445 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 3 states. [2018-12-09 02:49:56,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:56,553 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2018-12-09 02:49:56,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:49:56,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 02:49:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:56,555 INFO L225 Difference]: With dead ends: 100 [2018-12-09 02:49:56,555 INFO L226 Difference]: Without dead ends: 100 [2018-12-09 02:49:56,555 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-09 02:49:56,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-09 02:49:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2018-12-09 02:49:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-09 02:49:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-12-09 02:49:56,557 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 29 [2018-12-09 02:49:56,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:56,557 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-12-09 02:49:56,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:49:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-12-09 02:49:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 02:49:56,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:56,558 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-09 02:49:56,558 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 02:49:56,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:56,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1698250232, now seen corresponding path program 1 times [2018-12-09 02:49:56,559 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 02:49:56,559 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52656a0f-112c-46ba-bfa1-f4194cbb0115/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-09 02:49:56,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:49:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:49:56,857 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 02:49:56,867 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 02:49:56,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:49:56 BoogieIcfgContainer [2018-12-09 02:49:56,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 02:49:56,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 02:49:56,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 02:49:56,878 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 02:49:56,878 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:49:20" (3/4) ... [2018-12-09 02:49:56,880 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 02:49:56,880 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 02:49:56,881 INFO L168 Benchmark]: Toolchain (without parser) took 37507.29 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -116.7 MB). Peak memory consumption was 200.5 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:56,881 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:49:56,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:56,881 INFO L168 Benchmark]: Boogie Preprocessor took 32.06 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-09 02:49:56,881 INFO L168 Benchmark]: RCFGBuilder took 370.07 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: 54.2 MB). Peak memory consumption was 54.2 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:56,882 INFO L168 Benchmark]: TraceAbstraction took 36822.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.6 MB). Peak memory consumption was 186.7 MB. Max. memory is 11.5 GB. [2018-12-09 02:49:56,882 INFO L168 Benchmark]: Witness Printer took 2.81 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-09 02:49:56,882 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.06 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 370.07 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: 54.2 MB). Peak memory consumption was 54.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36822.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.6 MB). Peak memory consumption was 186.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.81 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)=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, 36.7s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 29.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 790 SDtfs, 1143 SDslu, 2332 SDs, 0 SdLazy, 2902 SolverSat, 150 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 26.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 265 SyntacticMatches, 4 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 4.2s 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, 141 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.5s 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...