./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/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 b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/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 b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:52:09,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:52:09,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:52:09,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:52:09,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:52:09,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:52:09,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:52:09,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:52:09,875 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:52:09,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:52:09,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:52:09,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:52:09,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:52:09,878 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:52:09,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:52:09,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:52:09,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:52:09,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:52:09,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:52:09,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:52:09,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:52:09,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:52:09,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:52:09,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:52:09,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:52:09,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:52:09,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:52:09,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:52:09,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:52:09,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:52:09,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:52:09,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:52:09,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:52:09,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:52:09,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:52:09,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:52:09,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:52:09,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:52:09,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:52:09,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:52:09,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:52:09,893 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 18:52:09,903 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:52:09,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:52:09,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:52:09,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:52:09,904 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:52:09,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:52:09,904 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:52:09,904 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:52:09,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:52:09,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:52:09,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:52:09,905 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 18:52:09,905 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 18:52:09,905 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 18:52:09,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:52:09,905 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 18:52:09,905 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:52:09,905 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:52:09,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:52:09,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:52:09,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:52:09,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:52:09,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:52:09,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:52:09,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:52:09,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:52:09,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:52:09,907 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:52:09,907 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_15e44323-9c45-42f9-a84b-614478b584d3/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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2019-12-07 18:52:10,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:52:10,016 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:52:10,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:52:10,020 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:52:10,021 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:52:10,021 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-12-07 18:52:10,066 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/data/7cc14d9c5/6b7e0505f93a4daa9ae32235376b8fb9/FLAGf62590784 [2019-12-07 18:52:10,542 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:52:10,542 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-12-07 18:52:10,550 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/data/7cc14d9c5/6b7e0505f93a4daa9ae32235376b8fb9/FLAGf62590784 [2019-12-07 18:52:10,559 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/data/7cc14d9c5/6b7e0505f93a4daa9ae32235376b8fb9 [2019-12-07 18:52:10,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:52:10,562 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 18:52:10,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:52:10,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:52:10,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:52:10,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:52:10" (1/1) ... [2019-12-07 18:52:10,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608095ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:10, skipping insertion in model container [2019-12-07 18:52:10,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:52:10" (1/1) ... [2019-12-07 18:52:10,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:52:10,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:52:10,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:52:10,827 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:52:10,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:52:10,887 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:52:10,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:10 WrapperNode [2019-12-07 18:52:10,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:52:10,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:52:10,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:52:10,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:52:10,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:10" (1/1) ... [2019-12-07 18:52:10,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:10" (1/1) ... [2019-12-07 18:52:10,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:10" (1/1) ... [2019-12-07 18:52:10,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:10" (1/1) ... [2019-12-07 18:52:10,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:10" (1/1) ... [2019-12-07 18:52:10,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:10" (1/1) ... [2019-12-07 18:52:10,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:10" (1/1) ... [2019-12-07 18:52:10,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:52:10,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:52:10,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:52:10,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:52:10,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/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-12-07 18:52:10,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 18:52:10,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:52:10,970 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 18:52:10,970 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 18:52:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 18:52:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 18:52:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 18:52:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 18:52:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 18:52:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 18:52:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 18:52:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 18:52:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 18:52:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 18:52:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 18:52:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 18:52:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 18:52:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 18:52:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 18:52:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 18:52:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 18:52:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 18:52:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 18:52:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 18:52:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 18:52:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 18:52:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 18:52:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 18:52:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 18:52:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 18:52:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 18:52:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 18:52:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 18:52:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 18:52:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 18:52:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 18:52:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 18:52:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 18:52:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 18:52:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 18:52:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 18:52:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 18:52:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 18:52:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 18:52:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 18:52:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 18:52:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 18:52:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 18:52:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 18:52:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 18:52:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 18:52:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 18:52:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 18:52:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 18:52:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 18:52:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 18:52:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 18:52:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 18:52:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 18:52:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 18:52:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 18:52:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 18:52:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 18:52:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 18:52:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 18:52:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 18:52:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 18:52:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 18:52:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 18:52:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 18:52:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 18:52:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 18:52:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 18:52:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 18:52:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 18:52:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 18:52:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 18:52:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 18:52:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 18:52:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 18:52:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 18:52:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 18:52:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 18:52:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 18:52:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 18:52:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 18:52:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 18:52:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 18:52:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 18:52:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 18:52:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 18:52:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 18:52:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 18:52:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 18:52:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 18:52:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 18:52:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 18:52:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 18:52:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 18:52:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 18:52:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 18:52:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 18:52:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 18:52:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 18:52:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 18:52:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 18:52:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 18:52:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 18:52:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 18:52:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:52:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:52:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:52:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:52:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:52:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:52:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 18:52:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:52:11,359 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:52:11,359 INFO L287 CfgBuilder]: Removed 17 assume(true) statements. [2019-12-07 18:52:11,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:52:11 BoogieIcfgContainer [2019-12-07 18:52:11,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:52:11,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:52:11,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:52:11,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:52:11,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:52:10" (1/3) ... [2019-12-07 18:52:11,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392c8ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:52:11, skipping insertion in model container [2019-12-07 18:52:11,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:10" (2/3) ... [2019-12-07 18:52:11,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392c8ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:52:11, skipping insertion in model container [2019-12-07 18:52:11,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:52:11" (3/3) ... [2019-12-07 18:52:11,365 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2019-12-07 18:52:11,371 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:52:11,376 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 77 error locations. [2019-12-07 18:52:11,384 INFO L249 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2019-12-07 18:52:11,396 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:52:11,397 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 18:52:11,397 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:52:11,397 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:52:11,397 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:52:11,397 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:52:11,397 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:52:11,397 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:52:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2019-12-07 18:52:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:52:11,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:11,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:11,418 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:11,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:11,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1858828052, now seen corresponding path program 1 times [2019-12-07 18:52:11,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:11,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98586330] [2019-12-07 18:52:11,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:11,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98586330] [2019-12-07 18:52:11,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:11,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:11,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081838115] [2019-12-07 18:52:11,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:52:11,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:11,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:52:11,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:11,556 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 4 states. [2019-12-07 18:52:11,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:11,839 INFO L93 Difference]: Finished difference Result 195 states and 202 transitions. [2019-12-07 18:52:11,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:52:11,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 18:52:11,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:11,847 INFO L225 Difference]: With dead ends: 195 [2019-12-07 18:52:11,847 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 18:52:11,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-07 18:52:11,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 18:52:11,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 163. [2019-12-07 18:52:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 18:52:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 168 transitions. [2019-12-07 18:52:11,881 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 168 transitions. Word has length 7 [2019-12-07 18:52:11,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:11,882 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 168 transitions. [2019-12-07 18:52:11,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:52:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 168 transitions. [2019-12-07 18:52:11,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:52:11,882 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:11,882 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:11,883 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:11,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:11,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1858828053, now seen corresponding path program 1 times [2019-12-07 18:52:11,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:11,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128578169] [2019-12-07 18:52:11,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:11,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128578169] [2019-12-07 18:52:11,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:11,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:11,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861751240] [2019-12-07 18:52:11,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:52:11,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:11,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:52:11,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:11,926 INFO L87 Difference]: Start difference. First operand 163 states and 168 transitions. Second operand 4 states. [2019-12-07 18:52:12,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:12,124 INFO L93 Difference]: Finished difference Result 160 states and 165 transitions. [2019-12-07 18:52:12,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:52:12,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 18:52:12,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:12,126 INFO L225 Difference]: With dead ends: 160 [2019-12-07 18:52:12,126 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 18:52:12,127 INFO L630 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-12-07 18:52:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 18:52:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-12-07 18:52:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-12-07 18:52:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 165 transitions. [2019-12-07 18:52:12,135 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 165 transitions. Word has length 7 [2019-12-07 18:52:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:12,136 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 165 transitions. [2019-12-07 18:52:12,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:52:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 165 transitions. [2019-12-07 18:52:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:52:12,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:12,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:12,137 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:12,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:12,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1622764776, now seen corresponding path program 1 times [2019-12-07 18:52:12,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:12,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918102581] [2019-12-07 18:52:12,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:12,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918102581] [2019-12-07 18:52:12,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:12,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:12,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068079224] [2019-12-07 18:52:12,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:52:12,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:12,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:52:12,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:12,183 INFO L87 Difference]: Start difference. First operand 160 states and 165 transitions. Second operand 4 states. [2019-12-07 18:52:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:12,358 INFO L93 Difference]: Finished difference Result 159 states and 164 transitions. [2019-12-07 18:52:12,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:52:12,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:52:12,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:12,360 INFO L225 Difference]: With dead ends: 159 [2019-12-07 18:52:12,360 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 18:52:12,361 INFO L630 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-12-07 18:52:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 18:52:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2019-12-07 18:52:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 18:52:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2019-12-07 18:52:12,368 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 11 [2019-12-07 18:52:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:12,369 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2019-12-07 18:52:12,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:52:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2019-12-07 18:52:12,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:52:12,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:12,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:12,370 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:12,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:12,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1622764775, now seen corresponding path program 1 times [2019-12-07 18:52:12,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:12,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261124293] [2019-12-07 18:52:12,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:12,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261124293] [2019-12-07 18:52:12,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:12,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:12,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469805393] [2019-12-07 18:52:12,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:52:12,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:12,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:52:12,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:12,421 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand 4 states. [2019-12-07 18:52:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:12,584 INFO L93 Difference]: Finished difference Result 172 states and 178 transitions. [2019-12-07 18:52:12,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:52:12,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:52:12,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:12,585 INFO L225 Difference]: With dead ends: 172 [2019-12-07 18:52:12,586 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 18:52:12,586 INFO L630 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-12-07 18:52:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 18:52:12,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 159. [2019-12-07 18:52:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-12-07 18:52:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2019-12-07 18:52:12,592 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 11 [2019-12-07 18:52:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:12,593 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2019-12-07 18:52:12,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:52:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2019-12-07 18:52:12,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:52:12,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:12,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:12,594 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:12,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:12,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1545644063, now seen corresponding path program 1 times [2019-12-07 18:52:12,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:12,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147993515] [2019-12-07 18:52:12,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:12,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147993515] [2019-12-07 18:52:12,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:12,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:52:12,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939317596] [2019-12-07 18:52:12,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:52:12,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:12,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:52:12,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:52:12,651 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand 5 states. [2019-12-07 18:52:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:12,831 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2019-12-07 18:52:12,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:52:12,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 18:52:12,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:12,832 INFO L225 Difference]: With dead ends: 160 [2019-12-07 18:52:12,832 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 18:52:12,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:52:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 18:52:12,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-12-07 18:52:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 18:52:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2019-12-07 18:52:12,837 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 17 [2019-12-07 18:52:12,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:12,837 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2019-12-07 18:52:12,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:52:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2019-12-07 18:52:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:52:12,838 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:12,838 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:12,838 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:12,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:12,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1545644062, now seen corresponding path program 1 times [2019-12-07 18:52:12,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:12,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858904656] [2019-12-07 18:52:12,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:12,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858904656] [2019-12-07 18:52:12,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:12,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:52:12,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769777758] [2019-12-07 18:52:12,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:52:12,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:12,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:52:12,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:52:12,902 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 7 states. [2019-12-07 18:52:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:13,164 INFO L93 Difference]: Finished difference Result 184 states and 194 transitions. [2019-12-07 18:52:13,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:52:13,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 18:52:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:13,165 INFO L225 Difference]: With dead ends: 184 [2019-12-07 18:52:13,165 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 18:52:13,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:52:13,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 18:52:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 155. [2019-12-07 18:52:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 18:52:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2019-12-07 18:52:13,170 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 17 [2019-12-07 18:52:13,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:13,170 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2019-12-07 18:52:13,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:52:13,170 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2019-12-07 18:52:13,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:52:13,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:13,171 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:13,171 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:13,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:13,171 INFO L82 PathProgramCache]: Analyzing trace with hash 694740068, now seen corresponding path program 1 times [2019-12-07 18:52:13,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:13,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847646227] [2019-12-07 18:52:13,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:13,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847646227] [2019-12-07 18:52:13,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:13,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:52:13,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083145310] [2019-12-07 18:52:13,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:52:13,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:13,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:52:13,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:52:13,209 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand 6 states. [2019-12-07 18:52:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:13,473 INFO L93 Difference]: Finished difference Result 209 states and 225 transitions. [2019-12-07 18:52:13,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:52:13,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-07 18:52:13,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:13,474 INFO L225 Difference]: With dead ends: 209 [2019-12-07 18:52:13,474 INFO L226 Difference]: Without dead ends: 209 [2019-12-07 18:52:13,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-12-07 18:52:13,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-07 18:52:13,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 154. [2019-12-07 18:52:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 18:52:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 165 transitions. [2019-12-07 18:52:13,478 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 165 transitions. Word has length 19 [2019-12-07 18:52:13,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:13,479 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 165 transitions. [2019-12-07 18:52:13,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:52:13,479 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 165 transitions. [2019-12-07 18:52:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:52:13,479 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:13,479 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:13,480 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:13,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:13,480 INFO L82 PathProgramCache]: Analyzing trace with hash 694740069, now seen corresponding path program 1 times [2019-12-07 18:52:13,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:13,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39429490] [2019-12-07 18:52:13,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:13,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39429490] [2019-12-07 18:52:13,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:13,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:52:13,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178112223] [2019-12-07 18:52:13,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:52:13,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:13,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:52:13,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:52:13,536 INFO L87 Difference]: Start difference. First operand 154 states and 165 transitions. Second operand 6 states. [2019-12-07 18:52:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:13,858 INFO L93 Difference]: Finished difference Result 232 states and 249 transitions. [2019-12-07 18:52:13,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:52:13,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-07 18:52:13,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:13,860 INFO L225 Difference]: With dead ends: 232 [2019-12-07 18:52:13,860 INFO L226 Difference]: Without dead ends: 232 [2019-12-07 18:52:13,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:52:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-12-07 18:52:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 153. [2019-12-07 18:52:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-07 18:52:13,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2019-12-07 18:52:13,864 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 19 [2019-12-07 18:52:13,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:13,864 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2019-12-07 18:52:13,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:52:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2019-12-07 18:52:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:52:13,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:13,864 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:13,865 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:13,865 INFO L82 PathProgramCache]: Analyzing trace with hash 694790802, now seen corresponding path program 1 times [2019-12-07 18:52:13,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:13,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688790121] [2019-12-07 18:52:13,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:13,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688790121] [2019-12-07 18:52:13,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:13,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:52:13,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034739095] [2019-12-07 18:52:13,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:52:13,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:13,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:52:13,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:52:13,899 INFO L87 Difference]: Start difference. First operand 153 states and 163 transitions. Second operand 6 states. [2019-12-07 18:52:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:14,128 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2019-12-07 18:52:14,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:52:14,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-07 18:52:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:14,130 INFO L225 Difference]: With dead ends: 194 [2019-12-07 18:52:14,131 INFO L226 Difference]: Without dead ends: 194 [2019-12-07 18:52:14,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-12-07 18:52:14,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-07 18:52:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 151. [2019-12-07 18:52:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 18:52:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2019-12-07 18:52:14,134 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 19 [2019-12-07 18:52:14,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:14,135 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2019-12-07 18:52:14,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:52:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2019-12-07 18:52:14,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:52:14,135 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:14,135 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:14,135 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:14,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:14,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1069449585, now seen corresponding path program 1 times [2019-12-07 18:52:14,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:14,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149638578] [2019-12-07 18:52:14,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:14,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149638578] [2019-12-07 18:52:14,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:14,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:52:14,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052238843] [2019-12-07 18:52:14,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:52:14,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:14,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:52:14,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:52:14,251 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 9 states. [2019-12-07 18:52:14,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:14,563 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2019-12-07 18:52:14,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:52:14,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-07 18:52:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:14,565 INFO L225 Difference]: With dead ends: 205 [2019-12-07 18:52:14,565 INFO L226 Difference]: Without dead ends: 205 [2019-12-07 18:52:14,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:52:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-12-07 18:52:14,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 156. [2019-12-07 18:52:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-12-07 18:52:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 164 transitions. [2019-12-07 18:52:14,570 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 164 transitions. Word has length 22 [2019-12-07 18:52:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:14,570 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 164 transitions. [2019-12-07 18:52:14,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:52:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 164 transitions. [2019-12-07 18:52:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:52:14,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:14,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:14,571 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:14,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:14,572 INFO L82 PathProgramCache]: Analyzing trace with hash -941770330, now seen corresponding path program 1 times [2019-12-07 18:52:14,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:14,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944036721] [2019-12-07 18:52:14,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:14,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944036721] [2019-12-07 18:52:14,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:14,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:52:14,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227803265] [2019-12-07 18:52:14,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:52:14,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:14,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:52:14,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:52:14,661 INFO L87 Difference]: Start difference. First operand 156 states and 164 transitions. Second operand 10 states. [2019-12-07 18:52:15,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:15,055 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2019-12-07 18:52:15,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:52:15,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-12-07 18:52:15,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:15,056 INFO L225 Difference]: With dead ends: 155 [2019-12-07 18:52:15,056 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 18:52:15,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:52:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 18:52:15,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-12-07 18:52:15,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 18:52:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2019-12-07 18:52:15,060 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 23 [2019-12-07 18:52:15,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:15,060 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2019-12-07 18:52:15,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:52:15,060 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2019-12-07 18:52:15,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:52:15,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:15,061 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:15,061 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:15,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:15,062 INFO L82 PathProgramCache]: Analyzing trace with hash -941770329, now seen corresponding path program 1 times [2019-12-07 18:52:15,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:15,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105647342] [2019-12-07 18:52:15,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:15,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105647342] [2019-12-07 18:52:15,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:15,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:52:15,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663743244] [2019-12-07 18:52:15,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:52:15,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:15,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:52:15,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:52:15,167 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand 11 states. [2019-12-07 18:52:15,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:15,700 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2019-12-07 18:52:15,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:52:15,700 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-07 18:52:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:15,701 INFO L225 Difference]: With dead ends: 172 [2019-12-07 18:52:15,701 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 18:52:15,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:52:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 18:52:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 159. [2019-12-07 18:52:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-12-07 18:52:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 171 transitions. [2019-12-07 18:52:15,704 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 171 transitions. Word has length 23 [2019-12-07 18:52:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:15,705 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 171 transitions. [2019-12-07 18:52:15,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:52:15,705 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2019-12-07 18:52:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:52:15,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:15,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:15,706 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:15,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:15,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2141860073, now seen corresponding path program 1 times [2019-12-07 18:52:15,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:15,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048949454] [2019-12-07 18:52:15,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:15,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048949454] [2019-12-07 18:52:15,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:15,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:52:15,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076098394] [2019-12-07 18:52:15,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:52:15,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:15,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:52:15,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:52:15,738 INFO L87 Difference]: Start difference. First operand 159 states and 171 transitions. Second operand 5 states. [2019-12-07 18:52:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:15,872 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2019-12-07 18:52:15,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:52:15,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 18:52:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:15,873 INFO L225 Difference]: With dead ends: 160 [2019-12-07 18:52:15,874 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 18:52:15,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-12-07 18:52:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 18:52:15,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2019-12-07 18:52:15,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 18:52:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2019-12-07 18:52:15,877 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 29 [2019-12-07 18:52:15,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:15,877 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2019-12-07 18:52:15,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:52:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2019-12-07 18:52:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:52:15,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:15,878 INFO L410 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] [2019-12-07 18:52:15,878 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:15,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:15,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1060271776, now seen corresponding path program 1 times [2019-12-07 18:52:15,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:15,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472938218] [2019-12-07 18:52:15,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:15,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:15,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472938218] [2019-12-07 18:52:15,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249157321] [2019-12-07 18:52:15,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/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-12-07 18:52:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:16,002 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 18:52:16,006 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:16,046 INFO L377 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-12-07 18:52:16,046 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:16,051 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:16,053 INFO L377 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-12-07 18:52:16,053 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:16,056 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:16,057 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:16,057 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-12-07 18:52:16,068 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:52:16,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:16,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:16,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:16,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2019-12-07 18:52:16,077 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:16,080 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:16,080 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:16,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:16,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:52:16,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:16,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:16,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:16,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2019-12-07 18:52:16,096 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:16,099 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:16,099 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:16,104 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:16,104 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:16,105 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:33 [2019-12-07 18:52:16,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:16,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:16,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:16,130 INFO L377 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 36 treesize of output 23 [2019-12-07 18:52:16,131 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:16,140 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:16,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:16,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:16,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:16,146 INFO L377 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 36 treesize of output 23 [2019-12-07 18:52:16,146 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:16,152 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:16,152 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:16,152 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2019-12-07 18:52:16,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:16,175 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-12-07 18:52:16,176 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:16,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:16,183 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 18:52:16,183 INFO L377 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 24 treesize of output 10 [2019-12-07 18:52:16,183 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:16,186 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:16,186 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:16,187 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-12-07 18:52:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:16,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:52:16,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-07 18:52:16,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942230674] [2019-12-07 18:52:16,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:52:16,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:16,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:52:16,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:52:16,191 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand 9 states. [2019-12-07 18:52:16,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:16,517 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2019-12-07 18:52:16,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:52:16,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-12-07 18:52:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:16,518 INFO L225 Difference]: With dead ends: 208 [2019-12-07 18:52:16,518 INFO L226 Difference]: Without dead ends: 208 [2019-12-07 18:52:16,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:52:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-12-07 18:52:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 164. [2019-12-07 18:52:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-07 18:52:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 176 transitions. [2019-12-07 18:52:16,522 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 176 transitions. Word has length 29 [2019-12-07 18:52:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:16,522 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 176 transitions. [2019-12-07 18:52:16,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:52:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 176 transitions. [2019-12-07 18:52:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:52:16,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:16,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:16,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:52:16,724 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:16,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1018253523, now seen corresponding path program 1 times [2019-12-07 18:52:16,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:16,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615119071] [2019-12-07 18:52:16,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:16,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615119071] [2019-12-07 18:52:16,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:16,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:52:16,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337343123] [2019-12-07 18:52:16,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:52:16,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:16,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:52:16,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:52:16,807 INFO L87 Difference]: Start difference. First operand 164 states and 176 transitions. Second operand 6 states. [2019-12-07 18:52:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:16,978 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2019-12-07 18:52:16,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:52:16,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 18:52:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:16,979 INFO L225 Difference]: With dead ends: 167 [2019-12-07 18:52:16,979 INFO L226 Difference]: Without dead ends: 167 [2019-12-07 18:52:16,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:52:16,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-12-07 18:52:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2019-12-07 18:52:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 18:52:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 173 transitions. [2019-12-07 18:52:16,983 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 173 transitions. Word has length 29 [2019-12-07 18:52:16,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:16,983 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 173 transitions. [2019-12-07 18:52:16,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:52:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2019-12-07 18:52:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:52:16,984 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:16,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:16,985 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:16,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:16,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2120173555, now seen corresponding path program 1 times [2019-12-07 18:52:16,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:16,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402630336] [2019-12-07 18:52:16,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:17,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402630336] [2019-12-07 18:52:17,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:17,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:52:17,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588245321] [2019-12-07 18:52:17,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:52:17,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:17,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:52:17,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:52:17,024 INFO L87 Difference]: Start difference. First operand 163 states and 173 transitions. Second operand 6 states. [2019-12-07 18:52:17,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:17,275 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2019-12-07 18:52:17,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:52:17,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 18:52:17,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:17,276 INFO L225 Difference]: With dead ends: 237 [2019-12-07 18:52:17,276 INFO L226 Difference]: Without dead ends: 237 [2019-12-07 18:52:17,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-12-07 18:52:17,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-12-07 18:52:17,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 162. [2019-12-07 18:52:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-07 18:52:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2019-12-07 18:52:17,281 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 30 [2019-12-07 18:52:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:17,282 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2019-12-07 18:52:17,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:52:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2019-12-07 18:52:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:52:17,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:17,282 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:17,283 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:17,283 INFO L82 PathProgramCache]: Analyzing trace with hash 2120173556, now seen corresponding path program 1 times [2019-12-07 18:52:17,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:17,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408647339] [2019-12-07 18:52:17,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:17,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408647339] [2019-12-07 18:52:17,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:17,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:52:17,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390273644] [2019-12-07 18:52:17,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:52:17,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:17,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:52:17,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:52:17,331 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 6 states. [2019-12-07 18:52:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:17,634 INFO L93 Difference]: Finished difference Result 263 states and 279 transitions. [2019-12-07 18:52:17,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:52:17,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 18:52:17,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:17,635 INFO L225 Difference]: With dead ends: 263 [2019-12-07 18:52:17,635 INFO L226 Difference]: Without dead ends: 263 [2019-12-07 18:52:17,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:52:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-12-07 18:52:17,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 161. [2019-12-07 18:52:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-12-07 18:52:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2019-12-07 18:52:17,640 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 30 [2019-12-07 18:52:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:17,640 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2019-12-07 18:52:17,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:52:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2019-12-07 18:52:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:52:17,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:17,641 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:17,641 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2123293407, now seen corresponding path program 1 times [2019-12-07 18:52:17,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:17,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296301397] [2019-12-07 18:52:17,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:17,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296301397] [2019-12-07 18:52:17,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:17,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:52:17,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032792777] [2019-12-07 18:52:17,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:52:17,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:17,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:52:17,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:52:17,686 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand 5 states. [2019-12-07 18:52:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:17,834 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2019-12-07 18:52:17,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:52:17,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-07 18:52:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:17,835 INFO L225 Difference]: With dead ends: 160 [2019-12-07 18:52:17,835 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 18:52:17,835 INFO L630 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-12-07 18:52:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 18:52:17,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-12-07 18:52:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-12-07 18:52:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2019-12-07 18:52:17,839 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 32 [2019-12-07 18:52:17,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:17,839 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2019-12-07 18:52:17,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:52:17,840 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2019-12-07 18:52:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:52:17,840 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:17,840 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:17,841 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:17,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:17,841 INFO L82 PathProgramCache]: Analyzing trace with hash 375628515, now seen corresponding path program 1 times [2019-12-07 18:52:17,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:17,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654564733] [2019-12-07 18:52:17,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:17,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654564733] [2019-12-07 18:52:17,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:17,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 18:52:17,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928358385] [2019-12-07 18:52:17,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:52:17,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:17,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:52:17,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:52:17,958 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand 12 states. [2019-12-07 18:52:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:18,518 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2019-12-07 18:52:18,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:52:18,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2019-12-07 18:52:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:18,519 INFO L225 Difference]: With dead ends: 172 [2019-12-07 18:52:18,519 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 18:52:18,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:52:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 18:52:18,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 159. [2019-12-07 18:52:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-12-07 18:52:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2019-12-07 18:52:18,522 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 34 [2019-12-07 18:52:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:18,522 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2019-12-07 18:52:18,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:52:18,523 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2019-12-07 18:52:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:52:18,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:18,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:18,523 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:18,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:18,524 INFO L82 PathProgramCache]: Analyzing trace with hash 752342325, now seen corresponding path program 1 times [2019-12-07 18:52:18,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:18,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886408611] [2019-12-07 18:52:18,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:18,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886408611] [2019-12-07 18:52:18,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:18,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:52:18,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154100809] [2019-12-07 18:52:18,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:52:18,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:18,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:52:18,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:52:18,603 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand 9 states. [2019-12-07 18:52:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:18,994 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2019-12-07 18:52:18,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:52:18,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-07 18:52:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:18,996 INFO L225 Difference]: With dead ends: 159 [2019-12-07 18:52:18,996 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 18:52:18,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:52:18,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 18:52:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-12-07 18:52:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 18:52:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2019-12-07 18:52:19,000 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 34 [2019-12-07 18:52:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:19,000 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2019-12-07 18:52:19,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:52:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2019-12-07 18:52:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:52:19,000 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:19,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:19,001 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:19,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:19,001 INFO L82 PathProgramCache]: Analyzing trace with hash 752342326, now seen corresponding path program 1 times [2019-12-07 18:52:19,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:19,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071955373] [2019-12-07 18:52:19,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:19,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071955373] [2019-12-07 18:52:19,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:19,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:52:19,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504877397] [2019-12-07 18:52:19,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:52:19,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:19,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:52:19,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:52:19,102 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand 10 states. [2019-12-07 18:52:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:19,513 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2019-12-07 18:52:19,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:52:19,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-07 18:52:19,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:19,514 INFO L225 Difference]: With dead ends: 154 [2019-12-07 18:52:19,514 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 18:52:19,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:52:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 18:52:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 143. [2019-12-07 18:52:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 18:52:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2019-12-07 18:52:19,516 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 34 [2019-12-07 18:52:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:19,516 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2019-12-07 18:52:19,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:52:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2019-12-07 18:52:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:52:19,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:19,517 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:19,517 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:19,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:19,517 INFO L82 PathProgramCache]: Analyzing trace with hash -265777045, now seen corresponding path program 1 times [2019-12-07 18:52:19,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:19,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421531832] [2019-12-07 18:52:19,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:19,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:19,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421531832] [2019-12-07 18:52:19,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011425068] [2019-12-07 18:52:19,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/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-12-07 18:52:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:19,627 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:52:19,629 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:52:19,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:52:19,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2019-12-07 18:52:19,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088863869] [2019-12-07 18:52:19,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:19,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:19,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:19,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:52:19,643 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand 3 states. [2019-12-07 18:52:19,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:19,668 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2019-12-07 18:52:19,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:19,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 18:52:19,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:19,669 INFO L225 Difference]: With dead ends: 145 [2019-12-07 18:52:19,669 INFO L226 Difference]: Without dead ends: 145 [2019-12-07 18:52:19,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:52:19,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-07 18:52:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-12-07 18:52:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-07 18:52:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2019-12-07 18:52:19,671 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 35 [2019-12-07 18:52:19,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:19,671 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2019-12-07 18:52:19,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2019-12-07 18:52:19,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 18:52:19,672 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:19,672 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:19,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:52:19,873 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:19,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:19,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2008660114, now seen corresponding path program 1 times [2019-12-07 18:52:19,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:19,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137314809] [2019-12-07 18:52:19,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:19,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137314809] [2019-12-07 18:52:19,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771438718] [2019-12-07 18:52:19,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/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-12-07 18:52:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:19,990 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:52:19,992 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:19,995 INFO L377 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-12-07 18:52:19,996 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:19,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:19,997 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:19,997 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:52:20,001 INFO L377 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-12-07 18:52:20,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:20,002 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:20,003 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:20,003 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 18:52:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:52:20,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:52:20,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2019-12-07 18:52:20,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273144161] [2019-12-07 18:52:20,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:52:20,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:20,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:52:20,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:52:20,014 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. Second operand 4 states. [2019-12-07 18:52:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:20,066 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2019-12-07 18:52:20,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:52:20,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 18:52:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:20,067 INFO L225 Difference]: With dead ends: 154 [2019-12-07 18:52:20,067 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 18:52:20,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:52:20,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 18:52:20,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 148. [2019-12-07 18:52:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 18:52:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 155 transitions. [2019-12-07 18:52:20,070 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 155 transitions. Word has length 37 [2019-12-07 18:52:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:20,070 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 155 transitions. [2019-12-07 18:52:20,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:52:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 155 transitions. [2019-12-07 18:52:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:52:20,070 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:20,070 INFO L410 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] [2019-12-07 18:52:20,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:52:20,272 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:20,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:20,272 INFO L82 PathProgramCache]: Analyzing trace with hash 544247142, now seen corresponding path program 1 times [2019-12-07 18:52:20,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:20,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280419357] [2019-12-07 18:52:20,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:20,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280419357] [2019-12-07 18:52:20,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242661988] [2019-12-07 18:52:20,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/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-12-07 18:52:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:20,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 18:52:20,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:20,451 INFO L377 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 19 treesize of output 1 [2019-12-07 18:52:20,451 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:20,453 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:20,453 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:20,453 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:3 [2019-12-07 18:52:20,509 INFO L377 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-12-07 18:52:20,510 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:20,516 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:20,518 INFO L377 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-12-07 18:52:20,519 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:20,524 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:20,524 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:20,524 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2019-12-07 18:52:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:20,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:52:20,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 15 [2019-12-07 18:52:20,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160095483] [2019-12-07 18:52:20,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:52:20,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:20,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:52:20,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:52:20,561 INFO L87 Difference]: Start difference. First operand 148 states and 155 transitions. Second operand 15 states. [2019-12-07 18:52:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:21,033 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2019-12-07 18:52:21,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:52:21,033 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2019-12-07 18:52:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:21,034 INFO L225 Difference]: With dead ends: 187 [2019-12-07 18:52:21,034 INFO L226 Difference]: Without dead ends: 187 [2019-12-07 18:52:21,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:52:21,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-12-07 18:52:21,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 159. [2019-12-07 18:52:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-12-07 18:52:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2019-12-07 18:52:21,036 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 38 [2019-12-07 18:52:21,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:21,037 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2019-12-07 18:52:21,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:52:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2019-12-07 18:52:21,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:52:21,037 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:21,037 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:21,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:52:21,238 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:21,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:21,239 INFO L82 PathProgramCache]: Analyzing trace with hash -308208132, now seen corresponding path program 1 times [2019-12-07 18:52:21,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:21,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131793429] [2019-12-07 18:52:21,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:52:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:52:21,303 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:52:21,303 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:52:21,318 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-12-07 18:52:21,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:52:21 BoogieIcfgContainer [2019-12-07 18:52:21,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:52:21,331 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:52:21,331 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:52:21,331 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:52:21,332 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:52:11" (3/4) ... [2019-12-07 18:52:21,334 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:52:21,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:52:21,335 INFO L168 Benchmark]: Toolchain (without parser) took 10773.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 939.2 MB in the beginning and 902.9 MB in the end (delta: 36.4 MB). Peak memory consumption was 255.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:52:21,335 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:52:21,335 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -137.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:52:21,335 INFO L168 Benchmark]: Boogie Preprocessor took 42.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:52:21,336 INFO L168 Benchmark]: RCFGBuilder took 429.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.0 MB in the end (delta: 72.4 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:52:21,336 INFO L168 Benchmark]: TraceAbstraction took 9969.95 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 999.0 MB in the beginning and 902.9 MB in the end (delta: 96.1 MB). Peak memory consumption was 222.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:52:21,336 INFO L168 Benchmark]: Witness Printer took 2.82 ms. Allocated memory is still 1.2 GB. Free memory is still 902.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:52:21,337 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -137.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 429.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.0 MB in the end (delta: 72.4 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9969.95 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 999.0 MB in the beginning and 902.9 MB in the end (delta: 96.1 MB). Peak memory consumption was 222.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.82 ms. Allocated memory is still 1.2 GB. Free memory is still 902.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L988] null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L989] null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L990] null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={3:0}, malloc(sizeof(struct TSLL))={3:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L993] list->next = null VAL [list={3:0}, malloc(sizeof(struct TSLL))={3:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L994] list->prev = null VAL [list={3:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={3:0}, null={1:0}] [L995] list->colour = BLACK VAL [list={3:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={3:0}, null={1:0}] [L997] struct TSLL* end = list; VAL [end={3:0}, list={3:0}, malloc(sizeof(struct TSLL))={3:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={3:0}, list={3:0}, malloc(sizeof(struct TSLL))={3:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={3:0}, list={3:0}, malloc(sizeof(struct TSLL))={3:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1031] EXPR end->colour VAL [end={3:0}, end->colour=1, list={3:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={3:0}, null={1:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end VAL [end={3:0}, list={3:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={3:0}, null={1:0}] [L1034] EXPR end->colour VAL [end={3:0}, end->colour=1, list={3:0}, malloc(sizeof(struct TSLL))={3:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next VAL [end={3:0}, end->next={1:0}, list={3:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={3:0}, null={1:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={1:0}, list={3:0}, malloc(sizeof(struct TSLL))={3:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1045] COND TRUE null != list VAL [end={1:0}, list={3:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={3:0}, null={1:0}] [L1047] EXPR list->colour VAL [end={1:0}, list={3:0}, list->colour=1, malloc(sizeof(struct TSLL))={3:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next VAL [end={1:0}, list={3:0}, list->next={1:0}, malloc(sizeof(struct TSLL))={3:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1056] end = list->next [L1057] free(list) VAL [end={1:0}, list={3:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={3:0}, null={1:0}] [L1057] free(list) VAL [end={1:0}, list={3:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={3:0}, null={1:0}] [L1057] free(list) [L1058] list = end VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={3:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1045] COND FALSE !(null != list) VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={3:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1062] return 0; VAL [\result=0, end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={3:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 169 locations, 77 error locations. Result: UNSAFE, OverallTime: 9.9s, OverallIterations: 25, TraceHistogramMax: 2, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2401 SDtfs, 3547 SDslu, 4593 SDs, 0 SdLazy, 9522 SolverSat, 338 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 192 SyntacticMatches, 8 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 615 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 764 NumberOfCodeBlocks, 764 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 697 ConstructedInterpolants, 0 QuantifiedInterpolants, 132454 SizeOfPredicates, 28 NumberOfNonLiveVariables, 660 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 6/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 18:52:22,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:52:22,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:52:22,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:52:22,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:52:22,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:52:22,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:52:22,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:52:22,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:52:22,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:52:22,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:52:22,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:52:22,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:52:22,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:52:22,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:52:22,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:52:22,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:52:22,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:52:22,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:52:22,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:52:22,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:52:22,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:52:22,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:52:22,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:52:22,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:52:22,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:52:22,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:52:22,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:52:22,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:52:22,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:52:22,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:52:22,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:52:22,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:52:22,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:52:22,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:52:22,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:52:22,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:52:22,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:52:22,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:52:22,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:52:22,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:52:22,711 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-07 18:52:22,721 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:52:22,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:52:22,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:52:22,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:52:22,722 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:52:22,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:52:22,723 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:52:22,723 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:52:22,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:52:22,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:52:22,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:52:22,723 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 18:52:22,724 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 18:52:22,724 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 18:52:22,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:52:22,724 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 18:52:22,724 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 18:52:22,724 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 18:52:22,724 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:52:22,724 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:52:22,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:52:22,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:52:22,725 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:52:22,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:52:22,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:52:22,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:52:22,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:52:22,726 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 18:52:22,726 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 18:52:22,726 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:52:22,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 18:52:22,726 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_15e44323-9c45-42f9-a84b-614478b584d3/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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2019-12-07 18:52:22,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:52:22,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:52:22,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:52:22,901 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:52:22,901 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:52:22,902 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-12-07 18:52:22,943 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/data/96e1a8b9c/8cfa6551ae8b49f3b45b7c57d7bde3d3/FLAG26ee855db [2019-12-07 18:52:23,472 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:52:23,473 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-12-07 18:52:23,481 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/data/96e1a8b9c/8cfa6551ae8b49f3b45b7c57d7bde3d3/FLAG26ee855db [2019-12-07 18:52:23,922 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/data/96e1a8b9c/8cfa6551ae8b49f3b45b7c57d7bde3d3 [2019-12-07 18:52:23,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:52:23,925 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 18:52:23,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:52:23,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:52:23,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:52:23,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:52:23" (1/1) ... [2019-12-07 18:52:23,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@484ff3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:23, skipping insertion in model container [2019-12-07 18:52:23,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:52:23" (1/1) ... [2019-12-07 18:52:23,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:52:23,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:52:24,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:52:24,168 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:52:24,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:52:24,230 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:52:24,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:24 WrapperNode [2019-12-07 18:52:24,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:52:24,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:52:24,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:52:24,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:52:24,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:24" (1/1) ... [2019-12-07 18:52:24,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:24" (1/1) ... [2019-12-07 18:52:24,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:24" (1/1) ... [2019-12-07 18:52:24,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:24" (1/1) ... [2019-12-07 18:52:24,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:24" (1/1) ... [2019-12-07 18:52:24,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:24" (1/1) ... [2019-12-07 18:52:24,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:24" (1/1) ... [2019-12-07 18:52:24,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:52:24,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:52:24,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:52:24,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:52:24,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/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-12-07 18:52:24,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 18:52:24,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:52:24,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 18:52:24,324 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 18:52:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 18:52:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 18:52:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 18:52:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 18:52:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 18:52:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 18:52:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 18:52:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 18:52:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 18:52:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 18:52:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 18:52:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 18:52:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 18:52:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 18:52:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 18:52:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 18:52:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 18:52:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 18:52:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 18:52:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 18:52:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 18:52:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 18:52:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 18:52:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 18:52:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 18:52:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 18:52:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 18:52:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 18:52:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 18:52:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 18:52:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 18:52:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 18:52:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 18:52:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 18:52:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 18:52:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 18:52:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 18:52:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 18:52:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 18:52:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 18:52:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 18:52:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 18:52:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 18:52:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 18:52:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 18:52:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 18:52:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 18:52:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 18:52:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 18:52:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 18:52:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 18:52:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 18:52:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 18:52:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 18:52:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 18:52:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 18:52:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 18:52:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 18:52:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 18:52:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 18:52:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 18:52:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 18:52:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 18:52:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 18:52:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 18:52:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 18:52:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 18:52:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 18:52:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 18:52:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 18:52:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 18:52:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 18:52:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 18:52:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 18:52:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 18:52:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 18:52:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 18:52:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 18:52:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 18:52:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 18:52:24,332 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 18:52:24,332 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 18:52:24,332 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 18:52:24,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 18:52:24,332 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 18:52:24,332 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 18:52:24,332 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 18:52:24,332 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 18:52:24,332 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 18:52:24,332 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 18:52:24,332 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 18:52:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 18:52:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 18:52:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 18:52:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 18:52:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 18:52:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 18:52:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 18:52:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 18:52:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 18:52:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 18:52:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 18:52:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 18:52:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 18:52:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 18:52:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 18:52:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:52:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:52:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 18:52:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:52:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 18:52:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:52:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 18:52:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:52:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 18:52:24,952 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:52:24,952 INFO L287 CfgBuilder]: Removed 17 assume(true) statements. [2019-12-07 18:52:24,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:52:24 BoogieIcfgContainer [2019-12-07 18:52:24,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:52:24,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:52:24,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:52:24,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:52:24,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:52:23" (1/3) ... [2019-12-07 18:52:24,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7caedf72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:52:24, skipping insertion in model container [2019-12-07 18:52:24,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:24" (2/3) ... [2019-12-07 18:52:24,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7caedf72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:52:24, skipping insertion in model container [2019-12-07 18:52:24,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:52:24" (3/3) ... [2019-12-07 18:52:24,961 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2019-12-07 18:52:24,970 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:52:24,976 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 77 error locations. [2019-12-07 18:52:24,987 INFO L249 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2019-12-07 18:52:25,004 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:52:25,004 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 18:52:25,004 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:52:25,004 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:52:25,004 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:52:25,004 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:52:25,004 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:52:25,005 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:52:25,021 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states. [2019-12-07 18:52:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:52:25,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:25,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:25,030 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:25,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:25,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1215160280, now seen corresponding path program 1 times [2019-12-07 18:52:25,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:25,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919626107] [2019-12-07 18:52:25,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 18:52:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:25,127 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:52:25,131 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:25,174 INFO L377 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-12-07 18:52:25,174 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:25,179 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:25,180 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:25,180 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:52:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:25,187 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:52:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:25,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919626107] [2019-12-07 18:52:25,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:25,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 18:52:25,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562870832] [2019-12-07 18:52:25,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:25,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:52:25,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:25,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:25,210 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 3 states. [2019-12-07 18:52:25,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:25,489 INFO L93 Difference]: Finished difference Result 193 states and 200 transitions. [2019-12-07 18:52:25,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:25,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 18:52:25,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:25,497 INFO L225 Difference]: With dead ends: 193 [2019-12-07 18:52:25,498 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 18:52:25,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-12-07 18:52:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 18:52:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 161. [2019-12-07 18:52:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-12-07 18:52:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 166 transitions. [2019-12-07 18:52:25,531 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 166 transitions. Word has length 7 [2019-12-07 18:52:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:25,531 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 166 transitions. [2019-12-07 18:52:25,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 166 transitions. [2019-12-07 18:52:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:52:25,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:25,532 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:25,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 18:52:25,734 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:25,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:25,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1215160279, now seen corresponding path program 1 times [2019-12-07 18:52:25,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:25,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813004392] [2019-12-07 18:52:25,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 18:52:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:25,841 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:52:25,842 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:25,848 INFO L377 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-12-07 18:52:25,849 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:25,855 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:25,855 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:25,856 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:52:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:25,865 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:52:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:25,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813004392] [2019-12-07 18:52:25,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:25,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 18:52:25,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525807476] [2019-12-07 18:52:25,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:52:25,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:52:25,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:52:25,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:25,911 INFO L87 Difference]: Start difference. First operand 161 states and 166 transitions. Second operand 4 states. [2019-12-07 18:52:26,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:26,201 INFO L93 Difference]: Finished difference Result 158 states and 163 transitions. [2019-12-07 18:52:26,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:26,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 18:52:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:26,203 INFO L225 Difference]: With dead ends: 158 [2019-12-07 18:52:26,203 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 18:52:26,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:26,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 18:52:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-12-07 18:52:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 18:52:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 163 transitions. [2019-12-07 18:52:26,212 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 163 transitions. Word has length 7 [2019-12-07 18:52:26,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:26,213 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 163 transitions. [2019-12-07 18:52:26,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:52:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 163 transitions. [2019-12-07 18:52:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:52:26,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:26,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:26,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 18:52:26,416 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:26,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:26,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1672800172, now seen corresponding path program 1 times [2019-12-07 18:52:26,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:26,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872185781] [2019-12-07 18:52:26,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 18:52:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:26,511 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:52:26,512 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:26,515 INFO L377 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-12-07 18:52:26,516 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:26,519 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:26,519 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:26,519 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:52:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:26,522 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:52:26,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:26,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872185781] [2019-12-07 18:52:26,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:26,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 18:52:26,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274808891] [2019-12-07 18:52:26,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:26,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:52:26,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:26,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:26,527 INFO L87 Difference]: Start difference. First operand 158 states and 163 transitions. Second operand 3 states. [2019-12-07 18:52:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:26,722 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2019-12-07 18:52:26,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:26,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 18:52:26,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:26,724 INFO L225 Difference]: With dead ends: 157 [2019-12-07 18:52:26,724 INFO L226 Difference]: Without dead ends: 157 [2019-12-07 18:52:26,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-12-07 18:52:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-12-07 18:52:26,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2019-12-07 18:52:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-07 18:52:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2019-12-07 18:52:26,733 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 11 [2019-12-07 18:52:26,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:26,733 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2019-12-07 18:52:26,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2019-12-07 18:52:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:52:26,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:26,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:26,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 18:52:26,935 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:26,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:26,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1672800173, now seen corresponding path program 1 times [2019-12-07 18:52:26,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:26,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203565741] [2019-12-07 18:52:26,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 18:52:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:27,048 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:52:27,048 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:27,054 INFO L377 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-12-07 18:52:27,054 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:27,059 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:27,059 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:27,060 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:52:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:27,066 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:52:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:27,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203565741] [2019-12-07 18:52:27,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:27,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 18:52:27,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931751396] [2019-12-07 18:52:27,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:52:27,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:52:27,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:52:27,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:27,105 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 4 states. [2019-12-07 18:52:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:27,416 INFO L93 Difference]: Finished difference Result 170 states and 176 transitions. [2019-12-07 18:52:27,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:52:27,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:52:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:27,417 INFO L225 Difference]: With dead ends: 170 [2019-12-07 18:52:27,417 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 18:52:27,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 18:52:27,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2019-12-07 18:52:27,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 18:52:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 164 transitions. [2019-12-07 18:52:27,424 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 164 transitions. Word has length 11 [2019-12-07 18:52:27,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:27,424 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 164 transitions. [2019-12-07 18:52:27,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:52:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2019-12-07 18:52:27,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:52:27,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:27,425 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:27,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 18:52:27,626 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:27,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:27,627 INFO L82 PathProgramCache]: Analyzing trace with hash 574289760, now seen corresponding path program 1 times [2019-12-07 18:52:27,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:27,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406838182] [2019-12-07 18:52:27,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 18:52:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:27,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:52:27,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:27,731 INFO L377 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-12-07 18:52:27,732 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:27,733 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:27,733 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:27,733 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:52:27,754 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:27,754 INFO L377 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-12-07 18:52:27,755 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:27,765 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 18:52:27,766 INFO L534 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-12-07 18:52:27,766 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-12-07 18:52:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:27,772 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:52:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:27,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406838182] [2019-12-07 18:52:27,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:27,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:52:27,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463394013] [2019-12-07 18:52:27,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:52:27,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:52:27,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:52:27,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:27,788 INFO L87 Difference]: Start difference. First operand 157 states and 164 transitions. Second operand 4 states. [2019-12-07 18:52:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:28,112 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2019-12-07 18:52:28,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:52:28,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 18:52:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:28,114 INFO L225 Difference]: With dead ends: 158 [2019-12-07 18:52:28,114 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 18:52:28,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:52:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 18:52:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 144. [2019-12-07 18:52:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-12-07 18:52:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2019-12-07 18:52:28,121 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 16 [2019-12-07 18:52:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:28,122 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2019-12-07 18:52:28,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:52:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2019-12-07 18:52:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:52:28,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:28,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:28,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 18:52:28,323 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:28,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:28,324 INFO L82 PathProgramCache]: Analyzing trace with hash 574289761, now seen corresponding path program 1 times [2019-12-07 18:52:28,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:28,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706855323] [2019-12-07 18:52:28,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 18:52:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:28,430 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:52:28,432 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:28,439 INFO L377 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-12-07 18:52:28,440 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:28,448 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:28,450 INFO L377 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-12-07 18:52:28,451 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:28,456 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:28,456 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:28,456 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 18:52:28,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:28,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 18:52:28,487 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:28,498 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:28,509 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:28,509 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 18:52:28,510 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:28,522 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:28,523 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:52:28,523 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-12-07 18:52:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:28,539 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:52:28,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:52:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:28,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706855323] [2019-12-07 18:52:28,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:28,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 18:52:28,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983795954] [2019-12-07 18:52:28,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:52:28,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:52:28,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:52:28,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:52:28,710 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 8 states. [2019-12-07 18:52:29,949 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-12-07 18:52:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:30,766 INFO L93 Difference]: Finished difference Result 188 states and 199 transitions. [2019-12-07 18:52:30,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:52:30,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 18:52:30,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:30,768 INFO L225 Difference]: With dead ends: 188 [2019-12-07 18:52:30,768 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 18:52:30,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:52:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 18:52:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 139. [2019-12-07 18:52:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-12-07 18:52:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2019-12-07 18:52:30,774 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 16 [2019-12-07 18:52:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:30,774 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2019-12-07 18:52:30,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:52:30,774 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2019-12-07 18:52:30,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:52:30,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:30,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:30,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 18:52:30,977 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:30,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:30,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2136696080, now seen corresponding path program 1 times [2019-12-07 18:52:30,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:30,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230111606] [2019-12-07 18:52:30,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 18:52:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:31,095 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:52:31,096 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:31,099 INFO L377 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-12-07 18:52:31,100 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:31,101 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:31,101 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:31,101 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:52:31,109 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:31,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 18:52:31,110 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:31,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:31,112 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:31,112 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2019-12-07 18:52:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:31,121 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:52:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:31,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230111606] [2019-12-07 18:52:31,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:31,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 18:52:31,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659094367] [2019-12-07 18:52:31,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:52:31,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:52:31,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:52:31,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:52:31,129 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand 5 states. [2019-12-07 18:52:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:31,542 INFO L93 Difference]: Finished difference Result 188 states and 197 transitions. [2019-12-07 18:52:31,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:52:31,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-07 18:52:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:31,545 INFO L225 Difference]: With dead ends: 188 [2019-12-07 18:52:31,545 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 18:52:31,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:52:31,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 18:52:31,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 137. [2019-12-07 18:52:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-12-07 18:52:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2019-12-07 18:52:31,549 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 18 [2019-12-07 18:52:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:31,549 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2019-12-07 18:52:31,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:52:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2019-12-07 18:52:31,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:52:31,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:31,550 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:31,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 18:52:31,752 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:31,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:31,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2136646339, now seen corresponding path program 1 times [2019-12-07 18:52:31,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:31,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650869445] [2019-12-07 18:52:31,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 18:52:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:31,905 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:52:31,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:31,909 INFO L377 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-12-07 18:52:31,909 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:31,911 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:31,911 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:31,911 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:52:31,917 INFO L377 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-12-07 18:52:31,918 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:31,923 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:31,923 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:31,923 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-12-07 18:52:31,931 INFO L377 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 11 [2019-12-07 18:52:31,931 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:31,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:31,933 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:31,933 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-12-07 18:52:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:31,939 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:52:31,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:31,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650869445] [2019-12-07 18:52:31,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:31,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 18:52:31,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198125966] [2019-12-07 18:52:31,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:52:31,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:52:31,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:52:31,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:52:31,949 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 5 states. [2019-12-07 18:52:32,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:32,435 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2019-12-07 18:52:32,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:52:32,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-07 18:52:32,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:32,437 INFO L225 Difference]: With dead ends: 187 [2019-12-07 18:52:32,437 INFO L226 Difference]: Without dead ends: 187 [2019-12-07 18:52:32,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:52:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-12-07 18:52:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 136. [2019-12-07 18:52:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-12-07 18:52:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 143 transitions. [2019-12-07 18:52:32,441 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 143 transitions. Word has length 18 [2019-12-07 18:52:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:32,441 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 143 transitions. [2019-12-07 18:52:32,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:52:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2019-12-07 18:52:32,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:52:32,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:32,442 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:32,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 18:52:32,643 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:32,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:32,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2136646340, now seen corresponding path program 1 times [2019-12-07 18:52:32,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:32,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487009928] [2019-12-07 18:52:32,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 18:52:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:32,761 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:52:32,762 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:32,766 INFO L377 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-12-07 18:52:32,766 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:32,771 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:32,771 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:32,771 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:52:32,785 INFO L377 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-12-07 18:52:32,785 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:32,793 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:32,795 INFO L377 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-12-07 18:52:32,796 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:32,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:32,802 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:32,803 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:19 [2019-12-07 18:52:32,815 INFO L377 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 11 [2019-12-07 18:52:32,816 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:32,822 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:32,824 INFO L377 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-12-07 18:52:32,824 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:32,828 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:32,828 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:32,828 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:9 [2019-12-07 18:52:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:32,836 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:52:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:32,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487009928] [2019-12-07 18:52:32,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:32,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 18:52:32,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618604744] [2019-12-07 18:52:32,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:52:32,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:52:32,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:52:32,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:52:32,966 INFO L87 Difference]: Start difference. First operand 136 states and 143 transitions. Second operand 8 states. [2019-12-07 18:52:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:34,237 INFO L93 Difference]: Finished difference Result 213 states and 226 transitions. [2019-12-07 18:52:34,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:52:34,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-07 18:52:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:34,239 INFO L225 Difference]: With dead ends: 213 [2019-12-07 18:52:34,239 INFO L226 Difference]: Without dead ends: 213 [2019-12-07 18:52:34,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:52:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-12-07 18:52:34,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 135. [2019-12-07 18:52:34,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 18:52:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2019-12-07 18:52:34,242 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 18 [2019-12-07 18:52:34,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:34,242 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2019-12-07 18:52:34,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:52:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2019-12-07 18:52:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:52:34,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:34,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:34,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 18:52:34,444 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:34,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:34,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1393288249, now seen corresponding path program 1 times [2019-12-07 18:52:34,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:34,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445116912] [2019-12-07 18:52:34,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 18:52:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:34,633 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:52:34,635 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:34,642 INFO L377 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-12-07 18:52:34,643 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:34,648 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:34,648 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:34,648 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-12-07 18:52:34,668 INFO L377 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-12-07 18:52:34,668 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:34,669 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:34,669 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:34,670 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 18:52:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:34,676 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:52:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:34,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445116912] [2019-12-07 18:52:34,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:34,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 8 [2019-12-07 18:52:34,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133204332] [2019-12-07 18:52:34,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:52:34,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:52:34,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:52:34,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:52:34,701 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 8 states. [2019-12-07 18:52:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:35,247 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2019-12-07 18:52:35,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:52:35,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-07 18:52:35,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:35,248 INFO L225 Difference]: With dead ends: 193 [2019-12-07 18:52:35,248 INFO L226 Difference]: Without dead ends: 193 [2019-12-07 18:52:35,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:52:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-12-07 18:52:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 141. [2019-12-07 18:52:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 18:52:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2019-12-07 18:52:35,252 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 21 [2019-12-07 18:52:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:35,252 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2019-12-07 18:52:35,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:52:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2019-12-07 18:52:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:52:35,253 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:35,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:35,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 18:52:35,454 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:35,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:35,455 INFO L82 PathProgramCache]: Analyzing trace with hash 939855301, now seen corresponding path program 1 times [2019-12-07 18:52:35,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:35,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362546241] [2019-12-07 18:52:35,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 18:52:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:35,657 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 18:52:35,658 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:35,661 INFO L377 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-12-07 18:52:35,661 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:35,663 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:35,663 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:35,663 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:52:35,687 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:35,688 INFO L377 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-12-07 18:52:35,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:35,701 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 18:52:35,701 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:35,701 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-12-07 18:52:35,714 INFO L377 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-12-07 18:52:35,714 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:35,721 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:35,722 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:35,722 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-12-07 18:52:35,776 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:35,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 59 [2019-12-07 18:52:35,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:52:35,778 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:35,788 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:35,789 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:52:35,789 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-12-07 18:52:35,830 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:35,830 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2019-12-07 18:52:35,830 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:35,835 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:35,836 INFO L534 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-12-07 18:52:35,836 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:17 [2019-12-07 18:52:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:35,868 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:52:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:35,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362546241] [2019-12-07 18:52:35,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:35,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2019-12-07 18:52:35,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862157403] [2019-12-07 18:52:35,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 18:52:35,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:52:35,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 18:52:35,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:52:35,957 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 14 states. [2019-12-07 18:52:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:37,390 INFO L93 Difference]: Finished difference Result 214 states and 228 transitions. [2019-12-07 18:52:37,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:52:37,390 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-12-07 18:52:37,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:37,391 INFO L225 Difference]: With dead ends: 214 [2019-12-07 18:52:37,391 INFO L226 Difference]: Without dead ends: 214 [2019-12-07 18:52:37,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2019-12-07 18:52:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-12-07 18:52:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 140. [2019-12-07 18:52:37,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-12-07 18:52:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2019-12-07 18:52:37,396 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 22 [2019-12-07 18:52:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:37,396 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2019-12-07 18:52:37,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 18:52:37,396 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2019-12-07 18:52:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:52:37,397 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:37,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:37,598 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 18:52:37,599 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:37,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:37,600 INFO L82 PathProgramCache]: Analyzing trace with hash 939855302, now seen corresponding path program 1 times [2019-12-07 18:52:37,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:37,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943239512] [2019-12-07 18:52:37,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 18:52:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:37,759 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 18:52:37,761 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:37,764 INFO L377 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-12-07 18:52:37,764 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:37,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:37,766 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:37,766 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:52:37,774 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_89|], 1=[|v_#valid_144|]} [2019-12-07 18:52:37,776 INFO L377 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-12-07 18:52:37,776 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:37,783 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:37,789 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:37,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 18:52:37,789 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:37,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:37,795 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:37,796 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-12-07 18:52:37,811 INFO L377 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-12-07 18:52:37,811 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:37,823 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:37,826 INFO L377 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-12-07 18:52:37,826 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:37,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:37,835 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:37,835 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:27 [2019-12-07 18:52:37,882 INFO L377 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 29 treesize of output 24 [2019-12-07 18:52:37,883 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:37,900 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:37,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:37,926 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 68 [2019-12-07 18:52:37,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:52:37,928 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:37,943 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:37,943 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:52:37,943 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:51 [2019-12-07 18:52:37,994 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:37,994 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2019-12-07 18:52:37,995 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:38,008 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:38,011 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-12-07 18:52:38,012 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:38,018 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:38,018 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:38,019 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:11 [2019-12-07 18:52:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:38,051 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:52:40,441 WARN L192 SmtUtils]: Spent 640.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 18:52:42,969 WARN L192 SmtUtils]: Spent 720.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-07 18:52:42,983 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:43,095 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 18:52:43,096 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:43,103 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:43,288 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-12-07 18:52:43,288 INFO L614 ElimStorePlain]: treesize reduction 58, result has 63.7 percent of original size [2019-12-07 18:52:43,294 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:43,402 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 18:52:43,402 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:43,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:52:43,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:52:43,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:52:43,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:52:43,407 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-12-07 18:52:43,407 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:133, output treesize:46 [2019-12-07 18:52:43,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:52:43,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:52:43,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:52:43,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:52:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:43,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943239512] [2019-12-07 18:52:43,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:43,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-12-07 18:52:43,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013239832] [2019-12-07 18:52:43,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:52:43,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:52:43,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:52:43,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:52:43,547 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 16 states. [2019-12-07 18:52:45,215 WARN L192 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-12-07 18:52:45,507 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-07 18:52:48,426 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-12-07 18:52:51,052 WARN L192 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-12-07 18:52:54,599 WARN L192 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-12-07 18:52:55,462 WARN L192 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-12-07 18:52:56,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:56,117 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2019-12-07 18:52:56,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 18:52:56,118 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 18:52:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:56,119 INFO L225 Difference]: With dead ends: 174 [2019-12-07 18:52:56,119 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 18:52:56,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=345, Invalid=845, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 18:52:56,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 18:52:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 138. [2019-12-07 18:52:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-12-07 18:52:56,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2019-12-07 18:52:56,122 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 22 [2019-12-07 18:52:56,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:56,123 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2019-12-07 18:52:56,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:52:56,123 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2019-12-07 18:52:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:52:56,123 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:56,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:56,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 18:52:56,324 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:56,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:56,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2068258874, now seen corresponding path program 1 times [2019-12-07 18:52:56,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:56,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119973903] [2019-12-07 18:52:56,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 18:52:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:56,410 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:52:56,411 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:56,415 INFO L377 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-12-07 18:52:56,415 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:56,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:56,418 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:56,418 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:52:56,424 INFO L377 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-12-07 18:52:56,425 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:56,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:56,426 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:56,426 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 18:52:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:56,431 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:52:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:56,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119973903] [2019-12-07 18:52:56,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:56,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 18:52:56,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999381966] [2019-12-07 18:52:56,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:52:56,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:52:56,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:52:56,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:56,435 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 4 states. [2019-12-07 18:52:56,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:56,649 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2019-12-07 18:52:56,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:52:56,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 18:52:56,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:56,650 INFO L225 Difference]: With dead ends: 139 [2019-12-07 18:52:56,650 INFO L226 Difference]: Without dead ends: 139 [2019-12-07 18:52:56,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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-12-07 18:52:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-12-07 18:52:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-12-07 18:52:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-12-07 18:52:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2019-12-07 18:52:56,653 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 27 [2019-12-07 18:52:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:56,653 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2019-12-07 18:52:56,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:52:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2019-12-07 18:52:56,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:52:56,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:56,654 INFO L410 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] [2019-12-07 18:52:56,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 18:52:56,855 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:56,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:56,856 INFO L82 PathProgramCache]: Analyzing trace with hash 474052638, now seen corresponding path program 1 times [2019-12-07 18:52:56,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:56,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878700454] [2019-12-07 18:52:56,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 18:52:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:57,016 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 18:52:57,017 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:57,023 INFO L377 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-12-07 18:52:57,024 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:57,032 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:57,034 INFO L377 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-12-07 18:52:57,034 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:57,040 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:57,040 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:57,040 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-12-07 18:52:57,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:57,055 INFO L377 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-12-07 18:52:57,055 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:57,070 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:57,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:57,075 INFO L377 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-12-07 18:52:57,075 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:57,088 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:57,089 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:57,089 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-12-07 18:52:57,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:57,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:57,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:57,120 INFO L377 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 36 treesize of output 23 [2019-12-07 18:52:57,120 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:57,142 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:57,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:57,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:57,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:57,152 INFO L377 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 36 treesize of output 23 [2019-12-07 18:52:57,153 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:57,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:57,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:57,168 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2019-12-07 18:52:57,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:52:57,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-12-07 18:52:57,200 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:57,212 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:57,215 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 18:52:57,215 INFO L377 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 24 treesize of output 10 [2019-12-07 18:52:57,216 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:57,221 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:57,221 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:57,221 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:10 [2019-12-07 18:52:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:57,251 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:52:57,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:52:57,314 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:52:57,317 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:57,342 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:57,345 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:57,346 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:52:57,352 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:57,353 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 18:52:57,353 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:25 [2019-12-07 18:52:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:57,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878700454] [2019-12-07 18:52:57,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:52:57,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-12-07 18:52:57,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884782679] [2019-12-07 18:52:57,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:52:57,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:52:57,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:52:57,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:52:57,381 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 12 states. [2019-12-07 18:52:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:58,541 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2019-12-07 18:52:58,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:52:58,542 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-12-07 18:52:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:58,543 INFO L225 Difference]: With dead ends: 187 [2019-12-07 18:52:58,543 INFO L226 Difference]: Without dead ends: 187 [2019-12-07 18:52:58,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:52:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-12-07 18:52:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 143. [2019-12-07 18:52:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 18:52:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2019-12-07 18:52:58,548 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 28 [2019-12-07 18:52:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:58,548 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2019-12-07 18:52:58,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:52:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2019-12-07 18:52:58,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:52:58,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:58,549 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:58,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 18:52:58,750 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:58,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:58,751 INFO L82 PathProgramCache]: Analyzing trace with hash 432034385, now seen corresponding path program 1 times [2019-12-07 18:52:58,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:58,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742340736] [2019-12-07 18:52:58,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 18:52:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:58,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:52:58,977 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:58,983 INFO L377 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-12-07 18:52:58,983 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:58,988 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:58,988 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:58,988 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-12-07 18:52:59,009 INFO L377 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-12-07 18:52:59,010 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:52:59,011 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:52:59,011 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:52:59,011 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 18:52:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:59,019 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:52:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:59,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742340736] [2019-12-07 18:52:59,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:59,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 9 [2019-12-07 18:52:59,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019632897] [2019-12-07 18:52:59,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:52:59,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:52:59,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:52:59,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:52:59,055 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 9 states. [2019-12-07 18:52:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:59,686 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2019-12-07 18:52:59,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:52:59,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-12-07 18:52:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:59,687 INFO L225 Difference]: With dead ends: 165 [2019-12-07 18:52:59,687 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 18:52:59,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:52:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 18:52:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 143. [2019-12-07 18:52:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 18:52:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2019-12-07 18:52:59,690 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 28 [2019-12-07 18:52:59,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:59,690 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2019-12-07 18:52:59,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:52:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2019-12-07 18:52:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:52:59,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:59,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:59,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 18:52:59,892 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:52:59,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:59,892 INFO L82 PathProgramCache]: Analyzing trace with hash 455505098, now seen corresponding path program 1 times [2019-12-07 18:52:59,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:52:59,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258667992] [2019-12-07 18:52:59,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 18:53:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:00,022 INFO L264 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:53:00,023 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:00,027 INFO L377 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-12-07 18:53:00,027 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:00,029 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:00,029 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:00,029 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:53:00,033 INFO L377 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-12-07 18:53:00,034 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:00,038 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:00,038 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:00,038 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-12-07 18:53:00,044 INFO L377 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 11 [2019-12-07 18:53:00,044 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:00,045 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:00,045 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:00,045 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-12-07 18:53:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:00,050 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:53:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:00,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258667992] [2019-12-07 18:53:00,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:00,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 18:53:00,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495352310] [2019-12-07 18:53:00,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:53:00,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:53:00,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:53:00,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:53:00,054 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 5 states. [2019-12-07 18:53:00,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:00,631 INFO L93 Difference]: Finished difference Result 216 states and 230 transitions. [2019-12-07 18:53:00,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:53:00,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 18:53:00,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:00,632 INFO L225 Difference]: With dead ends: 216 [2019-12-07 18:53:00,632 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 18:53:00,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:53:00,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 18:53:00,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 142. [2019-12-07 18:53:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-12-07 18:53:00,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 150 transitions. [2019-12-07 18:53:00,635 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 150 transitions. Word has length 28 [2019-12-07 18:53:00,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:00,635 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 150 transitions. [2019-12-07 18:53:00,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:53:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2019-12-07 18:53:00,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:53:00,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:00,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:00,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 18:53:00,837 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:53:00,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:00,837 INFO L82 PathProgramCache]: Analyzing trace with hash 455505099, now seen corresponding path program 1 times [2019-12-07 18:53:00,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:53:00,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875657493] [2019-12-07 18:53:00,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 18:53:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:00,929 INFO L264 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:53:00,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:00,933 INFO L377 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-12-07 18:53:00,933 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:00,937 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:00,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:00,938 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:53:00,947 INFO L377 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-12-07 18:53:00,947 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:00,955 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:00,958 INFO L377 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-12-07 18:53:00,958 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:00,964 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:00,965 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:00,965 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:19 [2019-12-07 18:53:00,976 INFO L377 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 11 [2019-12-07 18:53:00,976 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:00,982 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:00,984 INFO L377 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-12-07 18:53:00,984 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:00,987 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:00,987 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:00,987 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2019-12-07 18:53:00,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:00,996 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:53:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:01,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875657493] [2019-12-07 18:53:01,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:01,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 18:53:01,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963161493] [2019-12-07 18:53:01,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:53:01,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:53:01,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:53:01,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:53:01,117 INFO L87 Difference]: Start difference. First operand 142 states and 150 transitions. Second operand 8 states. [2019-12-07 18:53:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:02,654 INFO L93 Difference]: Finished difference Result 242 states and 257 transitions. [2019-12-07 18:53:02,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:53:02,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-12-07 18:53:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:02,656 INFO L225 Difference]: With dead ends: 242 [2019-12-07 18:53:02,656 INFO L226 Difference]: Without dead ends: 242 [2019-12-07 18:53:02,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:53:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-07 18:53:02,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 141. [2019-12-07 18:53:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 18:53:02,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2019-12-07 18:53:02,659 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 28 [2019-12-07 18:53:02,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:02,659 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2019-12-07 18:53:02,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:53:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2019-12-07 18:53:02,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:53:02,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:02,660 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:02,860 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 18:53:02,861 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:53:02,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:02,862 INFO L82 PathProgramCache]: Analyzing trace with hash 104740982, now seen corresponding path program 1 times [2019-12-07 18:53:02,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:53:02,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463207817] [2019-12-07 18:53:02,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 18:53:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:03,036 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:53:03,037 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:03,043 INFO L377 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-12-07 18:53:03,043 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:03,052 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:03,054 INFO L377 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-12-07 18:53:03,054 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:03,061 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:03,061 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:03,061 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-12-07 18:53:03,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:53:03,080 INFO L377 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 27 treesize of output 11 [2019-12-07 18:53:03,080 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:03,094 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:03,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:53:03,097 INFO L377 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 27 treesize of output 11 [2019-12-07 18:53:03,097 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:03,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:03,103 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:03,103 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:18 [2019-12-07 18:53:03,107 INFO L377 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-12-07 18:53:03,107 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:03,115 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:03,117 INFO L377 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-12-07 18:53:03,117 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:03,122 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:03,122 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:03,122 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:10 [2019-12-07 18:53:03,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:03,132 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:53:03,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:03,157 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:03,160 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:03,183 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:03,186 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:03,187 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:03,193 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:03,194 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 18:53:03,194 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:25 [2019-12-07 18:53:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:03,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463207817] [2019-12-07 18:53:03,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:03,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-12-07 18:53:03,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583321918] [2019-12-07 18:53:03,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:53:03,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:53:03,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:53:03,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:53:03,205 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 7 states. [2019-12-07 18:53:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:03,587 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2019-12-07 18:53:03,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:53:03,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-12-07 18:53:03,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:03,589 INFO L225 Difference]: With dead ends: 140 [2019-12-07 18:53:03,589 INFO L226 Difference]: Without dead ends: 140 [2019-12-07 18:53:03,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:53:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-07 18:53:03,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-12-07 18:53:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-12-07 18:53:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2019-12-07 18:53:03,592 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 30 [2019-12-07 18:53:03,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:03,593 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2019-12-07 18:53:03,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:53:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2019-12-07 18:53:03,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:53:03,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:03,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:03,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 18:53:03,794 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:53:03,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:03,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1871966522, now seen corresponding path program 1 times [2019-12-07 18:53:03,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:53:03,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718747329] [2019-12-07 18:53:03,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 18:53:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:03,959 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 18:53:03,960 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:03,963 INFO L377 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-12-07 18:53:03,963 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:03,964 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:03,964 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:03,964 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:53:03,979 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:03,979 INFO L377 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 14 treesize of output 30 [2019-12-07 18:53:03,979 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:03,990 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 18:53:03,990 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:03,990 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:11 [2019-12-07 18:53:04,016 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:04,016 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-12-07 18:53:04,017 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:04,020 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:04,020 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:04,020 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2019-12-07 18:53:04,031 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:53:04,031 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:04,038 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:04,038 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:04,038 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:17 [2019-12-07 18:53:04,086 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:04,087 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 56 [2019-12-07 18:53:04,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:04,088 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:04,099 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:04,100 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:04,100 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2019-12-07 18:53:04,139 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:04,140 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2019-12-07 18:53:04,140 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:04,144 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:04,144 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:04,144 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:4 [2019-12-07 18:53:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:04,170 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:53:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:04,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718747329] [2019-12-07 18:53:04,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:04,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 8] imperfect sequences [] total 14 [2019-12-07 18:53:04,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838404170] [2019-12-07 18:53:04,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 18:53:04,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:53:04,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 18:53:04,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:53:04,270 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 14 states. [2019-12-07 18:53:05,690 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-07 18:53:05,857 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-12-07 18:53:06,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:06,225 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2019-12-07 18:53:06,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:53:06,226 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-12-07 18:53:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:06,227 INFO L225 Difference]: With dead ends: 208 [2019-12-07 18:53:06,227 INFO L226 Difference]: Without dead ends: 208 [2019-12-07 18:53:06,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=290, Invalid=640, Unknown=0, NotChecked=0, Total=930 [2019-12-07 18:53:06,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-12-07 18:53:06,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 145. [2019-12-07 18:53:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-07 18:53:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2019-12-07 18:53:06,229 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 32 [2019-12-07 18:53:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:06,230 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2019-12-07 18:53:06,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 18:53:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2019-12-07 18:53:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:53:06,230 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:06,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:06,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 18:53:06,431 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:53:06,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:06,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2046286964, now seen corresponding path program 1 times [2019-12-07 18:53:06,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:53:06,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636372559] [2019-12-07 18:53:06,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 18:53:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:06,705 INFO L264 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 18:53:06,706 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:06,709 INFO L377 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-12-07 18:53:06,709 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:06,711 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:06,711 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:06,711 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:53:06,732 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:06,732 INFO L377 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-12-07 18:53:06,733 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:06,745 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 18:53:06,745 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:06,745 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-12-07 18:53:06,756 INFO L377 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-12-07 18:53:06,756 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:06,763 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:06,764 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:06,764 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-12-07 18:53:06,815 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:06,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 59 [2019-12-07 18:53:06,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:06,817 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:06,828 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:06,828 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:06,828 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-12-07 18:53:06,865 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:06,866 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2019-12-07 18:53:06,866 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:06,871 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:06,871 INFO L534 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-12-07 18:53:06,871 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:17 [2019-12-07 18:53:06,938 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:06,938 INFO L377 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 73 [2019-12-07 18:53:06,939 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:06,970 INFO L614 ElimStorePlain]: treesize reduction 28, result has 50.0 percent of original size [2019-12-07 18:53:06,971 INFO L534 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-12-07 18:53:06,971 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2019-12-07 18:53:07,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:53:07,005 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:07,018 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:07,019 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:07,019 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:46 [2019-12-07 18:53:07,121 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:07,121 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 63 [2019-12-07 18:53:07,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:07,122 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:07,143 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:07,143 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:07,144 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:59 [2019-12-07 18:53:07,216 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:07,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2019-12-07 18:53:07,217 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:07,228 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:07,229 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:07,229 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:66, output treesize:34 [2019-12-07 18:53:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:07,351 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:53:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:07,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636372559] [2019-12-07 18:53:07,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:07,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 6] imperfect sequences [] total 19 [2019-12-07 18:53:07,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765811184] [2019-12-07 18:53:07,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 18:53:07,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:53:07,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 18:53:07,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:53:07,489 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 20 states. [2019-12-07 18:53:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:11,995 INFO L93 Difference]: Finished difference Result 253 states and 270 transitions. [2019-12-07 18:53:11,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 18:53:11,996 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2019-12-07 18:53:11,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:11,997 INFO L225 Difference]: With dead ends: 253 [2019-12-07 18:53:11,997 INFO L226 Difference]: Without dead ends: 253 [2019-12-07 18:53:11,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=611, Invalid=1839, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 18:53:11,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-12-07 18:53:12,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 144. [2019-12-07 18:53:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-12-07 18:53:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2019-12-07 18:53:12,000 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 32 [2019-12-07 18:53:12,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:12,000 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2019-12-07 18:53:12,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 18:53:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2019-12-07 18:53:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:53:12,001 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:12,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:12,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 18:53:12,201 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:53:12,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2046286963, now seen corresponding path program 1 times [2019-12-07 18:53:12,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:53:12,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177856525] [2019-12-07 18:53:12,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 18:53:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:12,362 INFO L264 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 18:53:12,363 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:12,366 INFO L377 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-12-07 18:53:12,366 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,369 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,369 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,369 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:53:12,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,388 INFO L377 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-12-07 18:53:12,389 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,401 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 18:53:12,401 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,401 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-12-07 18:53:12,412 INFO L377 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-12-07 18:53:12,412 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,419 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,420 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,420 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-12-07 18:53:12,470 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,471 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 59 [2019-12-07 18:53:12,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:53:12,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:12,472 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:53:12,508 INFO L614 ElimStorePlain]: treesize reduction 41, result has 49.4 percent of original size [2019-12-07 18:53:12,508 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:12,508 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-12-07 18:53:12,545 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,545 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2019-12-07 18:53:12,546 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,551 INFO L534 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-12-07 18:53:12,551 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:15 [2019-12-07 18:53:12,583 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_99|], 3=[|v_#valid_189|]} [2019-12-07 18:53:12,586 INFO L377 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-12-07 18:53:12,586 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,596 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,608 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,609 INFO L377 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 18 treesize of output 28 [2019-12-07 18:53:12,609 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,618 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,618 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,618 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:13 [2019-12-07 18:53:12,638 INFO L377 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-12-07 18:53:12,638 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,650 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,652 INFO L377 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-12-07 18:53:12,652 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,660 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,660 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:27 [2019-12-07 18:53:12,715 INFO L377 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 29 treesize of output 24 [2019-12-07 18:53:12,715 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,732 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,758 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 68 [2019-12-07 18:53:12,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:12,759 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,773 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,773 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:12,774 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2019-12-07 18:53:12,833 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,833 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 44 [2019-12-07 18:53:12,834 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,848 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-12-07 18:53:12,851 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:12,856 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:12,857 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:67, output treesize:11 [2019-12-07 18:53:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:12,904 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:53:15,854 WARN L192 SmtUtils]: Spent 670.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 18:53:18,910 WARN L192 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-07 18:53:18,924 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:19,002 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:19,009 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:19,209 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-12-07 18:53:19,209 INFO L614 ElimStorePlain]: treesize reduction 58, result has 63.7 percent of original size [2019-12-07 18:53:19,214 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:19,332 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 18:53:19,332 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:19,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:19,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:19,336 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2019-12-07 18:53:19,336 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:133, output treesize:33 [2019-12-07 18:53:19,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:19,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177856525] [2019-12-07 18:53:19,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:19,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 12] imperfect sequences [] total 25 [2019-12-07 18:53:19,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487912814] [2019-12-07 18:53:19,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 18:53:19,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:53:19,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 18:53:19,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2019-12-07 18:53:19,678 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 26 states. [2019-12-07 18:53:23,304 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-12-07 18:53:23,743 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-12-07 18:53:27,525 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2019-12-07 18:53:31,553 WARN L192 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-12-07 18:53:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:35,243 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2019-12-07 18:53:35,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 18:53:35,244 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-12-07 18:53:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:35,245 INFO L225 Difference]: With dead ends: 194 [2019-12-07 18:53:35,245 INFO L226 Difference]: Without dead ends: 194 [2019-12-07 18:53:35,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=663, Invalid=2417, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 18:53:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-07 18:53:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 141. [2019-12-07 18:53:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 18:53:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2019-12-07 18:53:35,248 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 32 [2019-12-07 18:53:35,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:35,248 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2019-12-07 18:53:35,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 18:53:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2019-12-07 18:53:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:53:35,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:35,249 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:35,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 18:53:35,450 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:53:35,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:35,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1710719617, now seen corresponding path program 1 times [2019-12-07 18:53:35,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:53:35,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82555504] [2019-12-07 18:53:35,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 18:53:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:35,612 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:53:35,612 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:53:35,649 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:53:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:53:35,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82555504] [2019-12-07 18:53:35,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:35,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 2] imperfect sequences [] total 5 [2019-12-07 18:53:35,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816769174] [2019-12-07 18:53:35,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:53:35,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:53:35,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:53:35,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:53:35,664 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 6 states. [2019-12-07 18:53:35,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:35,806 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2019-12-07 18:53:35,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:53:35,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 18:53:35,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:35,807 INFO L225 Difference]: With dead ends: 143 [2019-12-07 18:53:35,807 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 18:53:35,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:53:35,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 18:53:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-12-07 18:53:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 18:53:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2019-12-07 18:53:35,809 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 34 [2019-12-07 18:53:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:35,810 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2019-12-07 18:53:35,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:53:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2019-12-07 18:53:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:53:35,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:35,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:36,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 18:53:36,011 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:53:36,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:36,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2025114388, now seen corresponding path program 1 times [2019-12-07 18:53:36,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:53:36,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540660483] [2019-12-07 18:53:36,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 18:53:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:36,132 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:53:36,132 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:36,135 INFO L377 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-12-07 18:53:36,135 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:36,137 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:36,137 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:36,137 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:53:36,145 INFO L377 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-12-07 18:53:36,146 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:36,147 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:36,147 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:36,147 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 18:53:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:53:36,153 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:53:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:53:36,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540660483] [2019-12-07 18:53:36,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:36,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:53:36,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473543059] [2019-12-07 18:53:36,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:53:36,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:53:36,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:53:36,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:53:36,170 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 6 states. [2019-12-07 18:53:36,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:36,372 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2019-12-07 18:53:36,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:53:36,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-12-07 18:53:36,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:36,373 INFO L225 Difference]: With dead ends: 152 [2019-12-07 18:53:36,373 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 18:53:36,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:53:36,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 18:53:36,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2019-12-07 18:53:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 18:53:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2019-12-07 18:53:36,376 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 36 [2019-12-07 18:53:36,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:36,376 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2019-12-07 18:53:36,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:53:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2019-12-07 18:53:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 18:53:36,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:36,376 INFO L410 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] [2019-12-07 18:53:36,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 18:53:36,577 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:53:36,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:36,578 INFO L82 PathProgramCache]: Analyzing trace with hash 34164668, now seen corresponding path program 1 times [2019-12-07 18:53:36,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:53:36,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869697085] [2019-12-07 18:53:36,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 18:53:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:36,677 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 18:53:36,677 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:36,729 INFO L377 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-12-07 18:53:36,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:36,737 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:36,739 INFO L377 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-12-07 18:53:36,739 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:36,744 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:36,744 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:36,744 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:10 [2019-12-07 18:53:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:36,792 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:53:36,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:36,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:36,907 INFO L377 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 11 treesize of output 15 [2019-12-07 18:53:36,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:53:36,907 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:53:36,926 INFO L614 ElimStorePlain]: treesize reduction 17, result has 48.5 percent of original size [2019-12-07 18:53:36,928 INFO L377 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 8 treesize of output 4 [2019-12-07 18:53:36,928 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:36,932 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:36,933 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 18:53:36,933 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:7 [2019-12-07 18:53:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:36,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869697085] [2019-12-07 18:53:36,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:53:36,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-12-07 18:53:36,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513441426] [2019-12-07 18:53:36,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 18:53:36,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:53:36,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 18:53:36,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:53:36,954 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand 17 states. [2019-12-07 18:53:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:38,685 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2019-12-07 18:53:38,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:53:38,685 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2019-12-07 18:53:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:38,686 INFO L225 Difference]: With dead ends: 197 [2019-12-07 18:53:38,686 INFO L226 Difference]: Without dead ends: 197 [2019-12-07 18:53:38,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-12-07 18:53:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-07 18:53:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 157. [2019-12-07 18:53:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 18:53:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2019-12-07 18:53:38,688 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 37 [2019-12-07 18:53:38,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:38,689 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2019-12-07 18:53:38,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 18:53:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2019-12-07 18:53:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:53:38,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:38,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:38,889 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 18:53:38,890 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_LEAK, mainErr74ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_LEAK, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr76ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr73ASSERT_VIOLATIONMEMORY_FREE, mainErr61REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_LEAK, mainErr55REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr71REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr75ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-12-07 18:53:38,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:38,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1059104378, now seen corresponding path program 1 times [2019-12-07 18:53:38,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:53:38,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726605255] [2019-12-07 18:53:38,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15e44323-9c45-42f9-a84b-614478b584d3/bin/uautomizer/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 18:53:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:39,250 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 18:53:39,250 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:53:39,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 18:53:39,479 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-12-07 18:53:39,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:53:39 BoogieIcfgContainer [2019-12-07 18:53:39,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:53:39,493 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:53:39,493 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:53:39,493 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:53:39,494 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:52:24" (3/4) ... [2019-12-07 18:53:39,496 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:53:39,496 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:53:39,497 INFO L168 Benchmark]: Toolchain (without parser) took 75572.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.1 MB). Free memory was 948.4 MB in the beginning and 1.3 GB in the end (delta: -314.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:53:39,497 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:53:39,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:39,497 INFO L168 Benchmark]: Boogie Preprocessor took 50.35 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:39,497 INFO L168 Benchmark]: RCFGBuilder took 672.53 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: 70.4 MB). Peak memory consumption was 77.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:39,497 INFO L168 Benchmark]: TraceAbstraction took 74538.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -243.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:53:39,498 INFO L168 Benchmark]: Witness Printer took 2.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:53:39,499 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.35 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 672.53 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: 70.4 MB). Peak memory consumption was 77.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74538.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -243.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L988] null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L989] null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L990] null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L993] list->next = null VAL [list={2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L994] list->prev = null VAL [list={2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L995] list->colour = BLACK VAL [list={2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L997] struct TSLL* end = list; VAL [end={2:0}, list={2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={2:0}, list={2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={2:0}, list={2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L1031] EXPR end->colour VAL [end={2:0}, end->colour=1, list={2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end VAL [end={2:0}, list={2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L1034] EXPR end->colour VAL [end={2:0}, end->colour=1, list={2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next VAL [end={2:0}, end->next={1:0}, list={2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={1:0}, list={2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L1045] COND TRUE null != list VAL [end={1:0}, list={2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L1047] EXPR list->colour VAL [end={1:0}, list={2:0}, list->colour=1, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next VAL [end={1:0}, list={2:0}, list->next={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L1056] end = list->next [L1057] free(list) VAL [end={1:0}, list={2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L1057] free(list) VAL [end={1:0}, list={2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L1057] free(list) [L1058] list = end VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L1045] COND FALSE !(null != list) VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] [L1062] return 0; VAL [\result=0, end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={2:0}, null={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 173 locations, 77 error locations. Result: UNSAFE, OverallTime: 74.4s, OverallIterations: 25, TraceHistogramMax: 2, AutomataDifference: 48.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2362 SDtfs, 4581 SDslu, 6644 SDs, 0 SdLazy, 9263 SolverSat, 462 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1249 GetRequests, 911 SyntacticMatches, 22 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 37.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 966 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 597 NumberOfCodeBlocks, 597 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1070 ConstructedInterpolants, 74 QuantifiedInterpolants, 187647 SizeOfPredicates, 196 NumberOfNonLiveVariables, 2856 ConjunctsInSsa, 210 ConjunctsInUnsatCore, 48 InterpolantComputations, 44 PerfectInterpolantSequences, 8/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...