./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/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 e6399ca05df7547b7620299987a8a06e9e2c006b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/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 e6399ca05df7547b7620299987a8a06e9e2c006b ................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:02:05,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:02:05,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:02:05,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:02:05,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:02:05,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:02:05,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:02:05,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:02:05,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:02:05,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:02:05,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:02:05,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:02:05,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:02:05,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:02:05,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:02:05,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:02:05,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:02:05,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:02:05,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:02:05,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:02:05,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:02:05,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:02:05,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:02:05,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:02:05,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:02:05,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:02:05,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:02:05,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:02:05,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:02:05,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:02:05,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:02:05,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:02:05,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:02:05,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:02:05,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:02:05,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:02:05,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:02:05,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:02:05,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:02:05,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:02:05,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:02:05,220 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:02:05,233 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:02:05,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:02:05,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:02:05,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:02:05,235 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:02:05,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:02:05,235 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:02:05,236 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:02:05,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:02:05,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:02:05,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:02:05,237 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:02:05,237 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:02:05,237 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:02:05,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:02:05,238 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:02:05,238 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:02:05,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:02:05,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:02:05,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:02:05,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:02:05,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:02:05,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:02:05,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:02:05,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:02:05,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:02:05,241 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/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 -> e6399ca05df7547b7620299987a8a06e9e2c006b [2019-11-16 00:02:05,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:02:05,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:02:05,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:02:05,281 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:02:05,282 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:02:05,282 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/../../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2019-11-16 00:02:05,336 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/data/fcb15feca/562562dcd42e4feb810408bd766d8c29/FLAG7886863f0 [2019-11-16 00:02:05,794 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:02:05,795 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2019-11-16 00:02:05,807 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/data/fcb15feca/562562dcd42e4feb810408bd766d8c29/FLAG7886863f0 [2019-11-16 00:02:06,301 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/data/fcb15feca/562562dcd42e4feb810408bd766d8c29 [2019-11-16 00:02:06,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:02:06,305 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:02:06,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:02:06,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:02:06,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:02:06,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:02:06" (1/1) ... [2019-11-16 00:02:06,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a3bc34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:06, skipping insertion in model container [2019-11-16 00:02:06,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:02:06" (1/1) ... [2019-11-16 00:02:06,321 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:02:06,376 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:02:06,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:02:06,755 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:02:06,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:02:06,863 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:02:06,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:06 WrapperNode [2019-11-16 00:02:06,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:02:06,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:02:06,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:02:06,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:02:06,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:06" (1/1) ... [2019-11-16 00:02:06,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:06" (1/1) ... [2019-11-16 00:02:06,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:06" (1/1) ... [2019-11-16 00:02:06,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:06" (1/1) ... [2019-11-16 00:02:06,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:06" (1/1) ... [2019-11-16 00:02:06,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:06" (1/1) ... [2019-11-16 00:02:06,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:06" (1/1) ... [2019-11-16 00:02:06,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:02:06,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:02:06,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:02:06,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:02:06,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/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 [2019-11-16 00:02:07,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:02:07,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:02:07,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:02:07,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:02:07,031 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-11-16 00:02:07,032 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-11-16 00:02:07,033 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-11-16 00:02:07,033 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-11-16 00:02:07,033 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-11-16 00:02:07,033 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-11-16 00:02:07,034 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:02:07,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:02:07,035 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:02:07,035 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:02:07,035 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:02:07,035 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:02:07,035 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:02:07,035 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:02:07,037 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:02:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:02:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:02:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:02:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:02:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:02:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:02:07,039 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:02:07,039 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:02:07,039 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:02:07,039 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:02:07,039 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:02:07,039 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:02:07,040 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:02:07,040 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:02:07,040 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:02:07,040 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:02:07,040 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:02:07,040 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:02:07,040 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:02:07,041 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:02:07,041 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:02:07,041 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:02:07,041 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:02:07,041 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:02:07,042 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:02:07,042 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:02:07,042 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:02:07,043 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:02:07,043 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:02:07,043 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:02:07,043 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:02:07,043 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:02:07,043 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:02:07,043 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:02:07,044 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:02:07,044 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:02:07,044 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:02:07,044 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:02:07,044 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:02:07,044 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:02:07,044 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:02:07,045 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:02:07,045 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:02:07,045 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:02:07,045 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:02:07,045 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:02:07,045 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:02:07,046 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:02:07,046 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:02:07,046 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:02:07,046 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:02:07,047 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:02:07,047 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:02:07,047 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:02:07,047 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:02:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:02:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:02:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:02:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:02:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:02:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:02:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:02:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:02:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:02:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:02:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:02:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:02:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:02:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:02:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:02:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:02:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:02:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:02:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:02:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:02:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:02:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:02:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:02:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:02:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:02:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:02:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:02:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:02:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:02:07,054 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:02:07,054 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:02:07,054 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:02:07,054 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:02:07,054 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:02:07,054 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:02:07,054 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:02:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:02:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:02:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:02:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:02:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-16 00:02:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-11-16 00:02:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-11-16 00:02:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:02:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:02:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-11-16 00:02:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:02:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:02:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:02:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-11-16 00:02:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-11-16 00:02:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-11-16 00:02:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:02:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:02:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:02:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:02:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:02:08,036 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:02:08,037 INFO L284 CfgBuilder]: Removed 33 assume(true) statements. [2019-11-16 00:02:08,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:02:08 BoogieIcfgContainer [2019-11-16 00:02:08,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:02:08,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:02:08,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:02:08,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:02:08,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:02:06" (1/3) ... [2019-11-16 00:02:08,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@691928ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:02:08, skipping insertion in model container [2019-11-16 00:02:08,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:06" (2/3) ... [2019-11-16 00:02:08,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@691928ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:02:08, skipping insertion in model container [2019-11-16 00:02:08,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:02:08" (3/3) ... [2019-11-16 00:02:08,044 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2019-11-16 00:02:08,053 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:02:08,060 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 104 error locations. [2019-11-16 00:02:08,072 INFO L249 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2019-11-16 00:02:08,091 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:02:08,091 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:02:08,091 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:02:08,092 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:02:08,092 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:02:08,092 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:02:08,093 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:02:08,093 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:02:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states. [2019-11-16 00:02:08,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-16 00:02:08,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:08,139 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:08,142 INFO L410 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:08,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:08,148 INFO L82 PathProgramCache]: Analyzing trace with hash 995848786, now seen corresponding path program 1 times [2019-11-16 00:02:08,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:08,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188836450] [2019-11-16 00:02:08,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:08,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:08,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:08,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188836450] [2019-11-16 00:02:08,287 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:08,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:08,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81397849] [2019-11-16 00:02:08,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:02:08,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:08,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:02:08,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:02:08,307 INFO L87 Difference]: Start difference. First operand 278 states. Second operand 3 states. [2019-11-16 00:02:08,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:08,822 INFO L93 Difference]: Finished difference Result 318 states and 353 transitions. [2019-11-16 00:02:08,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:02:08,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-16 00:02:08,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:08,849 INFO L225 Difference]: With dead ends: 318 [2019-11-16 00:02:08,849 INFO L226 Difference]: Without dead ends: 300 [2019-11-16 00:02:08,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:02:08,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-16 00:02:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 262. [2019-11-16 00:02:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-16 00:02:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 276 transitions. [2019-11-16 00:02:08,945 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 276 transitions. Word has length 9 [2019-11-16 00:02:08,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:08,945 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 276 transitions. [2019-11-16 00:02:08,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:02:08,946 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 276 transitions. [2019-11-16 00:02:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:02:08,946 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:08,946 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:08,950 INFO L410 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:08,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:08,950 INFO L82 PathProgramCache]: Analyzing trace with hash 805494535, now seen corresponding path program 1 times [2019-11-16 00:02:08,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:08,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983217033] [2019-11-16 00:02:08,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:08,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:08,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:09,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983217033] [2019-11-16 00:02:09,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:09,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:09,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108848704] [2019-11-16 00:02:09,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:09,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:09,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:09,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:09,053 INFO L87 Difference]: Start difference. First operand 262 states and 276 transitions. Second operand 4 states. [2019-11-16 00:02:09,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:09,769 INFO L93 Difference]: Finished difference Result 317 states and 342 transitions. [2019-11-16 00:02:09,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:02:09,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-16 00:02:09,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:09,772 INFO L225 Difference]: With dead ends: 317 [2019-11-16 00:02:09,772 INFO L226 Difference]: Without dead ends: 317 [2019-11-16 00:02:09,773 INFO L600 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 [2019-11-16 00:02:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-16 00:02:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 260. [2019-11-16 00:02:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-16 00:02:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 274 transitions. [2019-11-16 00:02:09,790 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 274 transitions. Word has length 10 [2019-11-16 00:02:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:09,791 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 274 transitions. [2019-11-16 00:02:09,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 274 transitions. [2019-11-16 00:02:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:02:09,791 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:09,792 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:09,792 INFO L410 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:09,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:09,793 INFO L82 PathProgramCache]: Analyzing trace with hash 805494536, now seen corresponding path program 1 times [2019-11-16 00:02:09,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:09,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015803081] [2019-11-16 00:02:09,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:09,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:09,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:09,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015803081] [2019-11-16 00:02:09,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:09,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:09,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094478620] [2019-11-16 00:02:09,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:09,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:09,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:09,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:09,858 INFO L87 Difference]: Start difference. First operand 260 states and 274 transitions. Second operand 4 states. [2019-11-16 00:02:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:10,411 INFO L93 Difference]: Finished difference Result 326 states and 352 transitions. [2019-11-16 00:02:10,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:02:10,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-16 00:02:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:10,415 INFO L225 Difference]: With dead ends: 326 [2019-11-16 00:02:10,415 INFO L226 Difference]: Without dead ends: 326 [2019-11-16 00:02:10,415 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-16 00:02:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 258. [2019-11-16 00:02:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-16 00:02:10,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 272 transitions. [2019-11-16 00:02:10,436 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 272 transitions. Word has length 10 [2019-11-16 00:02:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:10,436 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 272 transitions. [2019-11-16 00:02:10,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 272 transitions. [2019-11-16 00:02:10,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:02:10,437 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:10,437 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:10,437 INFO L410 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:10,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:10,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1991342111, now seen corresponding path program 1 times [2019-11-16 00:02:10,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:10,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882882165] [2019-11-16 00:02:10,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:10,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:10,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:10,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882882165] [2019-11-16 00:02:10,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:10,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:02:10,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672804845] [2019-11-16 00:02:10,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:10,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:10,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:10,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:10,497 INFO L87 Difference]: Start difference. First operand 258 states and 272 transitions. Second operand 4 states. [2019-11-16 00:02:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:11,002 INFO L93 Difference]: Finished difference Result 293 states and 308 transitions. [2019-11-16 00:02:11,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:02:11,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-16 00:02:11,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:11,006 INFO L225 Difference]: With dead ends: 293 [2019-11-16 00:02:11,006 INFO L226 Difference]: Without dead ends: 292 [2019-11-16 00:02:11,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:02:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-16 00:02:11,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 257. [2019-11-16 00:02:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-16 00:02:11,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 270 transitions. [2019-11-16 00:02:11,029 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 270 transitions. Word has length 14 [2019-11-16 00:02:11,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:11,030 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 270 transitions. [2019-11-16 00:02:11,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 270 transitions. [2019-11-16 00:02:11,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:02:11,031 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:11,031 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:11,031 INFO L410 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:11,032 INFO L82 PathProgramCache]: Analyzing trace with hash 742236455, now seen corresponding path program 1 times [2019-11-16 00:02:11,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:11,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022228888] [2019-11-16 00:02:11,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:11,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:11,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:11,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022228888] [2019-11-16 00:02:11,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:11,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:11,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121821337] [2019-11-16 00:02:11,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:11,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:11,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:11,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:11,107 INFO L87 Difference]: Start difference. First operand 257 states and 270 transitions. Second operand 4 states. [2019-11-16 00:02:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:11,638 INFO L93 Difference]: Finished difference Result 299 states and 318 transitions. [2019-11-16 00:02:11,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:02:11,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-16 00:02:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:11,640 INFO L225 Difference]: With dead ends: 299 [2019-11-16 00:02:11,640 INFO L226 Difference]: Without dead ends: 299 [2019-11-16 00:02:11,641 INFO L600 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 [2019-11-16 00:02:11,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-16 00:02:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2019-11-16 00:02:11,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-16 00:02:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 268 transitions. [2019-11-16 00:02:11,649 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 268 transitions. Word has length 15 [2019-11-16 00:02:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:11,650 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 268 transitions. [2019-11-16 00:02:11,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 268 transitions. [2019-11-16 00:02:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:02:11,650 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:11,651 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:11,651 INFO L410 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:11,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:11,651 INFO L82 PathProgramCache]: Analyzing trace with hash 742236456, now seen corresponding path program 1 times [2019-11-16 00:02:11,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:11,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146706206] [2019-11-16 00:02:11,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:11,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:11,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:11,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146706206] [2019-11-16 00:02:11,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:11,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:11,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273420644] [2019-11-16 00:02:11,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:11,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:11,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:11,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:11,715 INFO L87 Difference]: Start difference. First operand 255 states and 268 transitions. Second operand 4 states. [2019-11-16 00:02:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:12,221 INFO L93 Difference]: Finished difference Result 308 states and 328 transitions. [2019-11-16 00:02:12,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:02:12,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-16 00:02:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:12,224 INFO L225 Difference]: With dead ends: 308 [2019-11-16 00:02:12,224 INFO L226 Difference]: Without dead ends: 308 [2019-11-16 00:02:12,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-16 00:02:12,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 253. [2019-11-16 00:02:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-16 00:02:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 266 transitions. [2019-11-16 00:02:12,237 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 266 transitions. Word has length 15 [2019-11-16 00:02:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:12,237 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 266 transitions. [2019-11-16 00:02:12,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 266 transitions. [2019-11-16 00:02:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:02:12,238 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:12,238 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:12,239 INFO L410 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:12,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:12,239 INFO L82 PathProgramCache]: Analyzing trace with hash -224686077, now seen corresponding path program 1 times [2019-11-16 00:02:12,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:12,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543877046] [2019-11-16 00:02:12,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:12,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:12,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:12,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543877046] [2019-11-16 00:02:12,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:12,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:02:12,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896889813] [2019-11-16 00:02:12,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:02:12,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:12,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:02:12,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:02:12,349 INFO L87 Difference]: Start difference. First operand 253 states and 266 transitions. Second operand 5 states. [2019-11-16 00:02:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:12,976 INFO L93 Difference]: Finished difference Result 312 states and 332 transitions. [2019-11-16 00:02:12,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:02:12,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-16 00:02:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:12,979 INFO L225 Difference]: With dead ends: 312 [2019-11-16 00:02:12,979 INFO L226 Difference]: Without dead ends: 312 [2019-11-16 00:02:12,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:02:12,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-16 00:02:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 253. [2019-11-16 00:02:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-16 00:02:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 265 transitions. [2019-11-16 00:02:12,992 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 265 transitions. Word has length 21 [2019-11-16 00:02:12,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:12,992 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 265 transitions. [2019-11-16 00:02:12,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:02:12,993 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 265 transitions. [2019-11-16 00:02:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:02:12,994 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:12,994 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:12,995 INFO L410 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:12,996 INFO L82 PathProgramCache]: Analyzing trace with hash 552515561, now seen corresponding path program 1 times [2019-11-16 00:02:12,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:12,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078852037] [2019-11-16 00:02:12,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:12,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:12,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:13,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078852037] [2019-11-16 00:02:13,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:13,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:02:13,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008415541] [2019-11-16 00:02:13,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:13,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:13,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:13,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:13,148 INFO L87 Difference]: Start difference. First operand 253 states and 265 transitions. Second operand 7 states. [2019-11-16 00:02:14,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:14,108 INFO L93 Difference]: Finished difference Result 293 states and 312 transitions. [2019-11-16 00:02:14,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:02:14,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-16 00:02:14,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:14,111 INFO L225 Difference]: With dead ends: 293 [2019-11-16 00:02:14,111 INFO L226 Difference]: Without dead ends: 293 [2019-11-16 00:02:14,111 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:02:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-16 00:02:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 246. [2019-11-16 00:02:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-16 00:02:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 260 transitions. [2019-11-16 00:02:14,119 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 260 transitions. Word has length 25 [2019-11-16 00:02:14,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:14,119 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 260 transitions. [2019-11-16 00:02:14,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:02:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 260 transitions. [2019-11-16 00:02:14,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:02:14,120 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:14,120 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:14,120 INFO L410 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:14,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:14,121 INFO L82 PathProgramCache]: Analyzing trace with hash 552515562, now seen corresponding path program 1 times [2019-11-16 00:02:14,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:14,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627347926] [2019-11-16 00:02:14,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:14,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:14,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:14,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627347926] [2019-11-16 00:02:14,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:14,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:02:14,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475016897] [2019-11-16 00:02:14,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:14,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:14,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:14,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:14,218 INFO L87 Difference]: Start difference. First operand 246 states and 260 transitions. Second operand 7 states. [2019-11-16 00:02:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:15,003 INFO L93 Difference]: Finished difference Result 331 states and 351 transitions. [2019-11-16 00:02:15,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:02:15,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-16 00:02:15,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:15,005 INFO L225 Difference]: With dead ends: 331 [2019-11-16 00:02:15,005 INFO L226 Difference]: Without dead ends: 331 [2019-11-16 00:02:15,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:02:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-16 00:02:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 274. [2019-11-16 00:02:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-11-16 00:02:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 291 transitions. [2019-11-16 00:02:15,016 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 291 transitions. Word has length 25 [2019-11-16 00:02:15,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:15,017 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 291 transitions. [2019-11-16 00:02:15,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:02:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 291 transitions. [2019-11-16 00:02:15,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:02:15,018 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:15,018 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:15,018 INFO L410 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:15,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:15,019 INFO L82 PathProgramCache]: Analyzing trace with hash 690194188, now seen corresponding path program 1 times [2019-11-16 00:02:15,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:15,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956517938] [2019-11-16 00:02:15,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:15,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:15,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:15,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956517938] [2019-11-16 00:02:15,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:15,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:02:15,187 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360306756] [2019-11-16 00:02:15,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:02:15,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:15,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:02:15,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:02:15,188 INFO L87 Difference]: Start difference. First operand 274 states and 291 transitions. Second operand 11 states. [2019-11-16 00:02:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:16,480 INFO L93 Difference]: Finished difference Result 338 states and 362 transitions. [2019-11-16 00:02:16,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:02:16,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-16 00:02:16,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:16,483 INFO L225 Difference]: With dead ends: 338 [2019-11-16 00:02:16,484 INFO L226 Difference]: Without dead ends: 338 [2019-11-16 00:02:16,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:02:16,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-16 00:02:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 275. [2019-11-16 00:02:16,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-16 00:02:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 293 transitions. [2019-11-16 00:02:16,495 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 293 transitions. Word has length 36 [2019-11-16 00:02:16,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:16,496 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 293 transitions. [2019-11-16 00:02:16,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:02:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 293 transitions. [2019-11-16 00:02:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:02:16,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:16,505 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:16,505 INFO L410 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:16,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:16,506 INFO L82 PathProgramCache]: Analyzing trace with hash 690194189, now seen corresponding path program 1 times [2019-11-16 00:02:16,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:16,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795232612] [2019-11-16 00:02:16,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:16,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:16,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:16,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795232612] [2019-11-16 00:02:16,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:16,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:02:16,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224718855] [2019-11-16 00:02:16,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:02:16,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:16,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:02:16,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:02:16,826 INFO L87 Difference]: Start difference. First operand 275 states and 293 transitions. Second operand 10 states. [2019-11-16 00:02:18,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:18,030 INFO L93 Difference]: Finished difference Result 322 states and 342 transitions. [2019-11-16 00:02:18,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:02:18,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-11-16 00:02:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:18,033 INFO L225 Difference]: With dead ends: 322 [2019-11-16 00:02:18,033 INFO L226 Difference]: Without dead ends: 322 [2019-11-16 00:02:18,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:02:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-16 00:02:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 275. [2019-11-16 00:02:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-16 00:02:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 292 transitions. [2019-11-16 00:02:18,043 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 292 transitions. Word has length 36 [2019-11-16 00:02:18,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:18,043 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 292 transitions. [2019-11-16 00:02:18,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:02:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 292 transitions. [2019-11-16 00:02:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:02:18,044 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:18,044 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:18,045 INFO L410 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:18,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:18,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1511282514, now seen corresponding path program 1 times [2019-11-16 00:02:18,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:18,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489500088] [2019-11-16 00:02:18,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:18,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:18,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:18,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:18,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489500088] [2019-11-16 00:02:18,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:18,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:02:18,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034093649] [2019-11-16 00:02:18,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:02:18,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:18,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:02:18,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:02:18,215 INFO L87 Difference]: Start difference. First operand 275 states and 292 transitions. Second operand 11 states. [2019-11-16 00:02:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:19,443 INFO L93 Difference]: Finished difference Result 336 states and 360 transitions. [2019-11-16 00:02:19,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:02:19,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-16 00:02:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:19,445 INFO L225 Difference]: With dead ends: 336 [2019-11-16 00:02:19,445 INFO L226 Difference]: Without dead ends: 336 [2019-11-16 00:02:19,446 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:02:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-16 00:02:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 275. [2019-11-16 00:02:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-16 00:02:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 291 transitions. [2019-11-16 00:02:19,454 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 291 transitions. Word has length 36 [2019-11-16 00:02:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:19,454 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 291 transitions. [2019-11-16 00:02:19,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:02:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 291 transitions. [2019-11-16 00:02:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:02:19,455 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:19,455 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:19,456 INFO L410 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:19,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:19,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1511282513, now seen corresponding path program 1 times [2019-11-16 00:02:19,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:19,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471619187] [2019-11-16 00:02:19,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:19,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:19,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:19,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471619187] [2019-11-16 00:02:19,584 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:19,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:02:19,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656615503] [2019-11-16 00:02:19,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:02:19,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:19,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:02:19,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:02:19,586 INFO L87 Difference]: Start difference. First operand 275 states and 291 transitions. Second operand 9 states. [2019-11-16 00:02:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:20,603 INFO L93 Difference]: Finished difference Result 320 states and 340 transitions. [2019-11-16 00:02:20,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:02:20,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-16 00:02:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:20,606 INFO L225 Difference]: With dead ends: 320 [2019-11-16 00:02:20,606 INFO L226 Difference]: Without dead ends: 320 [2019-11-16 00:02:20,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:02:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-16 00:02:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 275. [2019-11-16 00:02:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-16 00:02:20,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 290 transitions. [2019-11-16 00:02:20,614 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 290 transitions. Word has length 36 [2019-11-16 00:02:20,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:20,614 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 290 transitions. [2019-11-16 00:02:20,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:02:20,615 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 290 transitions. [2019-11-16 00:02:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-16 00:02:20,615 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:20,615 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:20,616 INFO L410 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:20,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:20,616 INFO L82 PathProgramCache]: Analyzing trace with hash 801871937, now seen corresponding path program 1 times [2019-11-16 00:02:20,616 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:20,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346814694] [2019-11-16 00:02:20,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:20,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:20,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:20,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346814694] [2019-11-16 00:02:20,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793588334] [2019-11-16 00:02:20,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:21,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-16 00:02:21,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:21,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-16 00:02:21,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:21,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:21,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-16 00:02:21,206 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:21,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:21,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:21,217 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-16 00:02:21,256 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:21,257 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-16 00:02:21,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:21,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:21,273 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:21,275 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:21,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-11-16 00:02:21,276 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:21,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:21,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:21,282 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:10 [2019-11-16 00:02:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:21,310 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:02:21,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 16 [2019-11-16 00:02:21,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072802426] [2019-11-16 00:02:21,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:02:21,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:21,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:02:21,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:02:21,312 INFO L87 Difference]: Start difference. First operand 275 states and 290 transitions. Second operand 16 states. [2019-11-16 00:02:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:22,877 INFO L93 Difference]: Finished difference Result 355 states and 378 transitions. [2019-11-16 00:02:22,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:02:22,878 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2019-11-16 00:02:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:22,880 INFO L225 Difference]: With dead ends: 355 [2019-11-16 00:02:22,880 INFO L226 Difference]: Without dead ends: 355 [2019-11-16 00:02:22,881 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:02:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-11-16 00:02:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 307. [2019-11-16 00:02:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-16 00:02:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 323 transitions. [2019-11-16 00:02:22,894 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 323 transitions. Word has length 41 [2019-11-16 00:02:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:22,895 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 323 transitions. [2019-11-16 00:02:22,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:02:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 323 transitions. [2019-11-16 00:02:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:02:22,897 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:22,897 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:23,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:23,111 INFO L410 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:23,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:23,111 INFO L82 PathProgramCache]: Analyzing trace with hash 257285329, now seen corresponding path program 1 times [2019-11-16 00:02:23,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:23,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33824159] [2019-11-16 00:02:23,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:23,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:23,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:23,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33824159] [2019-11-16 00:02:23,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:23,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:02:23,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498346444] [2019-11-16 00:02:23,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:23,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:23,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:23,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:23,207 INFO L87 Difference]: Start difference. First operand 307 states and 323 transitions. Second operand 7 states. [2019-11-16 00:02:23,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:23,998 INFO L93 Difference]: Finished difference Result 341 states and 365 transitions. [2019-11-16 00:02:23,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:02:23,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-11-16 00:02:23,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:24,000 INFO L225 Difference]: With dead ends: 341 [2019-11-16 00:02:24,001 INFO L226 Difference]: Without dead ends: 341 [2019-11-16 00:02:24,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:02:24,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-16 00:02:24,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 307. [2019-11-16 00:02:24,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-16 00:02:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 325 transitions. [2019-11-16 00:02:24,009 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 325 transitions. Word has length 46 [2019-11-16 00:02:24,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:24,010 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 325 transitions. [2019-11-16 00:02:24,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:02:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 325 transitions. [2019-11-16 00:02:24,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:02:24,011 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:24,011 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:24,011 INFO L410 AbstractCegarLoop]: === Iteration 16 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:24,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:24,012 INFO L82 PathProgramCache]: Analyzing trace with hash 257285330, now seen corresponding path program 1 times [2019-11-16 00:02:24,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:24,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385567803] [2019-11-16 00:02:24,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:24,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:24,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:24,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385567803] [2019-11-16 00:02:24,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:24,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:02:24,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261928670] [2019-11-16 00:02:24,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:24,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:24,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:24,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:24,103 INFO L87 Difference]: Start difference. First operand 307 states and 325 transitions. Second operand 7 states. [2019-11-16 00:02:24,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:24,862 INFO L93 Difference]: Finished difference Result 356 states and 379 transitions. [2019-11-16 00:02:24,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:02:24,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-11-16 00:02:24,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:24,865 INFO L225 Difference]: With dead ends: 356 [2019-11-16 00:02:24,865 INFO L226 Difference]: Without dead ends: 356 [2019-11-16 00:02:24,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:02:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-16 00:02:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 326. [2019-11-16 00:02:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-11-16 00:02:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 349 transitions. [2019-11-16 00:02:24,873 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 349 transitions. Word has length 46 [2019-11-16 00:02:24,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:24,873 INFO L462 AbstractCegarLoop]: Abstraction has 326 states and 349 transitions. [2019-11-16 00:02:24,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:02:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 349 transitions. [2019-11-16 00:02:24,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:02:24,875 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:24,875 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:24,875 INFO L410 AbstractCegarLoop]: === Iteration 17 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:24,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:24,876 INFO L82 PathProgramCache]: Analyzing trace with hash -679135460, now seen corresponding path program 1 times [2019-11-16 00:02:24,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:24,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143082220] [2019-11-16 00:02:24,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:24,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:24,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:02:24,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143082220] [2019-11-16 00:02:24,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:24,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:02:24,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035458575] [2019-11-16 00:02:24,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:02:24,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:24,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:02:24,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:02:24,933 INFO L87 Difference]: Start difference. First operand 326 states and 349 transitions. Second operand 6 states. [2019-11-16 00:02:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:25,686 INFO L93 Difference]: Finished difference Result 332 states and 354 transitions. [2019-11-16 00:02:25,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:02:25,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-16 00:02:25,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:25,688 INFO L225 Difference]: With dead ends: 332 [2019-11-16 00:02:25,689 INFO L226 Difference]: Without dead ends: 332 [2019-11-16 00:02:25,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:02:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-16 00:02:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 323. [2019-11-16 00:02:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-16 00:02:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 346 transitions. [2019-11-16 00:02:25,697 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 346 transitions. Word has length 47 [2019-11-16 00:02:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:25,698 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 346 transitions. [2019-11-16 00:02:25,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:02:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 346 transitions. [2019-11-16 00:02:25,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:02:25,699 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:25,699 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:25,699 INFO L410 AbstractCegarLoop]: === Iteration 18 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:25,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:25,700 INFO L82 PathProgramCache]: Analyzing trace with hash -679135459, now seen corresponding path program 1 times [2019-11-16 00:02:25,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:25,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478528320] [2019-11-16 00:02:25,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:25,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:25,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:25,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478528320] [2019-11-16 00:02:25,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:25,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:02:25,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514515618] [2019-11-16 00:02:25,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:25,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:25,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:25,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:25,806 INFO L87 Difference]: Start difference. First operand 323 states and 346 transitions. Second operand 7 states. [2019-11-16 00:02:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:26,774 INFO L93 Difference]: Finished difference Result 375 states and 397 transitions. [2019-11-16 00:02:26,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:02:26,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-16 00:02:26,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:26,776 INFO L225 Difference]: With dead ends: 375 [2019-11-16 00:02:26,777 INFO L226 Difference]: Without dead ends: 375 [2019-11-16 00:02:26,777 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:02:26,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-11-16 00:02:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 344. [2019-11-16 00:02:26,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-16 00:02:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 373 transitions. [2019-11-16 00:02:26,788 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 373 transitions. Word has length 47 [2019-11-16 00:02:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:26,788 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 373 transitions. [2019-11-16 00:02:26,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:02:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 373 transitions. [2019-11-16 00:02:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:02:26,789 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:26,789 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:26,790 INFO L410 AbstractCegarLoop]: === Iteration 19 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:26,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:26,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2077484617, now seen corresponding path program 1 times [2019-11-16 00:02:26,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:26,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57303118] [2019-11-16 00:02:26,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:26,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:26,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:26,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57303118] [2019-11-16 00:02:26,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:26,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:02:26,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938241986] [2019-11-16 00:02:26,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:02:26,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:26,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:02:26,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:02:26,889 INFO L87 Difference]: Start difference. First operand 344 states and 373 transitions. Second operand 8 states. [2019-11-16 00:02:27,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:27,610 INFO L93 Difference]: Finished difference Result 385 states and 412 transitions. [2019-11-16 00:02:27,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:02:27,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-16 00:02:27,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:27,613 INFO L225 Difference]: With dead ends: 385 [2019-11-16 00:02:27,613 INFO L226 Difference]: Without dead ends: 382 [2019-11-16 00:02:27,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:02:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-16 00:02:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 344. [2019-11-16 00:02:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-16 00:02:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 372 transitions. [2019-11-16 00:02:27,622 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 372 transitions. Word has length 50 [2019-11-16 00:02:27,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:27,622 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 372 transitions. [2019-11-16 00:02:27,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:02:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 372 transitions. [2019-11-16 00:02:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:02:27,623 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:27,623 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:27,623 INFO L410 AbstractCegarLoop]: === Iteration 20 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:27,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:27,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2056453987, now seen corresponding path program 1 times [2019-11-16 00:02:27,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:27,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240881409] [2019-11-16 00:02:27,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:27,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:27,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:27,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240881409] [2019-11-16 00:02:27,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043786885] [2019-11-16 00:02:27,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:28,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:02:28,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:28,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-16 00:02:28,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:28,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:28,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-16 00:02:28,060 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:28,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:28,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:28,071 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-16 00:02:28,171 INFO L375 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 7 [2019-11-16 00:02:28,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:28,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:28,179 INFO L375 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 7 [2019-11-16 00:02:28,179 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:28,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:28,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:28,183 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-16 00:02:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:28,210 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:02:28,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2019-11-16 00:02:28,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154549347] [2019-11-16 00:02:28,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:02:28,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:28,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:02:28,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:02:28,212 INFO L87 Difference]: Start difference. First operand 344 states and 372 transitions. Second operand 13 states. [2019-11-16 00:02:28,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:28,995 INFO L93 Difference]: Finished difference Result 406 states and 434 transitions. [2019-11-16 00:02:29,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:02:29,012 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2019-11-16 00:02:29,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:29,014 INFO L225 Difference]: With dead ends: 406 [2019-11-16 00:02:29,014 INFO L226 Difference]: Without dead ends: 406 [2019-11-16 00:02:29,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:02:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-16 00:02:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 346. [2019-11-16 00:02:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-11-16 00:02:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 374 transitions. [2019-11-16 00:02:29,023 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 374 transitions. Word has length 50 [2019-11-16 00:02:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:29,023 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 374 transitions. [2019-11-16 00:02:29,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:02:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 374 transitions. [2019-11-16 00:02:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:02:29,024 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:29,025 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:29,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:29,228 INFO L410 AbstractCegarLoop]: === Iteration 21 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:29,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:29,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2100218423, now seen corresponding path program 2 times [2019-11-16 00:02:29,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:29,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835112133] [2019-11-16 00:02:29,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:29,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:29,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:29,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835112133] [2019-11-16 00:02:29,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133434926] [2019-11-16 00:02:29,582 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:29,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:02:29,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:02:29,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-16 00:02:29,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:29,744 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:29,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:02:29,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:29,759 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-16 00:02:29,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:29,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-16 00:02:29,795 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:29,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:02:29,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:29,813 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-16 00:02:29,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:29,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-16 00:02:29,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-16 00:02:29,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:29,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:29,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:29,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-16 00:02:30,050 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:30,051 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-16 00:02:30,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:30,070 INFO L567 ElimStorePlain]: treesize reduction 3, result has 87.0 percent of original size [2019-11-16 00:02:30,071 INFO L496 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. [2019-11-16 00:02:30,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:11 [2019-11-16 00:02:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:30,098 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:02:30,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2019-11-16 00:02:30,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762268945] [2019-11-16 00:02:30,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-16 00:02:30,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:30,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:02:30,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:02:30,100 INFO L87 Difference]: Start difference. First operand 346 states and 374 transitions. Second operand 22 states. [2019-11-16 00:02:32,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:32,789 INFO L93 Difference]: Finished difference Result 390 states and 422 transitions. [2019-11-16 00:02:32,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:02:32,790 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 52 [2019-11-16 00:02:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:32,792 INFO L225 Difference]: With dead ends: 390 [2019-11-16 00:02:32,792 INFO L226 Difference]: Without dead ends: 390 [2019-11-16 00:02:32,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:02:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-11-16 00:02:32,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 348. [2019-11-16 00:02:32,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-16 00:02:32,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 377 transitions. [2019-11-16 00:02:32,803 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 377 transitions. Word has length 52 [2019-11-16 00:02:32,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:32,804 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 377 transitions. [2019-11-16 00:02:32,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-16 00:02:32,804 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 377 transitions. [2019-11-16 00:02:32,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:02:32,805 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:32,805 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:33,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:33,012 INFO L410 AbstractCegarLoop]: === Iteration 22 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:33,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:33,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2100218424, now seen corresponding path program 1 times [2019-11-16 00:02:33,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:33,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791830653] [2019-11-16 00:02:33,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:33,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:33,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:33,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791830653] [2019-11-16 00:02:33,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484735388] [2019-11-16 00:02:33,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:33,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-16 00:02:33,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:33,508 INFO L375 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 [2019-11-16 00:02:33,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:33,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:33,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:33,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:02:33,662 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:33,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:02:33,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:33,679 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-16 00:02:33,679 INFO L496 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. [2019-11-16 00:02:33,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2019-11-16 00:02:33,711 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:33,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:02:33,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:33,729 INFO L567 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-11-16 00:02:33,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:33,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-11-16 00:02:33,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-16 00:02:33,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:33,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:33,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-16 00:02:33,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:33,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:33,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:33,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:41 [2019-11-16 00:02:33,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-16 00:02:33,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:33,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:33,984 INFO L375 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 10 [2019-11-16 00:02:33,985 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:33,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:33,993 INFO L496 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. [2019-11-16 00:02:33,993 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:17 [2019-11-16 00:02:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:34,061 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:02:34,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2019-11-16 00:02:34,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033803590] [2019-11-16 00:02:34,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-16 00:02:34,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:34,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-16 00:02:34,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:02:34,062 INFO L87 Difference]: Start difference. First operand 348 states and 377 transitions. Second operand 27 states. [2019-11-16 00:02:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:35,931 INFO L93 Difference]: Finished difference Result 435 states and 464 transitions. [2019-11-16 00:02:35,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:02:35,932 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-11-16 00:02:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:35,934 INFO L225 Difference]: With dead ends: 435 [2019-11-16 00:02:35,934 INFO L226 Difference]: Without dead ends: 435 [2019-11-16 00:02:35,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=222, Invalid=1184, Unknown=0, NotChecked=0, Total=1406 [2019-11-16 00:02:35,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-16 00:02:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 371. [2019-11-16 00:02:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-11-16 00:02:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 402 transitions. [2019-11-16 00:02:35,943 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 402 transitions. Word has length 52 [2019-11-16 00:02:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:35,944 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 402 transitions. [2019-11-16 00:02:35,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-16 00:02:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 402 transitions. [2019-11-16 00:02:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:02:35,944 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:35,945 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:36,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:36,152 INFO L410 AbstractCegarLoop]: === Iteration 23 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:36,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:36,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1912276623, now seen corresponding path program 1 times [2019-11-16 00:02:36,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:36,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592475505] [2019-11-16 00:02:36,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:36,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:36,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:02:36,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592475505] [2019-11-16 00:02:36,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:36,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:02:36,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101222428] [2019-11-16 00:02:36,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:02:36,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:36,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:02:36,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:02:36,313 INFO L87 Difference]: Start difference. First operand 371 states and 402 transitions. Second operand 11 states. [2019-11-16 00:02:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:37,405 INFO L93 Difference]: Finished difference Result 418 states and 450 transitions. [2019-11-16 00:02:37,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:02:37,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-11-16 00:02:37,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:37,407 INFO L225 Difference]: With dead ends: 418 [2019-11-16 00:02:37,407 INFO L226 Difference]: Without dead ends: 418 [2019-11-16 00:02:37,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:02:37,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-16 00:02:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 398. [2019-11-16 00:02:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-11-16 00:02:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 434 transitions. [2019-11-16 00:02:37,416 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 434 transitions. Word has length 56 [2019-11-16 00:02:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:37,416 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 434 transitions. [2019-11-16 00:02:37,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:02:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 434 transitions. [2019-11-16 00:02:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:02:37,417 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:37,417 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:37,418 INFO L410 AbstractCegarLoop]: === Iteration 24 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:37,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:37,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1912276624, now seen corresponding path program 1 times [2019-11-16 00:02:37,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:37,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454957419] [2019-11-16 00:02:37,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:37,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:37,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:37,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454957419] [2019-11-16 00:02:37,631 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:37,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-16 00:02:37,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144960520] [2019-11-16 00:02:37,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:02:37,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:37,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:02:37,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:02:37,634 INFO L87 Difference]: Start difference. First operand 398 states and 434 transitions. Second operand 14 states. [2019-11-16 00:02:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:39,341 INFO L93 Difference]: Finished difference Result 456 states and 489 transitions. [2019-11-16 00:02:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:02:39,342 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-11-16 00:02:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:39,343 INFO L225 Difference]: With dead ends: 456 [2019-11-16 00:02:39,343 INFO L226 Difference]: Without dead ends: 456 [2019-11-16 00:02:39,344 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:02:39,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-11-16 00:02:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 401. [2019-11-16 00:02:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-11-16 00:02:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 437 transitions. [2019-11-16 00:02:39,352 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 437 transitions. Word has length 56 [2019-11-16 00:02:39,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:39,353 INFO L462 AbstractCegarLoop]: Abstraction has 401 states and 437 transitions. [2019-11-16 00:02:39,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:02:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 437 transitions. [2019-11-16 00:02:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:02:39,354 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:39,354 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:39,354 INFO L410 AbstractCegarLoop]: === Iteration 25 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:39,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:39,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1498626213, now seen corresponding path program 1 times [2019-11-16 00:02:39,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:39,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643905596] [2019-11-16 00:02:39,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:39,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:39,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:02:39,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643905596] [2019-11-16 00:02:39,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:39,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-16 00:02:39,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868596044] [2019-11-16 00:02:39,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:02:39,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:39,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:02:39,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:02:39,582 INFO L87 Difference]: Start difference. First operand 401 states and 437 transitions. Second operand 13 states. [2019-11-16 00:02:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:40,987 INFO L93 Difference]: Finished difference Result 424 states and 455 transitions. [2019-11-16 00:02:40,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:02:40,988 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-11-16 00:02:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:40,989 INFO L225 Difference]: With dead ends: 424 [2019-11-16 00:02:40,989 INFO L226 Difference]: Without dead ends: 424 [2019-11-16 00:02:40,990 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:02:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-11-16 00:02:40,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 395. [2019-11-16 00:02:40,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-11-16 00:02:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 425 transitions. [2019-11-16 00:02:41,000 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 425 transitions. Word has length 60 [2019-11-16 00:02:41,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:41,000 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 425 transitions. [2019-11-16 00:02:41,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:02:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 425 transitions. [2019-11-16 00:02:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-16 00:02:41,001 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:41,002 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:41,002 INFO L410 AbstractCegarLoop]: === Iteration 26 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:41,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1688445799, now seen corresponding path program 2 times [2019-11-16 00:02:41,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:41,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976074379] [2019-11-16 00:02:41,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:41,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:41,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:41,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976074379] [2019-11-16 00:02:41,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134710765] [2019-11-16 00:02:41,398 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:41,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:02:41,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:02:41,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-16 00:02:41,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:41,722 INFO L375 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 7 [2019-11-16 00:02:41,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:41,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:41,734 INFO L375 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 7 [2019-11-16 00:02:41,734 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:41,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:41,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:41,739 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-11-16 00:02:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:02:41,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:02:41,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2019-11-16 00:02:41,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978808183] [2019-11-16 00:02:41,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:02:41,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:41,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:02:41,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:02:41,809 INFO L87 Difference]: Start difference. First operand 395 states and 425 transitions. Second operand 10 states. [2019-11-16 00:02:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:42,316 INFO L93 Difference]: Finished difference Result 428 states and 460 transitions. [2019-11-16 00:02:42,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:02:42,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2019-11-16 00:02:42,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:42,321 INFO L225 Difference]: With dead ends: 428 [2019-11-16 00:02:42,321 INFO L226 Difference]: Without dead ends: 428 [2019-11-16 00:02:42,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:02:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-11-16 00:02:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 401. [2019-11-16 00:02:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-11-16 00:02:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 432 transitions. [2019-11-16 00:02:42,328 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 432 transitions. Word has length 61 [2019-11-16 00:02:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:42,328 INFO L462 AbstractCegarLoop]: Abstraction has 401 states and 432 transitions. [2019-11-16 00:02:42,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:02:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 432 transitions. [2019-11-16 00:02:42,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:02:42,330 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:42,330 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:42,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:42,533 INFO L410 AbstractCegarLoop]: === Iteration 27 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:42,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2057607166, now seen corresponding path program 1 times [2019-11-16 00:02:42,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:42,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670300149] [2019-11-16 00:02:42,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:42,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:42,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:43,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670300149] [2019-11-16 00:02:43,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963322787] [2019-11-16 00:02:43,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:43,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 90 conjunts are in the unsatisfiable core [2019-11-16 00:02:43,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:43,697 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:43,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:02:43,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:43,714 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-16 00:02:43,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:43,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-16 00:02:43,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-16 00:02:43,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:43,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:43,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-16 00:02:43,762 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:43,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:43,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:43,777 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2019-11-16 00:02:43,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:43,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-16 00:02:43,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:43,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:43,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:43,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-11-16 00:02:43,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:43,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:43,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:43,858 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:36 [2019-11-16 00:02:43,935 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:43,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-16 00:02:43,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:43,979 INFO L567 ElimStorePlain]: treesize reduction 40, result has 58.3 percent of original size [2019-11-16 00:02:43,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:43,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:56 [2019-11-16 00:02:44,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2019-11-16 00:02:44,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:44,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:44,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:02:44,096 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:44,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:44,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:44,133 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:73 [2019-11-16 00:02:44,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:44,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:02:44,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:44,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:44,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:44,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2019-11-16 00:02:44,284 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:44,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:44,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:44,313 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:111, output treesize:73 [2019-11-16 00:02:44,379 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:44,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 119 [2019-11-16 00:02:44,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:44,475 INFO L567 ElimStorePlain]: treesize reduction 54, result has 64.2 percent of original size [2019-11-16 00:02:44,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:44,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:87, output treesize:97 [2019-11-16 00:02:44,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-16 00:02:44,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:44,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:44,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-11-16 00:02:44,611 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:44,682 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.5 percent of original size [2019-11-16 00:02:44,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:44,683 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:122, output treesize:136 [2019-11-16 00:02:44,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:44,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:44,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:44,787 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:44,791 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:44,809 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:44,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 106 [2019-11-16 00:02:44,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:44,912 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-11-16 00:02:44,913 INFO L567 ElimStorePlain]: treesize reduction 48, result has 76.7 percent of original size [2019-11-16 00:02:44,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:44,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:44,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2019-11-16 00:02:44,919 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:44,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:44,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:44,958 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:162, output treesize:226 [2019-11-16 00:02:45,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:45,870 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:45,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 189 treesize of output 181 [2019-11-16 00:02:45,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:45,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:45,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:45,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:45,877 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:02:46,009 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-11-16 00:02:46,009 INFO L567 ElimStorePlain]: treesize reduction 64, result has 71.8 percent of original size [2019-11-16 00:02:46,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:02:46,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:258, output treesize:163 [2019-11-16 00:02:46,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:46,191 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:46,192 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:46,203 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:46,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 148 treesize of output 76 [2019-11-16 00:02:46,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:46,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:46,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:46,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:46,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:46,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:46,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:46,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:46,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:46,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:46,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:46,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:46,211 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:02:46,294 INFO L567 ElimStorePlain]: treesize reduction 20, result has 77.0 percent of original size [2019-11-16 00:02:46,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:02:46,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:171, output treesize:49 [2019-11-16 00:02:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:46,403 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:02:46,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2019-11-16 00:02:46,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791469139] [2019-11-16 00:02:46,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-16 00:02:46,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:46,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-16 00:02:46,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1487, Unknown=0, NotChecked=0, Total=1640 [2019-11-16 00:02:46,405 INFO L87 Difference]: Start difference. First operand 401 states and 432 transitions. Second operand 41 states. [2019-11-16 00:02:47,255 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-16 00:02:47,487 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 89 [2019-11-16 00:02:47,807 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 107 [2019-11-16 00:02:48,144 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 108 [2019-11-16 00:02:48,470 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-11-16 00:02:49,096 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-11-16 00:02:49,523 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-16 00:02:49,713 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-11-16 00:02:49,978 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-16 00:02:50,306 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-16 00:02:50,962 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 115 [2019-11-16 00:02:51,196 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 113 [2019-11-16 00:02:51,490 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 118 [2019-11-16 00:02:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:53,219 INFO L93 Difference]: Finished difference Result 473 states and 506 transitions. [2019-11-16 00:02:53,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-16 00:02:53,220 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 63 [2019-11-16 00:02:53,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:53,222 INFO L225 Difference]: With dead ends: 473 [2019-11-16 00:02:53,222 INFO L226 Difference]: Without dead ends: 473 [2019-11-16 00:02:53,223 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=517, Invalid=3773, Unknown=0, NotChecked=0, Total=4290 [2019-11-16 00:02:53,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-11-16 00:02:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 402. [2019-11-16 00:02:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-11-16 00:02:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 434 transitions. [2019-11-16 00:02:53,231 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 434 transitions. Word has length 63 [2019-11-16 00:02:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:53,232 INFO L462 AbstractCegarLoop]: Abstraction has 402 states and 434 transitions. [2019-11-16 00:02:53,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-16 00:02:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 434 transitions. [2019-11-16 00:02:53,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:02:53,233 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:53,233 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:53,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:53,437 INFO L410 AbstractCegarLoop]: === Iteration 28 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:02:53,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:53,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2057607167, now seen corresponding path program 1 times [2019-11-16 00:02:53,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:53,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639281546] [2019-11-16 00:02:53,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:53,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:53,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:54,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639281546] [2019-11-16 00:02:54,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360375565] [2019-11-16 00:02:54,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:54,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 78 conjunts are in the unsatisfiable core [2019-11-16 00:02:54,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:54,749 INFO L375 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 [2019-11-16 00:02:54,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:54,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:54,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:54,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:02:54,790 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:54,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:02:54,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:54,805 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-16 00:02:54,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:54,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-16 00:02:54,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-16 00:02:54,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:54,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:54,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-16 00:02:54,873 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:54,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:54,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:54,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-11-16 00:02:54,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:54,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:02:54,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:54,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:54,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:54,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-16 00:02:54,973 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:54,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:54,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:54,992 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:33 [2019-11-16 00:02:55,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:55,042 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:55,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 64 [2019-11-16 00:02:55,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,077 INFO L567 ElimStorePlain]: treesize reduction 40, result has 55.1 percent of original size [2019-11-16 00:02:55,093 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:55,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:02:55,094 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,127 INFO L567 ElimStorePlain]: treesize reduction 14, result has 77.0 percent of original size [2019-11-16 00:02:55,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,127 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:47 [2019-11-16 00:02:55,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:02:55,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:55,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-16 00:02:55,217 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:55,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2019-11-16 00:02:55,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:55,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:02:55,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:55,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:55,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-16 00:02:55,354 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:55,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,380 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:61 [2019-11-16 00:02:55,388 INFO L392 ElimStorePlain]: Different costs {3=[|v_#valid_136|], 6=[|v_#length_117|]} [2019-11-16 00:02:55,408 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:55,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-16 00:02:55,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:55,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:55,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 84 [2019-11-16 00:02:55,453 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,506 INFO L567 ElimStorePlain]: treesize reduction 54, result has 55.4 percent of original size [2019-11-16 00:02:55,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,506 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2019-11-16 00:02:55,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-16 00:02:55,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:55,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-11-16 00:02:55,601 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:55,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,629 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:92, output treesize:98 [2019-11-16 00:02:55,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:55,739 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:55,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 142 [2019-11-16 00:02:55,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,815 INFO L567 ElimStorePlain]: treesize reduction 100, result has 54.5 percent of original size [2019-11-16 00:02:55,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:55,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2019-11-16 00:02:55,820 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:55,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:55,849 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:124, output treesize:152 [2019-11-16 00:02:56,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:56,328 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:56,371 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:56,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 161 treesize of output 141 [2019-11-16 00:02:56,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:56,391 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:02:56,476 INFO L567 ElimStorePlain]: treesize reduction 64, result has 59.5 percent of original size [2019-11-16 00:02:56,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:56,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 22 [2019-11-16 00:02:56,482 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:56,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:56,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:02:56,505 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:190, output treesize:36 [2019-11-16 00:02:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:56,618 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:02:56,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2019-11-16 00:02:56,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426963306] [2019-11-16 00:02:56,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-16 00:02:56,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:56,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-16 00:02:56,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1096, Unknown=0, NotChecked=0, Total=1190 [2019-11-16 00:02:56,621 INFO L87 Difference]: Start difference. First operand 402 states and 434 transitions. Second operand 35 states. [2019-11-16 00:02:57,517 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-11-16 00:02:57,730 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-11-16 00:02:58,046 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 109 [2019-11-16 00:02:58,377 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 103 [2019-11-16 00:02:58,923 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2019-11-16 00:02:59,514 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-16 00:03:00,313 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-11-16 00:03:01,793 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 99 [2019-11-16 00:03:02,330 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 95 [2019-11-16 00:03:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:02,410 INFO L93 Difference]: Finished difference Result 471 states and 500 transitions. [2019-11-16 00:03:02,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-16 00:03:02,411 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 63 [2019-11-16 00:03:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:02,412 INFO L225 Difference]: With dead ends: 471 [2019-11-16 00:03:02,413 INFO L226 Difference]: Without dead ends: 471 [2019-11-16 00:03:02,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 50 SyntacticMatches, 10 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=391, Invalid=2471, Unknown=0, NotChecked=0, Total=2862 [2019-11-16 00:03:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-11-16 00:03:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 402. [2019-11-16 00:03:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-11-16 00:03:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 433 transitions. [2019-11-16 00:03:02,421 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 433 transitions. Word has length 63 [2019-11-16 00:03:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:02,422 INFO L462 AbstractCegarLoop]: Abstraction has 402 states and 433 transitions. [2019-11-16 00:03:02,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-16 00:03:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 433 transitions. [2019-11-16 00:03:02,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:03:02,423 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:02,423 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:02,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:02,627 INFO L410 AbstractCegarLoop]: === Iteration 29 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:03:02,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:02,627 INFO L82 PathProgramCache]: Analyzing trace with hash -143869536, now seen corresponding path program 1 times [2019-11-16 00:03:02,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:02,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474085838] [2019-11-16 00:03:02,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:02,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:02,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:03,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474085838] [2019-11-16 00:03:03,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829321092] [2019-11-16 00:03:03,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:03,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 88 conjunts are in the unsatisfiable core [2019-11-16 00:03:03,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:03,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-16 00:03:03,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:03,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:03,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-16 00:03:03,555 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:03,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:03,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:03,563 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2019-11-16 00:03:03,650 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:03,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:03:03,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:03,678 INFO L567 ElimStorePlain]: treesize reduction 14, result has 75.0 percent of original size [2019-11-16 00:03:03,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:03,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:42 [2019-11-16 00:03:03,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-16 00:03:03,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:03,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:03,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-16 00:03:03,780 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:03,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:03,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:03,797 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2019-11-16 00:03:03,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:03,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-16 00:03:03,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:03,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:03,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:03,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-16 00:03:03,899 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:03,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:03,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:03,916 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59 [2019-11-16 00:03:03,927 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:03,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-16 00:03:03,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:03,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:03,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:03,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:60 [2019-11-16 00:03:04,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-11-16 00:03:04,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:04,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:04,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-11-16 00:03:04,065 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:04,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:04,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:04,091 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:95 [2019-11-16 00:03:04,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:04,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:04,160 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:03:04,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:04,164 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:04,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 73 [2019-11-16 00:03:04,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:04,224 INFO L567 ElimStorePlain]: treesize reduction 16, result has 88.0 percent of original size [2019-11-16 00:03:04,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:04,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2019-11-16 00:03:04,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:04,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:04,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:04,257 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:143 [2019-11-16 00:03:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:05,577 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:05,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2019-11-16 00:03:05,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224886369] [2019-11-16 00:03:05,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-16 00:03:05,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:05,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-16 00:03:05,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1463, Unknown=0, NotChecked=0, Total=1560 [2019-11-16 00:03:05,579 INFO L87 Difference]: Start difference. First operand 402 states and 433 transitions. Second operand 40 states. [2019-11-16 00:03:07,300 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2019-11-16 00:03:07,556 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 86 [2019-11-16 00:03:07,858 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 102 [2019-11-16 00:03:08,574 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-11-16 00:03:09,580 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-11-16 00:03:10,406 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 98 [2019-11-16 00:03:10,738 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2019-11-16 00:03:11,036 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2019-11-16 00:03:11,480 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 106 [2019-11-16 00:03:11,997 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 108 [2019-11-16 00:03:15,332 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 88 [2019-11-16 00:03:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:16,271 INFO L93 Difference]: Finished difference Result 549 states and 591 transitions. [2019-11-16 00:03:16,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-16 00:03:16,271 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 63 [2019-11-16 00:03:16,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:16,273 INFO L225 Difference]: With dead ends: 549 [2019-11-16 00:03:16,273 INFO L226 Difference]: Without dead ends: 549 [2019-11-16 00:03:16,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 49 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=585, Invalid=5735, Unknown=0, NotChecked=0, Total=6320 [2019-11-16 00:03:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-11-16 00:03:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 464. [2019-11-16 00:03:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-11-16 00:03:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 496 transitions. [2019-11-16 00:03:16,284 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 496 transitions. Word has length 63 [2019-11-16 00:03:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:16,284 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 496 transitions. [2019-11-16 00:03:16,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-16 00:03:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 496 transitions. [2019-11-16 00:03:16,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:03:16,285 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:16,285 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:16,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:16,489 INFO L410 AbstractCegarLoop]: === Iteration 30 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:03:16,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:16,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1267535379, now seen corresponding path program 1 times [2019-11-16 00:03:16,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:16,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742648821] [2019-11-16 00:03:16,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:16,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:16,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:16,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742648821] [2019-11-16 00:03:16,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:16,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:03:16,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830220163] [2019-11-16 00:03:16,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:03:16,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:16,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:16,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:16,568 INFO L87 Difference]: Start difference. First operand 464 states and 496 transitions. Second operand 5 states. [2019-11-16 00:03:16,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:16,996 INFO L93 Difference]: Finished difference Result 474 states and 505 transitions. [2019-11-16 00:03:16,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:03:16,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-16 00:03:16,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:16,999 INFO L225 Difference]: With dead ends: 474 [2019-11-16 00:03:16,999 INFO L226 Difference]: Without dead ends: 474 [2019-11-16 00:03:16,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:17,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-11-16 00:03:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 465. [2019-11-16 00:03:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-11-16 00:03:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 497 transitions. [2019-11-16 00:03:17,005 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 497 transitions. Word has length 66 [2019-11-16 00:03:17,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:17,006 INFO L462 AbstractCegarLoop]: Abstraction has 465 states and 497 transitions. [2019-11-16 00:03:17,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:03:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 497 transitions. [2019-11-16 00:03:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:03:17,007 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:17,007 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:17,008 INFO L410 AbstractCegarLoop]: === Iteration 31 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:03:17,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1167646725, now seen corresponding path program 1 times [2019-11-16 00:03:17,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:17,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081731211] [2019-11-16 00:03:17,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:17,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:17,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:03:17,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081731211] [2019-11-16 00:03:17,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:17,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:03:17,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359983106] [2019-11-16 00:03:17,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:03:17,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:17,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:03:17,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:03:17,132 INFO L87 Difference]: Start difference. First operand 465 states and 497 transitions. Second operand 9 states. [2019-11-16 00:03:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:18,144 INFO L93 Difference]: Finished difference Result 484 states and 516 transitions. [2019-11-16 00:03:18,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:03:18,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-16 00:03:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:18,146 INFO L225 Difference]: With dead ends: 484 [2019-11-16 00:03:18,146 INFO L226 Difference]: Without dead ends: 484 [2019-11-16 00:03:18,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:03:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-11-16 00:03:18,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 473. [2019-11-16 00:03:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-11-16 00:03:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 507 transitions. [2019-11-16 00:03:18,154 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 507 transitions. Word has length 66 [2019-11-16 00:03:18,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:18,154 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 507 transitions. [2019-11-16 00:03:18,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:03:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 507 transitions. [2019-11-16 00:03:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:03:18,155 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:18,156 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:18,156 INFO L410 AbstractCegarLoop]: === Iteration 32 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:03:18,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:18,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1167646726, now seen corresponding path program 1 times [2019-11-16 00:03:18,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:18,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948973688] [2019-11-16 00:03:18,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:18,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:18,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:03:18,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948973688] [2019-11-16 00:03:18,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:18,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:03:18,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768931854] [2019-11-16 00:03:18,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:03:18,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:18,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:03:18,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:03:18,367 INFO L87 Difference]: Start difference. First operand 473 states and 507 transitions. Second operand 11 states. [2019-11-16 00:03:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:19,637 INFO L93 Difference]: Finished difference Result 536 states and 581 transitions. [2019-11-16 00:03:19,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:03:19,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-11-16 00:03:19,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:19,639 INFO L225 Difference]: With dead ends: 536 [2019-11-16 00:03:19,639 INFO L226 Difference]: Without dead ends: 536 [2019-11-16 00:03:19,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:03:19,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-16 00:03:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 481. [2019-11-16 00:03:19,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-11-16 00:03:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 521 transitions. [2019-11-16 00:03:19,648 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 521 transitions. Word has length 66 [2019-11-16 00:03:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:19,649 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 521 transitions. [2019-11-16 00:03:19,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:03:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 521 transitions. [2019-11-16 00:03:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:03:19,650 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:19,650 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:19,650 INFO L410 AbstractCegarLoop]: === Iteration 33 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:03:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:19,650 INFO L82 PathProgramCache]: Analyzing trace with hash -205487894, now seen corresponding path program 1 times [2019-11-16 00:03:19,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:19,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230080715] [2019-11-16 00:03:19,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:19,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:19,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:19,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230080715] [2019-11-16 00:03:19,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:19,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-16 00:03:19,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656935988] [2019-11-16 00:03:19,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:03:19,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:19,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:03:19,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:03:19,810 INFO L87 Difference]: Start difference. First operand 481 states and 521 transitions. Second operand 14 states. [2019-11-16 00:03:21,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:21,125 INFO L93 Difference]: Finished difference Result 536 states and 582 transitions. [2019-11-16 00:03:21,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:03:21,126 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 69 [2019-11-16 00:03:21,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:21,128 INFO L225 Difference]: With dead ends: 536 [2019-11-16 00:03:21,128 INFO L226 Difference]: Without dead ends: 536 [2019-11-16 00:03:21,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:03:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-16 00:03:21,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 487. [2019-11-16 00:03:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-16 00:03:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 529 transitions. [2019-11-16 00:03:21,136 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 529 transitions. Word has length 69 [2019-11-16 00:03:21,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:21,137 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 529 transitions. [2019-11-16 00:03:21,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:03:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 529 transitions. [2019-11-16 00:03:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:03:21,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:21,138 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:21,138 INFO L410 AbstractCegarLoop]: === Iteration 34 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:03:21,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:21,139 INFO L82 PathProgramCache]: Analyzing trace with hash -205487893, now seen corresponding path program 1 times [2019-11-16 00:03:21,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:21,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493249286] [2019-11-16 00:03:21,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:21,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:21,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:21,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493249286] [2019-11-16 00:03:21,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:21,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-16 00:03:21,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947937458] [2019-11-16 00:03:21,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:03:21,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:21,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:03:21,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:03:21,356 INFO L87 Difference]: Start difference. First operand 487 states and 529 transitions. Second operand 14 states. [2019-11-16 00:03:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:22,582 INFO L93 Difference]: Finished difference Result 542 states and 589 transitions. [2019-11-16 00:03:22,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:03:22,582 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 69 [2019-11-16 00:03:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:22,584 INFO L225 Difference]: With dead ends: 542 [2019-11-16 00:03:22,584 INFO L226 Difference]: Without dead ends: 542 [2019-11-16 00:03:22,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:03:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-11-16 00:03:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 492. [2019-11-16 00:03:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-11-16 00:03:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 535 transitions. [2019-11-16 00:03:22,593 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 535 transitions. Word has length 69 [2019-11-16 00:03:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:22,594 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 535 transitions. [2019-11-16 00:03:22,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:03:22,594 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 535 transitions. [2019-11-16 00:03:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:03:22,595 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:22,595 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:22,596 INFO L410 AbstractCegarLoop]: === Iteration 35 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:03:22,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:22,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2075158467, now seen corresponding path program 1 times [2019-11-16 00:03:22,596 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:22,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416736260] [2019-11-16 00:03:22,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:22,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:22,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:22,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416736260] [2019-11-16 00:03:22,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:22,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-16 00:03:22,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310875587] [2019-11-16 00:03:22,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:03:22,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:22,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:03:22,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:03:22,789 INFO L87 Difference]: Start difference. First operand 492 states and 535 transitions. Second operand 13 states. [2019-11-16 00:03:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:23,749 INFO L93 Difference]: Finished difference Result 517 states and 556 transitions. [2019-11-16 00:03:23,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:03:23,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-11-16 00:03:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:23,752 INFO L225 Difference]: With dead ends: 517 [2019-11-16 00:03:23,752 INFO L226 Difference]: Without dead ends: 517 [2019-11-16 00:03:23,752 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:03:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-11-16 00:03:23,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 492. [2019-11-16 00:03:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-11-16 00:03:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 533 transitions. [2019-11-16 00:03:23,761 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 533 transitions. Word has length 70 [2019-11-16 00:03:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:23,762 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 533 transitions. [2019-11-16 00:03:23,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:03:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 533 transitions. [2019-11-16 00:03:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:03:23,763 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:23,763 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:23,764 INFO L410 AbstractCegarLoop]: === Iteration 36 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:03:23,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash -668198604, now seen corresponding path program 1 times [2019-11-16 00:03:23,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:23,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142087819] [2019-11-16 00:03:23,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:23,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:23,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:03:24,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142087819] [2019-11-16 00:03:24,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572383079] [2019-11-16 00:03:24,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:24,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-16 00:03:24,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:03:24,428 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:24,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2019-11-16 00:03:24,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526662572] [2019-11-16 00:03:24,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-16 00:03:24,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:24,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-16 00:03:24,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:03:24,429 INFO L87 Difference]: Start difference. First operand 492 states and 533 transitions. Second operand 25 states. [2019-11-16 00:03:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:35,158 INFO L93 Difference]: Finished difference Result 615 states and 664 transitions. [2019-11-16 00:03:35,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:03:35,158 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 71 [2019-11-16 00:03:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:35,161 INFO L225 Difference]: With dead ends: 615 [2019-11-16 00:03:35,161 INFO L226 Difference]: Without dead ends: 615 [2019-11-16 00:03:35,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=309, Invalid=1497, Unknown=0, NotChecked=0, Total=1806 [2019-11-16 00:03:35,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-11-16 00:03:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 546. [2019-11-16 00:03:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-11-16 00:03:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 605 transitions. [2019-11-16 00:03:35,176 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 605 transitions. Word has length 71 [2019-11-16 00:03:35,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:35,176 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 605 transitions. [2019-11-16 00:03:35,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-16 00:03:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 605 transitions. [2019-11-16 00:03:35,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:03:35,178 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:35,178 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:35,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:35,382 INFO L410 AbstractCegarLoop]: === Iteration 37 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:03:35,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:35,382 INFO L82 PathProgramCache]: Analyzing trace with hash 695633659, now seen corresponding path program 1 times [2019-11-16 00:03:35,382 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:35,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457875467] [2019-11-16 00:03:35,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:35,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:35,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:03:35,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457875467] [2019-11-16 00:03:35,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:35,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-16 00:03:35,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167022034] [2019-11-16 00:03:35,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:03:35,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:35,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:03:35,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:03:35,621 INFO L87 Difference]: Start difference. First operand 546 states and 605 transitions. Second operand 14 states. [2019-11-16 00:03:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:37,407 INFO L93 Difference]: Finished difference Result 648 states and 717 transitions. [2019-11-16 00:03:37,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:03:37,407 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2019-11-16 00:03:37,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:37,409 INFO L225 Difference]: With dead ends: 648 [2019-11-16 00:03:37,409 INFO L226 Difference]: Without dead ends: 648 [2019-11-16 00:03:37,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:03:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-11-16 00:03:37,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 566. [2019-11-16 00:03:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-11-16 00:03:37,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 645 transitions. [2019-11-16 00:03:37,418 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 645 transitions. Word has length 72 [2019-11-16 00:03:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:37,418 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 645 transitions. [2019-11-16 00:03:37,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:03:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 645 transitions. [2019-11-16 00:03:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:03:37,419 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:37,420 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:37,420 INFO L410 AbstractCegarLoop]: === Iteration 38 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:03:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1360997503, now seen corresponding path program 1 times [2019-11-16 00:03:37,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:37,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823340181] [2019-11-16 00:03:37,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:37,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:37,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:37,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823340181] [2019-11-16 00:03:37,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:37,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:03:37,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37294194] [2019-11-16 00:03:37,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:03:37,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:37,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:03:37,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:03:37,515 INFO L87 Difference]: Start difference. First operand 566 states and 645 transitions. Second operand 8 states. [2019-11-16 00:03:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:38,241 INFO L93 Difference]: Finished difference Result 586 states and 659 transitions. [2019-11-16 00:03:38,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:03:38,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-11-16 00:03:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:38,244 INFO L225 Difference]: With dead ends: 586 [2019-11-16 00:03:38,244 INFO L226 Difference]: Without dead ends: 586 [2019-11-16 00:03:38,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:03:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-16 00:03:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 567. [2019-11-16 00:03:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-11-16 00:03:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 646 transitions. [2019-11-16 00:03:38,251 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 646 transitions. Word has length 72 [2019-11-16 00:03:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:38,251 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 646 transitions. [2019-11-16 00:03:38,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:03:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 646 transitions. [2019-11-16 00:03:38,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:03:38,252 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:38,252 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:38,252 INFO L410 AbstractCegarLoop]: === Iteration 39 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:03:38,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:38,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1156142361, now seen corresponding path program 1 times [2019-11-16 00:03:38,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:38,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063112107] [2019-11-16 00:03:38,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:38,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:38,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-16 00:03:38,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063112107] [2019-11-16 00:03:38,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736277531] [2019-11-16 00:03:38,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:38,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-16 00:03:38,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:38,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-16 00:03:38,602 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:38,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-11-16 00:03:38,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530106155] [2019-11-16 00:03:38,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:03:38,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:38,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:03:38,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:03:38,605 INFO L87 Difference]: Start difference. First operand 567 states and 646 transitions. Second operand 13 states. [2019-11-16 00:03:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:39,642 INFO L93 Difference]: Finished difference Result 599 states and 653 transitions. [2019-11-16 00:03:39,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:03:39,643 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2019-11-16 00:03:39,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:39,645 INFO L225 Difference]: With dead ends: 599 [2019-11-16 00:03:39,645 INFO L226 Difference]: Without dead ends: 596 [2019-11-16 00:03:39,646 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:03:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-11-16 00:03:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 545. [2019-11-16 00:03:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-11-16 00:03:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 611 transitions. [2019-11-16 00:03:39,655 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 611 transitions. Word has length 75 [2019-11-16 00:03:39,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:39,655 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 611 transitions. [2019-11-16 00:03:39,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:03:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 611 transitions. [2019-11-16 00:03:39,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:03:39,656 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:39,657 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:39,860 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:39,860 INFO L410 AbstractCegarLoop]: === Iteration 40 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:03:39,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:39,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1177172991, now seen corresponding path program 1 times [2019-11-16 00:03:39,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:39,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087862011] [2019-11-16 00:03:39,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:39,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:39,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:03:40,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087862011] [2019-11-16 00:03:40,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099442743] [2019-11-16 00:03:40,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:40,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-16 00:03:40,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:40,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-16 00:03:40,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:40,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:40,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-16 00:03:40,566 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:40,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:40,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:40,575 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-11-16 00:03:40,803 INFO L375 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 7 [2019-11-16 00:03:40,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:40,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:40,813 INFO L375 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 10 [2019-11-16 00:03:40,814 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:40,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:40,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:40,821 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:10 [2019-11-16 00:03:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:03:40,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:03:40,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [16] total 30 [2019-11-16 00:03:40,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072960980] [2019-11-16 00:03:40,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:03:40,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:40,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:03:40,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2019-11-16 00:03:40,858 INFO L87 Difference]: Start difference. First operand 545 states and 611 transitions. Second operand 16 states. [2019-11-16 00:03:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:41,441 INFO L93 Difference]: Finished difference Result 585 states and 646 transitions. [2019-11-16 00:03:41,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:03:41,442 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-11-16 00:03:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:41,444 INFO L225 Difference]: With dead ends: 585 [2019-11-16 00:03:41,444 INFO L226 Difference]: Without dead ends: 585 [2019-11-16 00:03:41,445 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=1165, Unknown=0, NotChecked=0, Total=1332 [2019-11-16 00:03:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-11-16 00:03:41,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 526. [2019-11-16 00:03:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-11-16 00:03:41,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 586 transitions. [2019-11-16 00:03:41,452 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 586 transitions. Word has length 75 [2019-11-16 00:03:41,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:41,453 INFO L462 AbstractCegarLoop]: Abstraction has 526 states and 586 transitions. [2019-11-16 00:03:41,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:03:41,453 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 586 transitions. [2019-11-16 00:03:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:03:41,454 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:41,454 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:41,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:41,658 INFO L410 AbstractCegarLoop]: === Iteration 41 === [merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION]=== [2019-11-16 00:03:41,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:41,658 INFO L82 PathProgramCache]: Analyzing trace with hash -984816625, now seen corresponding path program 1 times [2019-11-16 00:03:41,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:41,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239860] [2019-11-16 00:03:41,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:41,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:41,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:41,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239860] [2019-11-16 00:03:41,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871021972] [2019-11-16 00:03:41,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:42,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-16 00:03:42,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:42,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-16 00:03:42,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:42,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:42,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-16 00:03:42,155 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:42,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:42,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:42,159 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:27, output treesize:1 [2019-11-16 00:03:42,454 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:42,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 59 [2019-11-16 00:03:42,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:42,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:42,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:42,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:42,457 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:03:42,507 INFO L567 ElimStorePlain]: treesize reduction 12, result has 81.8 percent of original size [2019-11-16 00:03:42,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:42,709 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-16 00:03:42,713 INFO L168 Benchmark]: Toolchain (without parser) took 96408.35 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 854.1 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -68.3 MB). Peak memory consumption was 785.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:42,713 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:03:42,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 559.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -127.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:42,713 INFO L168 Benchmark]: Boogie Preprocessor took 94.05 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. [2019-11-16 00:03:42,713 INFO L168 Benchmark]: RCFGBuilder took 1078.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 965.0 MB in the end (delta: 100.9 MB). Peak memory consumption was 100.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:42,714 INFO L168 Benchmark]: TraceAbstraction took 94673.17 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 757.1 MB). Free memory was 965.0 MB in the beginning and 1.0 GB in the end (delta: -41.4 MB). Peak memory consumption was 715.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:42,716 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 559.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -127.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.05 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 1078.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 965.0 MB in the end (delta: 100.9 MB). Peak memory consumption was 100.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 94673.17 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 757.1 MB). Free memory was 965.0 MB in the beginning and 1.0 GB in the end (delta: -41.4 MB). Peak memory consumption was 715.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:03:44,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:03:44,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:03:44,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:03:44,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:03:44,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:03:44,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:03:44,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:03:44,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:03:44,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:03:44,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:03:44,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:03:44,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:03:44,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:03:44,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:03:44,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:03:44,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:03:44,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:03:44,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:03:44,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:03:44,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:03:44,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:03:44,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:03:44,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:03:44,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:03:44,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:03:44,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:03:44,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:03:44,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:03:44,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:03:44,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:03:44,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:03:44,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:03:44,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:03:44,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:03:44,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:03:44,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:03:44,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:03:44,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:03:44,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:03:44,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:03:44,978 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-16 00:03:44,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:03:44,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:03:44,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:03:44,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:03:44,996 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:03:44,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:03:44,996 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:03:44,996 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:03:44,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:03:44,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:03:44,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:03:44,997 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:03:44,998 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:03:44,998 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:03:44,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:03:44,998 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:03:44,998 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:03:44,999 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:03:44,999 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:03:44,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:03:44,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:03:45,000 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:03:45,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:03:45,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:03:45,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:03:45,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:03:45,001 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:03:45,001 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:03:45,001 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:03:45,002 INFO L138 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/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/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 -> e6399ca05df7547b7620299987a8a06e9e2c006b [2019-11-16 00:03:45,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:03:45,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:03:45,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:03:45,045 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:03:45,046 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:03:45,046 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/../../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2019-11-16 00:03:45,106 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/data/6f5555161/29bed4e47ea9436188aab8827b0300b8/FLAGe27d28859 [2019-11-16 00:03:45,584 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:03:45,585 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2019-11-16 00:03:45,597 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/data/6f5555161/29bed4e47ea9436188aab8827b0300b8/FLAGe27d28859 [2019-11-16 00:03:45,839 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/uautomizer/data/6f5555161/29bed4e47ea9436188aab8827b0300b8 [2019-11-16 00:03:45,841 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:03:45,842 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:03:45,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:45,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:03:45,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:03:45,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:45" (1/1) ... [2019-11-16 00:03:45,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cf4446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:45, skipping insertion in model container [2019-11-16 00:03:45,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:45" (1/1) ... [2019-11-16 00:03:45,856 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:03:45,897 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:03:46,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:46,297 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:03:46,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:46,409 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:03:46,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:46 WrapperNode [2019-11-16 00:03:46,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:46,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:03:46,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:03:46,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:03:46,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:46" (1/1) ... [2019-11-16 00:03:46,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:46" (1/1) ... [2019-11-16 00:03:46,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:46" (1/1) ... [2019-11-16 00:03:46,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:46" (1/1) ... [2019-11-16 00:03:46,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:46" (1/1) ... [2019-11-16 00:03:46,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:46" (1/1) ... [2019-11-16 00:03:46,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:46" (1/1) ... [2019-11-16 00:03:46,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:03:46,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:03:46,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:03:46,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:03:46,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/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 [2019-11-16 00:03:46,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:03:46,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:03:46,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:03:46,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:03:46,564 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-11-16 00:03:46,565 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-11-16 00:03:46,565 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-11-16 00:03:46,565 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-11-16 00:03:46,565 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-11-16 00:03:46,566 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-11-16 00:03:46,566 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:03:46,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:03:46,566 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:03:46,566 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:03:46,566 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:03:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:03:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:03:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:03:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:03:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:03:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:03:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:03:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:03:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:03:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:03:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:03:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:03:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:03:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:03:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:03:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:03:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:03:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:03:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:03:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:03:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:03:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:03:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:03:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:03:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:03:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:03:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:03:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:03:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:03:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:03:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:03:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:03:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:03:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:03:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:03:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:03:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:03:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:03:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:03:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:03:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:03:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:03:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:03:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:03:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:03:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:03:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:03:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:03:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:03:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:03:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:03:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:03:46,573 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:03:46,573 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:03:46,573 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:03:46,573 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:03:46,573 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:03:46,573 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:03:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:03:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:03:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:03:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:03:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:03:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:03:46,575 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:03:46,575 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:03:46,575 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:03:46,575 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:03:46,575 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:03:46,576 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:03:46,576 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:03:46,576 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:03:46,576 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:03:46,576 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:03:46,576 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:03:46,577 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:03:46,577 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:03:46,577 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:03:46,577 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:03:46,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:03:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:03:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:03:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:03:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:03:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:03:46,579 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:03:46,579 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:03:46,579 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:03:46,579 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:03:46,579 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:03:46,580 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:03:46,580 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:03:46,580 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:03:46,580 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:03:46,580 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:03:46,581 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:03:46,581 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:03:46,581 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:03:46,581 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:03:46,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-16 00:03:46,582 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-11-16 00:03:46,582 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-11-16 00:03:46,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:03:46,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:03:46,582 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-11-16 00:03:46,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:03:46,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:03:46,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:03:46,583 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-11-16 00:03:46,583 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-11-16 00:03:46,584 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-11-16 00:03:46,584 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:03:46,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:03:46,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:03:46,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:03:46,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:03:48,012 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:03:48,012 INFO L284 CfgBuilder]: Removed 33 assume(true) statements. [2019-11-16 00:03:48,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:48 BoogieIcfgContainer [2019-11-16 00:03:48,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:03:48,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:03:48,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:03:48,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:03:48,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:03:45" (1/3) ... [2019-11-16 00:03:48,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1d2d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:03:48, skipping insertion in model container [2019-11-16 00:03:48,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:46" (2/3) ... [2019-11-16 00:03:48,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1d2d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:03:48, skipping insertion in model container [2019-11-16 00:03:48,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:48" (3/3) ... [2019-11-16 00:03:48,029 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2019-11-16 00:03:48,040 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:03:48,050 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 104 error locations. [2019-11-16 00:03:48,062 INFO L249 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2019-11-16 00:03:48,081 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:03:48,081 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:03:48,081 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:03:48,081 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:03:48,082 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:03:48,082 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:03:48,082 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:03:48,082 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:03:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states. [2019-11-16 00:03:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-16 00:03:48,134 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:48,135 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:48,138 INFO L410 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr12REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2019-11-16 00:03:48,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash 256683086, now seen corresponding path program 1 times [2019-11-16 00:03:48,153 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:03:48,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1907531163] [2019-11-16 00:03:48,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_776b02bb-9189-4b6e-94a2-a7debb00558b/bin/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 [2019-11-16 00:03:48,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:03:48,413 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:03:48,418 INFO L168 Benchmark]: Toolchain (without parser) took 2574.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 945.6 MB in the beginning and 1.0 GB in the end (delta: -58.1 MB). Peak memory consumption was 88.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:48,419 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:03:48,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 567.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:48,420 INFO L168 Benchmark]: Boogie Preprocessor took 101.16 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:48,422 INFO L168 Benchmark]: RCFGBuilder took 1502.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.1 MB). Peak memory consumption was 104.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:48,422 INFO L168 Benchmark]: TraceAbstraction took 400.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:48,425 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 567.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.16 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1502.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.1 MB). Peak memory consumption was 104.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 400.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...