./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 11:40:23,871 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:40:23,873 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:40:23,880 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:40:23,881 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:40:23,881 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:40:23,882 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:40:23,883 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:40:23,884 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:40:23,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:40:23,885 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:40:23,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:40:23,886 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:40:23,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:40:23,888 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:40:23,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:40:23,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:40:23,890 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:40:23,891 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:40:23,892 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:40:23,893 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:40:23,894 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:40:23,895 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:40:23,896 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:40:23,896 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:40:23,896 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:40:23,897 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:40:23,898 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:40:23,898 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:40:23,899 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:40:23,899 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:40:23,900 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:40:23,900 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:40:23,900 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:40:23,901 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:40:23,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:40:23,901 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 11:40:23,912 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:40:23,912 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:40:23,912 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 11:40:23,912 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 11:40:23,913 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 11:40:23,913 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 11:40:23,913 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 11:40:23,913 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:40:23,914 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:40:23,914 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 11:40:23,914 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:40:23,914 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:40:23,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:40:23,914 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 11:40:23,914 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 11:40:23,914 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 11:40:23,914 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 11:40:23,915 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:40:23,915 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 11:40:23,915 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:40:23,915 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:40:23,915 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 11:40:23,915 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 11:40:23,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:40:23,915 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:40:23,915 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 11:40:23,916 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 11:40:23,916 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 11:40:23,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-12-09 11:40:23,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:40:23,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:40:23,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:40:23,951 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:40:23,951 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:40:23,951 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-09 11:40:23,990 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/data/289e53bfb/e2e784e5ac464541ba2e16e197d11956/FLAGd997e7b80 [2018-12-09 11:40:24,453 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:40:24,453 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-09 11:40:24,459 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/data/289e53bfb/e2e784e5ac464541ba2e16e197d11956/FLAGd997e7b80 [2018-12-09 11:40:24,971 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/data/289e53bfb/e2e784e5ac464541ba2e16e197d11956 [2018-12-09 11:40:24,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:40:24,974 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 11:40:24,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:40:24,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:40:24,977 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:40:24,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:40:24" (1/1) ... [2018-12-09 11:40:24,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513beff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:24, skipping insertion in model container [2018-12-09 11:40:24,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:40:24" (1/1) ... [2018-12-09 11:40:24,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:40:25,003 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:40:25,147 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:40:25,190 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:40:25,216 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:40:25,239 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:40:25,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:25 WrapperNode [2018-12-09 11:40:25,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:40:25,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:40:25,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:40:25,240 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:40:25,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:25" (1/1) ... [2018-12-09 11:40:25,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:25" (1/1) ... [2018-12-09 11:40:25,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:25" (1/1) ... [2018-12-09 11:40:25,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:25" (1/1) ... [2018-12-09 11:40:25,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:25" (1/1) ... [2018-12-09 11:40:25,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:25" (1/1) ... [2018-12-09 11:40:25,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:25" (1/1) ... [2018-12-09 11:40:25,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:40:25,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:40:25,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:40:25,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:40:25,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:40:25,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 11:40:25,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:40:25,313 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 11:40:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 11:40:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 11:40:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 11:40:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 11:40:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 11:40:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 11:40:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 11:40:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 11:40:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 11:40:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 11:40:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 11:40:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 11:40:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 11:40:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 11:40:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 11:40:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 11:40:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 11:40:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 11:40:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 11:40:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 11:40:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 11:40:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 11:40:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 11:40:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 11:40:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 11:40:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 11:40:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 11:40:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 11:40:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 11:40:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 11:40:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 11:40:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 11:40:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 11:40:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 11:40:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 11:40:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 11:40:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 11:40:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 11:40:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 11:40:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 11:40:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 11:40:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 11:40:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 11:40:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 11:40:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 11:40:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 11:40:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 11:40:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 11:40:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 11:40:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 11:40:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 11:40:25,318 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 11:40:25,318 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 11:40:25,318 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 11:40:25,318 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 11:40:25,318 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 11:40:25,318 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 11:40:25,318 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 11:40:25,318 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 11:40:25,318 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 11:40:25,318 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 11:40:25,318 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 11:40:25,318 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 11:40:25,318 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 11:40:25,319 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 11:40:25,319 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 11:40:25,319 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 11:40:25,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 11:40:25,319 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 11:40:25,319 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 11:40:25,319 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 11:40:25,319 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 11:40:25,319 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 11:40:25,319 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 11:40:25,319 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 11:40:25,319 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 11:40:25,319 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 11:40:25,319 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 11:40:25,319 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 11:40:25,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 11:40:25,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:40:25,654 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:40:25,654 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-09 11:40:25,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:40:25 BoogieIcfgContainer [2018-12-09 11:40:25,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:40:25,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 11:40:25,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 11:40:25,656 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 11:40:25,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:40:24" (1/3) ... [2018-12-09 11:40:25,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecf8e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:40:25, skipping insertion in model container [2018-12-09 11:40:25,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:25" (2/3) ... [2018-12-09 11:40:25,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecf8e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:40:25, skipping insertion in model container [2018-12-09 11:40:25,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:40:25" (3/3) ... [2018-12-09 11:40:25,658 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-09 11:40:25,664 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 11:40:25,669 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-12-09 11:40:25,678 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-12-09 11:40:25,693 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 11:40:25,693 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 11:40:25,694 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 11:40:25,694 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 11:40:25,694 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:40:25,694 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:40:25,694 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 11:40:25,694 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:40:25,694 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 11:40:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-12-09 11:40:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 11:40:25,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:25,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:25,712 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:25,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:25,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1288008576, now seen corresponding path program 1 times [2018-12-09 11:40:25,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:25,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:25,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:25,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:25,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:25,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:25,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 11:40:25,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:40:25,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:40:25,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:25,815 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2018-12-09 11:40:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:25,964 INFO L93 Difference]: Finished difference Result 171 states and 178 transitions. [2018-12-09 11:40:25,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:40:25,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-09 11:40:25,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:25,972 INFO L225 Difference]: With dead ends: 171 [2018-12-09 11:40:25,972 INFO L226 Difference]: Without dead ends: 167 [2018-12-09 11:40:25,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-09 11:40:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2018-12-09 11:40:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-09 11:40:25,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 148 transitions. [2018-12-09 11:40:25,997 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 148 transitions. Word has length 7 [2018-12-09 11:40:25,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:25,998 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 148 transitions. [2018-12-09 11:40:25,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:40:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 148 transitions. [2018-12-09 11:40:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 11:40:25,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:25,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:25,998 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:25,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:25,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1288008577, now seen corresponding path program 1 times [2018-12-09 11:40:25,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:25,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:26,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:26,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:26,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:26,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:26,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 11:40:26,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:40:26,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:40:26,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:26,024 INFO L87 Difference]: Start difference. First operand 143 states and 148 transitions. Second operand 3 states. [2018-12-09 11:40:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:26,091 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2018-12-09 11:40:26,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:40:26,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-09 11:40:26,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:26,092 INFO L225 Difference]: With dead ends: 140 [2018-12-09 11:40:26,092 INFO L226 Difference]: Without dead ends: 140 [2018-12-09 11:40:26,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:26,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-09 11:40:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-09 11:40:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-09 11:40:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 145 transitions. [2018-12-09 11:40:26,097 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 145 transitions. Word has length 7 [2018-12-09 11:40:26,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:26,098 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 145 transitions. [2018-12-09 11:40:26,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:40:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 145 transitions. [2018-12-09 11:40:26,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 11:40:26,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:26,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:26,098 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:26,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:26,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1110148732, now seen corresponding path program 1 times [2018-12-09 11:40:26,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:26,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:26,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:26,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:26,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:26,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:26,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 11:40:26,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:40:26,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:40:26,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:26,123 INFO L87 Difference]: Start difference. First operand 140 states and 145 transitions. Second operand 3 states. [2018-12-09 11:40:26,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:26,199 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2018-12-09 11:40:26,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:40:26,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 11:40:26,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:26,200 INFO L225 Difference]: With dead ends: 139 [2018-12-09 11:40:26,200 INFO L226 Difference]: Without dead ends: 139 [2018-12-09 11:40:26,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-09 11:40:26,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-12-09 11:40:26,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-09 11:40:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2018-12-09 11:40:26,205 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 11 [2018-12-09 11:40:26,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:26,205 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-12-09 11:40:26,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:40:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-12-09 11:40:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 11:40:26,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:26,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:26,206 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:26,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1110148731, now seen corresponding path program 1 times [2018-12-09 11:40:26,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:26,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:26,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:26,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:26,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:26,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:26,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 11:40:26,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:40:26,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:40:26,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:26,231 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 3 states. [2018-12-09 11:40:26,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:26,300 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2018-12-09 11:40:26,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:40:26,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 11:40:26,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:26,301 INFO L225 Difference]: With dead ends: 148 [2018-12-09 11:40:26,301 INFO L226 Difference]: Without dead ends: 148 [2018-12-09 11:40:26,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-09 11:40:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2018-12-09 11:40:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-09 11:40:26,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2018-12-09 11:40:26,305 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 11 [2018-12-09 11:40:26,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:26,305 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-12-09 11:40:26,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:40:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2018-12-09 11:40:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 11:40:26,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:26,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:26,306 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:26,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:26,306 INFO L82 PathProgramCache]: Analyzing trace with hash 252296525, now seen corresponding path program 1 times [2018-12-09 11:40:26,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:26,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:26,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:26,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:26,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:26,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:26,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:40:26,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:40:26,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:40:26,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:40:26,349 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 4 states. [2018-12-09 11:40:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:26,460 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-12-09 11:40:26,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:40:26,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-09 11:40:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:26,461 INFO L225 Difference]: With dead ends: 140 [2018-12-09 11:40:26,461 INFO L226 Difference]: Without dead ends: 140 [2018-12-09 11:40:26,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:26,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-09 11:40:26,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2018-12-09 11:40:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-09 11:40:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-12-09 11:40:26,465 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 17 [2018-12-09 11:40:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:26,465 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-12-09 11:40:26,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:40:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-12-09 11:40:26,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 11:40:26,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:26,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:26,466 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:26,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:26,466 INFO L82 PathProgramCache]: Analyzing trace with hash 252296526, now seen corresponding path program 1 times [2018-12-09 11:40:26,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:26,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:26,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:26,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:26,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:26,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:26,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:40:26,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:40:26,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:40:26,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:40:26,530 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 6 states. [2018-12-09 11:40:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:26,702 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2018-12-09 11:40:26,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:40:26,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-09 11:40:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:26,703 INFO L225 Difference]: With dead ends: 160 [2018-12-09 11:40:26,703 INFO L226 Difference]: Without dead ends: 160 [2018-12-09 11:40:26,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:40:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-09 11:40:26,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2018-12-09 11:40:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-09 11:40:26,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2018-12-09 11:40:26,707 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 17 [2018-12-09 11:40:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:26,707 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2018-12-09 11:40:26,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:40:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2018-12-09 11:40:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 11:40:26,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:26,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:26,708 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:26,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:26,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1938792144, now seen corresponding path program 1 times [2018-12-09 11:40:26,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:26,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:26,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:26,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:26,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:26,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:26,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:40:26,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:40:26,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:40:26,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:26,743 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 5 states. [2018-12-09 11:40:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:26,886 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2018-12-09 11:40:26,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:40:26,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-09 11:40:26,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:26,888 INFO L225 Difference]: With dead ends: 177 [2018-12-09 11:40:26,888 INFO L226 Difference]: Without dead ends: 177 [2018-12-09 11:40:26,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:40:26,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-09 11:40:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 134. [2018-12-09 11:40:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-09 11:40:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-12-09 11:40:26,891 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 19 [2018-12-09 11:40:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:26,891 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-12-09 11:40:26,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:40:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-12-09 11:40:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 11:40:26,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:26,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:26,892 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:26,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:26,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1938792145, now seen corresponding path program 1 times [2018-12-09 11:40:26,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:26,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:26,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:26,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:26,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:26,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:26,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:40:26,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:40:26,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:40:26,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:26,951 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 5 states. [2018-12-09 11:40:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:27,153 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-12-09 11:40:27,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:40:27,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-09 11:40:27,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:27,154 INFO L225 Difference]: With dead ends: 198 [2018-12-09 11:40:27,154 INFO L226 Difference]: Without dead ends: 198 [2018-12-09 11:40:27,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:40:27,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-09 11:40:27,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 133. [2018-12-09 11:40:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-09 11:40:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2018-12-09 11:40:27,157 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 19 [2018-12-09 11:40:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:27,157 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-12-09 11:40:27,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:40:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2018-12-09 11:40:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 11:40:27,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:27,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:27,158 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:27,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:27,159 INFO L82 PathProgramCache]: Analyzing trace with hash -771138030, now seen corresponding path program 1 times [2018-12-09 11:40:27,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:27,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:27,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:27,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:27,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:27,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:27,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 11:40:27,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 11:40:27,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 11:40:27,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:40:27,250 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 9 states. [2018-12-09 11:40:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:27,522 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-12-09 11:40:27,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:40:27,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-09 11:40:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:27,522 INFO L225 Difference]: With dead ends: 145 [2018-12-09 11:40:27,522 INFO L226 Difference]: Without dead ends: 145 [2018-12-09 11:40:27,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-12-09 11:40:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-09 11:40:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2018-12-09 11:40:27,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-09 11:40:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-12-09 11:40:27,525 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 23 [2018-12-09 11:40:27,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:27,525 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-12-09 11:40:27,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 11:40:27,525 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-12-09 11:40:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 11:40:27,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:27,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:27,526 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:27,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:27,526 INFO L82 PathProgramCache]: Analyzing trace with hash -771138029, now seen corresponding path program 1 times [2018-12-09 11:40:27,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:27,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:27,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:27,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:27,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:27,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:27,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 11:40:27,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 11:40:27,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 11:40:27,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:40:27,641 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 10 states. [2018-12-09 11:40:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:28,050 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-12-09 11:40:28,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 11:40:28,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-09 11:40:28,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:28,051 INFO L225 Difference]: With dead ends: 156 [2018-12-09 11:40:28,051 INFO L226 Difference]: Without dead ends: 156 [2018-12-09 11:40:28,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-12-09 11:40:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-09 11:40:28,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2018-12-09 11:40:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-09 11:40:28,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-12-09 11:40:28,054 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 23 [2018-12-09 11:40:28,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:28,055 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-12-09 11:40:28,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 11:40:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-12-09 11:40:28,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 11:40:28,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:28,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:28,056 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:28,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:28,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1856557850, now seen corresponding path program 1 times [2018-12-09 11:40:28,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:28,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:28,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:28,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:28,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:28,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:28,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:40:28,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:40:28,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:40:28,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:40:28,087 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 6 states. [2018-12-09 11:40:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:28,215 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-12-09 11:40:28,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:40:28,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-09 11:40:28,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:28,216 INFO L225 Difference]: With dead ends: 159 [2018-12-09 11:40:28,216 INFO L226 Difference]: Without dead ends: 159 [2018-12-09 11:40:28,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:40:28,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-09 11:40:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2018-12-09 11:40:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-09 11:40:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-12-09 11:40:28,219 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 26 [2018-12-09 11:40:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:28,219 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-12-09 11:40:28,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:40:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-12-09 11:40:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 11:40:28,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:28,220 INFO L402 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] [2018-12-09 11:40:28,220 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:28,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:28,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1909518208, now seen corresponding path program 1 times [2018-12-09 11:40:28,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:28,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:28,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:28,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:28,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:28,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:40:28,283 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:40:28,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:28,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:28,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 11:40:28,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:28,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:28,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-12-09 11:40:28,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:28,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:28,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:28,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:28,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:28,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-09 11:40:28,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 11:40:28,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:28,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 11:40:28,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:28,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:28,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:28,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-12-09 11:40:28,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-09 11:40:28,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:28,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:28,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:28,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-09 11:40:28,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:28,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:28,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:28,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-12-09 11:40:28,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-12-09 11:40:28,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-12-09 11:40:28,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:28,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:28,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:28,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:15 [2018-12-09 11:40:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:28,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:40:28,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 15 [2018-12-09 11:40:28,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 11:40:28,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 11:40:28,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-12-09 11:40:28,595 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 15 states. [2018-12-09 11:40:29,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:29,386 INFO L93 Difference]: Finished difference Result 201 states and 214 transitions. [2018-12-09 11:40:29,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 11:40:29,386 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-12-09 11:40:29,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:29,388 INFO L225 Difference]: With dead ends: 201 [2018-12-09 11:40:29,388 INFO L226 Difference]: Without dead ends: 201 [2018-12-09 11:40:29,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2018-12-09 11:40:29,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-09 11:40:29,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 148. [2018-12-09 11:40:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-09 11:40:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-12-09 11:40:29,391 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 29 [2018-12-09 11:40:29,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:29,391 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-12-09 11:40:29,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 11:40:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-12-09 11:40:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 11:40:29,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:29,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:29,393 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:29,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:29,393 INFO L82 PathProgramCache]: Analyzing trace with hash -778956281, now seen corresponding path program 1 times [2018-12-09 11:40:29,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:29,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:29,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:29,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:29,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:29,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:29,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:40:29,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:40:29,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:40:29,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:29,424 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand 5 states. [2018-12-09 11:40:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:29,561 INFO L93 Difference]: Finished difference Result 212 states and 229 transitions. [2018-12-09 11:40:29,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:40:29,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-09 11:40:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:29,562 INFO L225 Difference]: With dead ends: 212 [2018-12-09 11:40:29,562 INFO L226 Difference]: Without dead ends: 212 [2018-12-09 11:40:29,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:40:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-09 11:40:29,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 147. [2018-12-09 11:40:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-09 11:40:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2018-12-09 11:40:29,565 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 30 [2018-12-09 11:40:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:29,565 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2018-12-09 11:40:29,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:40:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2018-12-09 11:40:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 11:40:29,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:29,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:29,565 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:29,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:29,566 INFO L82 PathProgramCache]: Analyzing trace with hash -778956280, now seen corresponding path program 1 times [2018-12-09 11:40:29,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:29,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:29,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:29,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:29,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:29,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:29,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:40:29,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:40:29,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:40:29,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:29,597 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 5 states. [2018-12-09 11:40:29,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:29,755 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-12-09 11:40:29,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:40:29,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-09 11:40:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:29,756 INFO L225 Difference]: With dead ends: 233 [2018-12-09 11:40:29,756 INFO L226 Difference]: Without dead ends: 233 [2018-12-09 11:40:29,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:40:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-12-09 11:40:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 146. [2018-12-09 11:40:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-09 11:40:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2018-12-09 11:40:29,759 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 30 [2018-12-09 11:40:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:29,759 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2018-12-09 11:40:29,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:40:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2018-12-09 11:40:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 11:40:29,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:29,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:29,760 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:29,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2118711400, now seen corresponding path program 1 times [2018-12-09 11:40:29,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:29,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:29,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:29,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:29,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:40:29,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:40:29,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:40:29,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:29,809 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 5 states. [2018-12-09 11:40:29,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:29,921 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-12-09 11:40:29,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:40:29,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-09 11:40:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:29,922 INFO L225 Difference]: With dead ends: 149 [2018-12-09 11:40:29,922 INFO L226 Difference]: Without dead ends: 149 [2018-12-09 11:40:29,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:40:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-09 11:40:29,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2018-12-09 11:40:29,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-09 11:40:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-12-09 11:40:29,925 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 30 [2018-12-09 11:40:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:29,925 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-12-09 11:40:29,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:40:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-12-09 11:40:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 11:40:29,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:29,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:29,926 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:29,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:29,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1095967582, now seen corresponding path program 1 times [2018-12-09 11:40:29,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:29,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:29,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:29,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:29,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 11:40:29,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:29,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:40:29,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:40:29,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:40:29,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:40:29,962 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 6 states. [2018-12-09 11:40:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:30,057 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2018-12-09 11:40:30,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:40:30,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-09 11:40:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:30,058 INFO L225 Difference]: With dead ends: 158 [2018-12-09 11:40:30,058 INFO L226 Difference]: Without dead ends: 158 [2018-12-09 11:40:30,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:40:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-09 11:40:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 145. [2018-12-09 11:40:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-09 11:40:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2018-12-09 11:40:30,060 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 31 [2018-12-09 11:40:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:30,060 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2018-12-09 11:40:30,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:40:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-12-09 11:40:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 11:40:30,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:30,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:30,061 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:30,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1230015159, now seen corresponding path program 1 times [2018-12-09 11:40:30,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:30,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:30,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:30,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:30,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:30,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:30,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 11:40:30,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 11:40:30,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 11:40:30,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-09 11:40:30,170 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 12 states. [2018-12-09 11:40:30,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:30,473 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-12-09 11:40:30,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 11:40:30,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-12-09 11:40:30,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:30,473 INFO L225 Difference]: With dead ends: 144 [2018-12-09 11:40:30,473 INFO L226 Difference]: Without dead ends: 144 [2018-12-09 11:40:30,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-12-09 11:40:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-09 11:40:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-09 11:40:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-09 11:40:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2018-12-09 11:40:30,475 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 34 [2018-12-09 11:40:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:30,475 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2018-12-09 11:40:30,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 11:40:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-12-09 11:40:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 11:40:30,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:30,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:30,476 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:30,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:30,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1230015158, now seen corresponding path program 1 times [2018-12-09 11:40:30,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:30,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:30,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:30,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:30,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 11:40:30,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 11:40:30,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 11:40:30,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:40:30,561 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 9 states. [2018-12-09 11:40:30,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:30,974 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-12-09 11:40:30,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:40:30,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-12-09 11:40:30,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:30,976 INFO L225 Difference]: With dead ends: 140 [2018-12-09 11:40:30,976 INFO L226 Difference]: Without dead ends: 140 [2018-12-09 11:40:30,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-09 11:40:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-09 11:40:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2018-12-09 11:40:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 11:40:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-12-09 11:40:30,980 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 34 [2018-12-09 11:40:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:30,980 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-12-09 11:40:30,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 11:40:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-12-09 11:40:30,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 11:40:30,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:30,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:30,982 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:30,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:30,982 INFO L82 PathProgramCache]: Analyzing trace with hash 701473530, now seen corresponding path program 1 times [2018-12-09 11:40:30,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:30,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:30,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:30,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:30,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:31,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:40:31,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:40:31,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:31,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:31,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 11:40:31,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 11:40:31,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:31,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:31,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:31,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 11:40:31,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 11:40:31,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-09 11:40:31,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:31,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:31,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:31,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-09 11:40:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 11:40:31,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 11:40:31,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2018-12-09 11:40:31,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 11:40:31,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 11:40:31,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:40:31,113 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 9 states. [2018-12-09 11:40:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:31,301 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2018-12-09 11:40:31,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 11:40:31,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-12-09 11:40:31,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:31,302 INFO L225 Difference]: With dead ends: 143 [2018-12-09 11:40:31,302 INFO L226 Difference]: Without dead ends: 143 [2018-12-09 11:40:31,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-09 11:40:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-09 11:40:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 119. [2018-12-09 11:40:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-09 11:40:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2018-12-09 11:40:31,305 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 36 [2018-12-09 11:40:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:31,305 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2018-12-09 11:40:31,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 11:40:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-12-09 11:40:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 11:40:31,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:31,306 INFO L402 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] [2018-12-09 11:40:31,306 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:31,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:31,307 INFO L82 PathProgramCache]: Analyzing trace with hash -401458596, now seen corresponding path program 1 times [2018-12-09 11:40:31,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:31,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:31,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:31,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:31,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:31,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:40:31,393 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:40:31,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:31,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:31,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 11:40:31,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 11:40:31,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:31,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:31,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 11:40:31,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 11:40:31,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:31,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:31,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:31,481 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2018-12-09 11:40:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:31,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:40:31,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-12-09 11:40:31,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 11:40:31,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 11:40:31,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-09 11:40:31,523 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand 14 states. [2018-12-09 11:40:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:31,841 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2018-12-09 11:40:31,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 11:40:31,841 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-12-09 11:40:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:31,841 INFO L225 Difference]: With dead ends: 148 [2018-12-09 11:40:31,841 INFO L226 Difference]: Without dead ends: 148 [2018-12-09 11:40:31,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-12-09 11:40:31,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-09 11:40:31,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 129. [2018-12-09 11:40:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-09 11:40:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2018-12-09 11:40:31,843 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 37 [2018-12-09 11:40:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:31,843 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2018-12-09 11:40:31,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 11:40:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-12-09 11:40:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 11:40:31,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:31,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:31,844 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION]=== [2018-12-09 11:40:31,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:31,844 INFO L82 PathProgramCache]: Analyzing trace with hash 439684856, now seen corresponding path program 1 times [2018-12-09 11:40:31,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:40:31,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:40:31,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:31,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:31,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:40:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:40:31,867 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 11:40:31,877 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 11:40:31,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:40:31 BoogieIcfgContainer [2018-12-09 11:40:31,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 11:40:31,888 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:40:31,888 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:40:31,888 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:40:31,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:40:25" (3/4) ... [2018-12-09 11:40:31,891 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 11:40:31,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:40:31,892 INFO L168 Benchmark]: Toolchain (without parser) took 6917.89 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 956.0 MB in the beginning and 967.4 MB in the end (delta: -11.4 MB). Peak memory consumption was 213.0 MB. Max. memory is 11.5 GB. [2018-12-09 11:40:31,893 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:40:31,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 61.3 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -88.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-09 11:40:31,893 INFO L168 Benchmark]: Boogie Preprocessor took 42.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2018-12-09 11:40:31,893 INFO L168 Benchmark]: RCFGBuilder took 371.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 972.7 MB in the end (delta: 70.0 MB). Peak memory consumption was 70.0 MB. Max. memory is 11.5 GB. [2018-12-09 11:40:31,894 INFO L168 Benchmark]: TraceAbstraction took 6233.46 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 163.1 MB). Free memory was 972.7 MB in the beginning and 967.4 MB in the end (delta: 5.3 MB). Peak memory consumption was 168.4 MB. Max. memory is 11.5 GB. [2018-12-09 11:40:31,894 INFO L168 Benchmark]: Witness Printer took 3.13 ms. Allocated memory is still 1.3 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:40:31,895 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 61.3 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -88.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 371.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 972.7 MB in the end (delta: 70.0 MB). Peak memory consumption was 70.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6233.46 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 163.1 MB). Free memory was 972.7 MB in the beginning and 967.4 MB in the end (delta: 5.3 MB). Peak memory consumption was 168.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.13 ms. Allocated memory is still 1.3 GB. Free memory is still 967.4 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))={20:0}, null={20:0}] [L988] null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L989] null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L990] null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L993] list->next = null VAL [list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L994] list->prev = null VAL [list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L995] list->colour = BLACK VAL [list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L997] struct TSLL* end = list; VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1031] EXPR end->colour VAL [end={19:0}, end->colour=1, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1034] EXPR end->colour VAL [end={19:0}, end->colour=1, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next VAL [end={19:0}, end->next={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1045] COND TRUE null != list VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1047] EXPR list->colour VAL [end={20:0}, list={19:0}, list->colour=1, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next VAL [end={20:0}, list={19:0}, list->next={20:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1056] end = list->next [L1057] free(list) VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1057] free(list) [L1058] list = end VAL [end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1045] COND FALSE !(null != list) VAL [end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1062] return 0; VAL [\result=0, end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 149 locations, 67 error locations. UNSAFE Result, 6.1s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1675 SDtfs, 3225 SDslu, 3503 SDs, 0 SdLazy, 5632 SolverSat, 309 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 111 SyntacticMatches, 13 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 527 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 611 NumberOfCodeBlocks, 611 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 550 ConstructedInterpolants, 3 QuantifiedInterpolants, 107179 SizeOfPredicates, 27 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 5/13 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 11:40:33,143 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:40:33,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:40:33,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:40:33,150 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:40:33,151 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:40:33,151 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:40:33,152 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:40:33,153 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:40:33,153 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:40:33,154 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:40:33,154 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:40:33,154 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:40:33,155 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:40:33,155 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:40:33,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:40:33,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:40:33,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:40:33,157 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:40:33,158 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:40:33,159 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:40:33,159 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:40:33,160 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:40:33,160 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:40:33,161 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:40:33,161 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:40:33,162 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:40:33,162 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:40:33,162 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:40:33,163 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:40:33,163 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:40:33,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:40:33,163 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:40:33,164 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:40:33,164 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:40:33,164 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:40:33,164 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-09 11:40:33,172 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:40:33,172 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:40:33,172 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 11:40:33,172 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 11:40:33,173 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 11:40:33,173 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 11:40:33,173 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 11:40:33,173 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:40:33,173 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:40:33,173 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 11:40:33,173 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:40:33,173 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:40:33,174 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:40:33,174 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 11:40:33,174 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 11:40:33,174 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 11:40:33,174 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 11:40:33,174 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 11:40:33,174 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 11:40:33,174 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:40:33,174 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 11:40:33,174 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:40:33,174 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:40:33,175 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 11:40:33,175 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 11:40:33,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:40:33,175 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:40:33,175 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 11:40:33,175 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-09 11:40:33,175 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 11:40:33,175 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 11:40:33,175 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-12-09 11:40:33,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:40:33,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:40:33,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:40:33,207 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:40:33,207 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:40:33,207 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-09 11:40:33,245 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/data/c8545fc89/0f9d77b735a04bb3986e28becd817872/FLAG631194a6f [2018-12-09 11:40:33,606 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:40:33,606 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-09 11:40:33,612 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/data/c8545fc89/0f9d77b735a04bb3986e28becd817872/FLAG631194a6f [2018-12-09 11:40:33,620 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/data/c8545fc89/0f9d77b735a04bb3986e28becd817872 [2018-12-09 11:40:33,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:40:33,623 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 11:40:33,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:40:33,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:40:33,625 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:40:33,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:40:33" (1/1) ... [2018-12-09 11:40:33,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@197102f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:33, skipping insertion in model container [2018-12-09 11:40:33,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:40:33" (1/1) ... [2018-12-09 11:40:33,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:40:33,650 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:40:33,811 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:40:33,820 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:40:33,854 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:40:33,919 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:40:33,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:33 WrapperNode [2018-12-09 11:40:33,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:40:33,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:40:33,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:40:33,920 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:40:33,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:33" (1/1) ... [2018-12-09 11:40:33,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:33" (1/1) ... [2018-12-09 11:40:33,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:33" (1/1) ... [2018-12-09 11:40:33,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:33" (1/1) ... [2018-12-09 11:40:33,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:33" (1/1) ... [2018-12-09 11:40:33,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:33" (1/1) ... [2018-12-09 11:40:33,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:33" (1/1) ... [2018-12-09 11:40:33,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:40:33,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:40:33,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:40:33,959 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:40:33,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:40:33,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 11:40:33,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:40:33,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 11:40:33,989 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 11:40:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 11:40:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 11:40:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 11:40:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 11:40:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 11:40:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 11:40:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 11:40:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 11:40:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 11:40:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 11:40:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 11:40:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 11:40:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 11:40:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 11:40:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 11:40:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 11:40:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 11:40:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 11:40:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 11:40:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 11:40:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 11:40:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 11:40:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 11:40:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 11:40:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 11:40:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 11:40:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 11:40:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 11:40:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 11:40:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 11:40:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-09 11:40:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 11:40:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 11:40:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-09 11:40:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 11:40:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 11:40:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 11:40:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 11:40:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 11:40:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 11:40:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 11:40:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 11:40:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 11:40:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 11:40:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 11:40:33,995 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-09 11:40:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 11:40:33,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 11:40:33,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 11:40:33,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 11:40:33,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:40:34,492 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:40:34,492 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-09 11:40:34,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:40:34 BoogieIcfgContainer [2018-12-09 11:40:34,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:40:34,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 11:40:34,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 11:40:34,495 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 11:40:34,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:40:33" (1/3) ... [2018-12-09 11:40:34,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9dad47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:40:34, skipping insertion in model container [2018-12-09 11:40:34,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:40:33" (2/3) ... [2018-12-09 11:40:34,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9dad47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:40:34, skipping insertion in model container [2018-12-09 11:40:34,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:40:34" (3/3) ... [2018-12-09 11:40:34,497 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-09 11:40:34,503 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 11:40:34,508 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-12-09 11:40:34,517 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-12-09 11:40:34,531 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 11:40:34,532 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 11:40:34,532 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 11:40:34,532 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 11:40:34,532 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:40:34,532 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:40:34,532 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 11:40:34,532 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:40:34,533 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 11:40:34,542 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2018-12-09 11:40:34,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 11:40:34,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:34,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:34,549 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:34,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:34,553 INFO L82 PathProgramCache]: Analyzing trace with hash -487060290, now seen corresponding path program 1 times [2018-12-09 11:40:34,555 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:34,555 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:34,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:34,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:34,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 11:40:34,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:34,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:34,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 11:40:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:34,642 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:34,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:34,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 11:40:34,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:40:34,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:40:34,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:34,657 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 3 states. [2018-12-09 11:40:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:34,925 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2018-12-09 11:40:34,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:40:34,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-09 11:40:34,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:34,932 INFO L225 Difference]: With dead ends: 169 [2018-12-09 11:40:34,932 INFO L226 Difference]: Without dead ends: 165 [2018-12-09 11:40:34,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-09 11:40:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 141. [2018-12-09 11:40:34,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-09 11:40:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2018-12-09 11:40:34,958 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 7 [2018-12-09 11:40:34,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:34,958 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2018-12-09 11:40:34,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:40:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2018-12-09 11:40:34,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 11:40:34,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:34,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:34,959 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:34,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:34,959 INFO L82 PathProgramCache]: Analyzing trace with hash -487060289, now seen corresponding path program 1 times [2018-12-09 11:40:34,959 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:34,960 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:34,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:34,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:34,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 11:40:34,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:34,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:34,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 11:40:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:35,006 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:35,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:35,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 11:40:35,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:40:35,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:40:35,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:35,008 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand 3 states. [2018-12-09 11:40:35,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:35,271 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2018-12-09 11:40:35,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:40:35,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-09 11:40:35,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:35,274 INFO L225 Difference]: With dead ends: 138 [2018-12-09 11:40:35,274 INFO L226 Difference]: Without dead ends: 138 [2018-12-09 11:40:35,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:35,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-09 11:40:35,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-09 11:40:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-09 11:40:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2018-12-09 11:40:35,280 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 7 [2018-12-09 11:40:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:35,280 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2018-12-09 11:40:35,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:40:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2018-12-09 11:40:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 11:40:35,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:35,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:35,281 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:35,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:35,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1518093250, now seen corresponding path program 1 times [2018-12-09 11:40:35,282 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:35,282 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:35,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:35,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:35,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 11:40:35,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:35,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:35,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-09 11:40:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:35,347 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:35,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:35,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:40:35,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:40:35,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:40:35,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:40:35,349 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 4 states. [2018-12-09 11:40:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:35,559 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2018-12-09 11:40:35,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:40:35,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 11:40:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:35,560 INFO L225 Difference]: With dead ends: 137 [2018-12-09 11:40:35,560 INFO L226 Difference]: Without dead ends: 137 [2018-12-09 11:40:35,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:40:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-09 11:40:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-12-09 11:40:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-09 11:40:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2018-12-09 11:40:35,565 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 11 [2018-12-09 11:40:35,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:35,565 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2018-12-09 11:40:35,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:40:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2018-12-09 11:40:35,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 11:40:35,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:35,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:35,566 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:35,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:35,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1518093251, now seen corresponding path program 1 times [2018-12-09 11:40:35,566 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:35,566 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:35,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:35,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:35,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 11:40:35,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:35,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:35,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 11:40:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:35,626 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:35,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:35,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 11:40:35,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:40:35,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:40:35,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:35,628 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 3 states. [2018-12-09 11:40:35,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:35,882 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-12-09 11:40:35,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:40:35,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 11:40:35,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:35,884 INFO L225 Difference]: With dead ends: 146 [2018-12-09 11:40:35,884 INFO L226 Difference]: Without dead ends: 146 [2018-12-09 11:40:35,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-09 11:40:35,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2018-12-09 11:40:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-09 11:40:35,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-12-09 11:40:35,889 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 11 [2018-12-09 11:40:35,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:35,889 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-12-09 11:40:35,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:40:35,889 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-12-09 11:40:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 11:40:35,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:35,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:35,890 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:35,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:35,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1912036980, now seen corresponding path program 1 times [2018-12-09 11:40:35,890 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:35,891 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:35,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:35,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:35,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 11:40:35,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:35,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:35,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-09 11:40:36,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:36,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:36,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 11:40:36,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:36,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:36,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-12-09 11:40:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:36,038 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:36,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:36,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:40:36,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:40:36,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:40:36,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:40:36,040 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 6 states. [2018-12-09 11:40:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:36,450 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-12-09 11:40:36,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:40:36,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-09 11:40:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:36,451 INFO L225 Difference]: With dead ends: 138 [2018-12-09 11:40:36,451 INFO L226 Difference]: Without dead ends: 138 [2018-12-09 11:40:36,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:40:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-09 11:40:36,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2018-12-09 11:40:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-09 11:40:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2018-12-09 11:40:36,455 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 16 [2018-12-09 11:40:36,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:36,455 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2018-12-09 11:40:36,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:40:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-12-09 11:40:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 11:40:36,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:36,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:36,456 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:36,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:36,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1912036981, now seen corresponding path program 1 times [2018-12-09 11:40:36,456 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:36,456 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:36,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:36,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:36,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 11:40:36,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:36,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 11:40:36,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:36,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:36,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 11:40:36,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:36,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:36,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 11:40:36,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:36,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 11:40:36,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:36,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:36,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-09 11:40:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:36,613 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:36,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:36,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:40:36,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:40:36,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:40:36,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:36,616 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 5 states. [2018-12-09 11:40:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:37,282 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2018-12-09 11:40:37,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:40:37,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-09 11:40:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:37,283 INFO L225 Difference]: With dead ends: 153 [2018-12-09 11:40:37,284 INFO L226 Difference]: Without dead ends: 153 [2018-12-09 11:40:37,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:40:37,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-09 11:40:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2018-12-09 11:40:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-09 11:40:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2018-12-09 11:40:37,287 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 16 [2018-12-09 11:40:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:37,287 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2018-12-09 11:40:37,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:40:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2018-12-09 11:40:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 11:40:37,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:37,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:37,288 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:37,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:37,288 INFO L82 PathProgramCache]: Analyzing trace with hash -778464745, now seen corresponding path program 1 times [2018-12-09 11:40:37,288 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:37,288 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:37,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:37,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:37,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 11:40:37,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:37,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:37,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 11:40:37,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:37,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:37,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:37,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:37,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:37,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-12-09 11:40:37,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 11:40:37,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 11:40:37,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:37,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:37,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:37,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-12-09 11:40:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:37,409 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:37,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:37,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:40:37,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:40:37,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:40:37,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:37,411 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 5 states. [2018-12-09 11:40:37,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:37,866 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2018-12-09 11:40:37,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:40:37,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-09 11:40:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:37,867 INFO L225 Difference]: With dead ends: 174 [2018-12-09 11:40:37,867 INFO L226 Difference]: Without dead ends: 174 [2018-12-09 11:40:37,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:40:37,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-09 11:40:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2018-12-09 11:40:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-09 11:40:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-12-09 11:40:37,869 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 18 [2018-12-09 11:40:37,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:37,870 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-12-09 11:40:37,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:40:37,870 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-12-09 11:40:37,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 11:40:37,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:37,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:37,870 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:37,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:37,870 INFO L82 PathProgramCache]: Analyzing trace with hash -778464744, now seen corresponding path program 1 times [2018-12-09 11:40:37,871 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:37,871 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:37,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:37,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:37,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 11:40:37,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:37,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:37,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 11:40:37,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:37,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:37,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:37,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:37,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:37,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:37,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:37,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:37,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:37,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-09 11:40:38,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 11:40:38,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 11:40:38,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 11:40:38,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 11:40:38,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,023 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-12-09 11:40:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:38,031 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:38,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:38,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:40:38,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:40:38,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:40:38,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:38,034 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 5 states. [2018-12-09 11:40:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:38,660 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2018-12-09 11:40:38,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:40:38,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-09 11:40:38,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:38,662 INFO L225 Difference]: With dead ends: 195 [2018-12-09 11:40:38,662 INFO L226 Difference]: Without dead ends: 195 [2018-12-09 11:40:38,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:40:38,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-09 11:40:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 130. [2018-12-09 11:40:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-09 11:40:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2018-12-09 11:40:38,666 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 18 [2018-12-09 11:40:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:38,666 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-12-09 11:40:38,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:40:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-12-09 11:40:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 11:40:38,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:38,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:38,667 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:38,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:38,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1741282714, now seen corresponding path program 1 times [2018-12-09 11:40:38,668 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:38,668 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:38,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:38,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:38,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 11:40:38,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 11:40:38,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:38,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:38,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 11:40:38,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 11:40:38,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-12-09 11:40:38,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:38,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:38,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:38,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:38,900 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-12-09 11:40:38,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 11:40:38,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 11:40:38,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:38,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:39,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-12-09 11:40:39,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 11:40:39,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:39,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:39,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:39,052 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-12-09 11:40:39,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-09 11:40:39,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 11:40:39,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:39,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 11:40:39,110 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:39,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:39,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-12-09 11:40:39,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 11:40:39,136 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:39,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-09 11:40:39,147 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:39,153 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:39,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:39,158 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-12-09 11:40:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:39,189 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:39,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:39,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 11:40:39,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 11:40:39,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 11:40:39,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:40:39,191 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 10 states. [2018-12-09 11:40:40,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:40,885 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2018-12-09 11:40:40,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 11:40:40,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-09 11:40:40,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:40,886 INFO L225 Difference]: With dead ends: 153 [2018-12-09 11:40:40,886 INFO L226 Difference]: Without dead ends: 153 [2018-12-09 11:40:40,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2018-12-09 11:40:40,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-09 11:40:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2018-12-09 11:40:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-09 11:40:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-12-09 11:40:40,888 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 22 [2018-12-09 11:40:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:40,888 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-12-09 11:40:40,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 11:40:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-12-09 11:40:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 11:40:40,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:40,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:40,889 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:40,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:40,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1741282713, now seen corresponding path program 1 times [2018-12-09 11:40:40,890 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:40,890 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:40,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:40,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:40,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 11:40:40,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:40,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:40,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-09 11:40:41,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:41,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:41,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 11:40:41,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:41,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:41,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-09 11:40:41,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:41,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:41,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:41,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:41,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:41,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-12-09 11:40:41,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-09 11:40:41,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 11:40:41,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:41,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:41,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:41,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-09 11:40:41,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-12-09 11:40:41,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 11:40:41,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:41,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-09 11:40:41,157 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:41,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:41,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:41,166 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-12-09 11:40:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:41,207 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:41,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:41,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 11:40:41,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 11:40:41,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 11:40:41,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 11:40:41,209 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 11 states. [2018-12-09 11:40:42,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:42,284 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2018-12-09 11:40:42,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 11:40:42,285 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-12-09 11:40:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:42,285 INFO L225 Difference]: With dead ends: 168 [2018-12-09 11:40:42,285 INFO L226 Difference]: Without dead ends: 168 [2018-12-09 11:40:42,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2018-12-09 11:40:42,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-09 11:40:42,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 131. [2018-12-09 11:40:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-09 11:40:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2018-12-09 11:40:42,287 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 22 [2018-12-09 11:40:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:42,287 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2018-12-09 11:40:42,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 11:40:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2018-12-09 11:40:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 11:40:42,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:42,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:42,288 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:42,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:42,288 INFO L82 PathProgramCache]: Analyzing trace with hash 913766270, now seen corresponding path program 1 times [2018-12-09 11:40:42,289 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:42,289 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:42,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:42,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:42,344 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:42,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:42,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:40:42,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:40:42,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:40:42,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:42,346 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand 3 states. [2018-12-09 11:40:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:42,517 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-12-09 11:40:42,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:40:42,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 11:40:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:42,519 INFO L225 Difference]: With dead ends: 139 [2018-12-09 11:40:42,519 INFO L226 Difference]: Without dead ends: 139 [2018-12-09 11:40:42,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-09 11:40:42,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2018-12-09 11:40:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-09 11:40:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-12-09 11:40:42,522 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 25 [2018-12-09 11:40:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:42,522 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-12-09 11:40:42,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:40:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-12-09 11:40:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 11:40:42,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:42,523 INFO L402 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] [2018-12-09 11:40:42,523 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:42,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:42,524 INFO L82 PathProgramCache]: Analyzing trace with hash 543815206, now seen corresponding path program 1 times [2018-12-09 11:40:42,524 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:42,524 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:42,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:42,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:42,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 11:40:42,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:42,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:42,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 11:40:42,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 11:40:42,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:42,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:42,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-09 11:40:42,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:42,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:42,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:42,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:42,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:42,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-09 11:40:42,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 11:40:42,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:42,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-12-09 11:40:42,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:42,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:42,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:42,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-12-09 11:40:42,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-12-09 11:40:42,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:42,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:42,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:42,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 45 [2018-12-09 11:40:42,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:42,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:42,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:42,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-12-09 11:40:42,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-12-09 11:40:42,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-09 11:40:42,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:42,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:42,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:42,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:11 [2018-12-09 11:40:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:42,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:40:42,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:42,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:42,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:42,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:16 [2018-12-09 11:40:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:42,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:40:42,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-12-09 11:40:42,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 11:40:42,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 11:40:42,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-09 11:40:42,853 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 11 states. [2018-12-09 11:40:44,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:44,058 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2018-12-09 11:40:44,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 11:40:44,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-12-09 11:40:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:44,060 INFO L225 Difference]: With dead ends: 186 [2018-12-09 11:40:44,060 INFO L226 Difference]: Without dead ends: 186 [2018-12-09 11:40:44,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-12-09 11:40:44,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-09 11:40:44,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 145. [2018-12-09 11:40:44,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-09 11:40:44,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-12-09 11:40:44,063 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 28 [2018-12-09 11:40:44,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:44,064 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-12-09 11:40:44,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 11:40:44,064 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-12-09 11:40:44,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 11:40:44,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:44,064 INFO L402 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] [2018-12-09 11:40:44,065 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:44,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:44,065 INFO L82 PathProgramCache]: Analyzing trace with hash 543815207, now seen corresponding path program 1 times [2018-12-09 11:40:44,065 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:44,065 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:44,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:44,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:44,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:44,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:44,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:44,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:44,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,204 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-12-09 11:40:44,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 11:40:44,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:44,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 11:40:44,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 11:40:44,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:44,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 11:40:44,267 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,287 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-09 11:40:44,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-09 11:40:44,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:44,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:44,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:44,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-09 11:40:44,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-09 11:40:44,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:44,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:44,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:44,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-09 11:40:44,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,424 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2018-12-09 11:40:44,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 11:40:44,452 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-12-09 11:40:44,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 11:40:44,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 11:40:44,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,480 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:10 [2018-12-09 11:40:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:44,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:40:44,573 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:44,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:44,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,677 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:44,688 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:44,706 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,708 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:44,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 11:40:44,713 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:97, output treesize:25 [2018-12-09 11:40:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:44,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:40:44,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-12-09 11:40:44,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 11:40:44,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 11:40:44,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-12-09 11:40:44,744 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 13 states. [2018-12-09 11:40:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:46,024 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2018-12-09 11:40:46,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 11:40:46,024 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-12-09 11:40:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:46,025 INFO L225 Difference]: With dead ends: 186 [2018-12-09 11:40:46,025 INFO L226 Difference]: Without dead ends: 186 [2018-12-09 11:40:46,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-12-09 11:40:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-09 11:40:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 144. [2018-12-09 11:40:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-09 11:40:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-12-09 11:40:46,027 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 28 [2018-12-09 11:40:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:46,028 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-12-09 11:40:46,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 11:40:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-12-09 11:40:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 11:40:46,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:46,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:46,028 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:46,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:46,029 INFO L82 PathProgramCache]: Analyzing trace with hash 967974238, now seen corresponding path program 1 times [2018-12-09 11:40:46,029 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:46,029 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:46,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:46,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:46,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 11:40:46,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 11:40:46,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:46,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:46,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-09 11:40:46,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 11:40:46,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 11:40:46,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 11:40:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:46,162 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:46,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:46,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:40:46,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:40:46,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:40:46,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:46,165 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 5 states. [2018-12-09 11:40:46,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:46,677 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2018-12-09 11:40:46,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:40:46,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-09 11:40:46,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:46,678 INFO L225 Difference]: With dead ends: 206 [2018-12-09 11:40:46,678 INFO L226 Difference]: Without dead ends: 206 [2018-12-09 11:40:46,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:40:46,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-09 11:40:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 143. [2018-12-09 11:40:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-09 11:40:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-12-09 11:40:46,682 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 28 [2018-12-09 11:40:46,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:46,683 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-12-09 11:40:46,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:40:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-12-09 11:40:46,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 11:40:46,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:46,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:46,683 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:46,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:46,684 INFO L82 PathProgramCache]: Analyzing trace with hash 967974239, now seen corresponding path program 1 times [2018-12-09 11:40:46,684 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:46,684 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:46,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:46,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:46,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 11:40:46,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 11:40:46,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:46,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:46,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:46,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:46,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,831 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-09 11:40:46,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 11:40:46,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 11:40:46,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 11:40:46,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 11:40:46,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:46,865 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-12-09 11:40:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:46,873 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:46,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:46,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:40:46,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:40:46,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:40:46,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:46,875 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 5 states. [2018-12-09 11:40:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:47,506 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2018-12-09 11:40:47,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:40:47,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-09 11:40:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:47,507 INFO L225 Difference]: With dead ends: 227 [2018-12-09 11:40:47,507 INFO L226 Difference]: Without dead ends: 227 [2018-12-09 11:40:47,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:40:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-09 11:40:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 142. [2018-12-09 11:40:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-09 11:40:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-12-09 11:40:47,510 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 28 [2018-12-09 11:40:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:47,511 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-12-09 11:40:47,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:40:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-12-09 11:40:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 11:40:47,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:47,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:47,512 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:47,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:47,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1505831504, now seen corresponding path program 1 times [2018-12-09 11:40:47,512 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:47,512 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:47,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:47,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:47,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 11:40:47,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-09 11:40:47,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:47,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:47,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:47,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-09 11:40:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:47,573 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:47,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:47,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:40:47,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:40:47,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:40:47,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:47,575 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 5 states. [2018-12-09 11:40:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:47,952 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-12-09 11:40:47,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:40:47,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-09 11:40:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:47,953 INFO L225 Difference]: With dead ends: 145 [2018-12-09 11:40:47,953 INFO L226 Difference]: Without dead ends: 145 [2018-12-09 11:40:47,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:40:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-09 11:40:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-12-09 11:40:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-09 11:40:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2018-12-09 11:40:47,956 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 29 [2018-12-09 11:40:47,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:47,956 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2018-12-09 11:40:47,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:40:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2018-12-09 11:40:47,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 11:40:47,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:47,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:47,957 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:47,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:47,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1379592124, now seen corresponding path program 1 times [2018-12-09 11:40:47,957 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:47,957 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:47,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:48,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:48,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 11:40:48,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 11:40:48,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:48,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:48,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 11:40:48,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-09 11:40:48,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-09 11:40:48,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 11:40:48,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:4 [2018-12-09 11:40:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 11:40:48,048 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:48,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:48,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:40:48,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:40:48,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:40:48,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:40:48,050 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 4 states. [2018-12-09 11:40:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:48,247 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-12-09 11:40:48,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:40:48,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-12-09 11:40:48,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:48,249 INFO L225 Difference]: With dead ends: 170 [2018-12-09 11:40:48,249 INFO L226 Difference]: Without dead ends: 170 [2018-12-09 11:40:48,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-09 11:40:48,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 141. [2018-12-09 11:40:48,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-09 11:40:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-12-09 11:40:48,251 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 30 [2018-12-09 11:40:48,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:48,252 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-12-09 11:40:48,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:40:48,252 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-12-09 11:40:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 11:40:48,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:48,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:48,253 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:48,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:48,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1365570400, now seen corresponding path program 1 times [2018-12-09 11:40:48,253 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:48,253 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:48,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:48,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:48,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 11:40:48,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:48,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-09 11:40:48,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:48,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:48,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 11:40:48,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-09 11:40:48,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:48,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:48,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-12-09 11:40:48,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-09 11:40:48,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 11:40:48,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:48,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-09 11:40:48,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-12-09 11:40:48,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-09 11:40:48,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 11:40:48,566 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:48,574 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-12-09 11:40:48,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:48,610 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 11:40:48,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2018-12-09 11:40:48,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:48,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:30 [2018-12-09 11:40:48,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:48,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-09 11:40:48,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:48,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:42 [2018-12-09 11:40:48,767 INFO L478 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 47 treesize of output 43 [2018-12-09 11:40:48,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 11:40:48,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:48,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-12-09 11:40:48,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 46 treesize of output 32 [2018-12-09 11:40:48,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-12-09 11:40:48,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 11:40:48,897 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:48,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:48,913 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:62, output treesize:30 [2018-12-09 11:40:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:49,082 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:49,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:49,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-09 11:40:49,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 11:40:49,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 11:40:49,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-12-09 11:40:49,085 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 17 states. [2018-12-09 11:40:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:53,792 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2018-12-09 11:40:53,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 11:40:53,793 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-09 11:40:53,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:53,793 INFO L225 Difference]: With dead ends: 172 [2018-12-09 11:40:53,793 INFO L226 Difference]: Without dead ends: 172 [2018-12-09 11:40:53,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=386, Invalid=1020, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 11:40:53,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-09 11:40:53,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2018-12-09 11:40:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-09 11:40:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-12-09 11:40:53,796 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 32 [2018-12-09 11:40:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:53,796 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-12-09 11:40:53,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 11:40:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-12-09 11:40:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 11:40:53,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:53,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:53,797 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:53,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:53,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1365570399, now seen corresponding path program 1 times [2018-12-09 11:40:53,798 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:53,798 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:53,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:54,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:54,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 11:40:54,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 11:40:54,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:54,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:54,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 11:40:54,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-09 11:40:54,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:54,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:54,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-12-09 11:40:54,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-09 11:40:54,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 11:40:54,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:54,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-09 11:40:54,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-12-09 11:40:54,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 11:40:54,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-09 11:40:54,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:54,174 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-12-09 11:40:54,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 11:40:54,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:40:54,226 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 11:40:54,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 11:40:54,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:13 [2018-12-09 11:40:54,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:54,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:54,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:40:54,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:40:54,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,294 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-12-09 11:40:54,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-12-09 11:40:54,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 11:40:54,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 11:40:54,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 11:40:54,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:40:54,440 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-12-09 11:40:54,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-09 11:40:54,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 11:40:54,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 11:40:54,503 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-12-09 11:40:54,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 11:40:54,528 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-09 11:40:54,536 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,540 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:54,545 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-12-09 11:40:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:54,589 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:54,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:54,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 11:40:54,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 11:40:54,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 11:40:54,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-12-09 11:40:54,592 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 16 states. [2018-12-09 11:40:56,022 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-12-09 11:40:56,318 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-12-09 11:40:57,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:57,355 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-12-09 11:40:57,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 11:40:57,356 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-12-09 11:40:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:57,356 INFO L225 Difference]: With dead ends: 145 [2018-12-09 11:40:57,356 INFO L226 Difference]: Without dead ends: 145 [2018-12-09 11:40:57,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=318, Invalid=1088, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 11:40:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-09 11:40:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 119. [2018-12-09 11:40:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-09 11:40:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-12-09 11:40:57,358 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 32 [2018-12-09 11:40:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:57,358 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-12-09 11:40:57,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 11:40:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-12-09 11:40:57,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 11:40:57,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:57,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:57,359 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:57,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:57,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1026314670, now seen corresponding path program 1 times [2018-12-09 11:40:57,359 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:57,359 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:57,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:57,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:57,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 11:40:57,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 11:40:57,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 11:40:57,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 11:40:57,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-09 11:40:57,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-09 11:40:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 11:40:57,463 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 11:40:57,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:57,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:40:57,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:40:57,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:40:57,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:40:57,466 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 4 states. [2018-12-09 11:40:57,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:57,654 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-12-09 11:40:57,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:40:57,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-09 11:40:57,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:57,655 INFO L225 Difference]: With dead ends: 127 [2018-12-09 11:40:57,655 INFO L226 Difference]: Without dead ends: 127 [2018-12-09 11:40:57,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-09 11:40:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-12-09 11:40:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 11:40:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-12-09 11:40:57,657 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 35 [2018-12-09 11:40:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:57,657 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-12-09 11:40:57,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:40:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-12-09 11:40:57,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 11:40:57,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:57,657 INFO L402 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] [2018-12-09 11:40:57,657 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:57,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:57,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1871682050, now seen corresponding path program 1 times [2018-12-09 11:40:57,658 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:57,658 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:57,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:57,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:40:57,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-09 11:40:57,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 11:40:57,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-09 11:40:57,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 11:40:57,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:3 [2018-12-09 11:40:57,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 11:40:57,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 11:40:57,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 11:40:57,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 11:40:57,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:40:57,836 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-09 11:40:57,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:57,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:40:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:57,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:40:57,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2018-12-09 11:40:57,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 11:40:57,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 11:40:57,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-12-09 11:40:57,978 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 14 states. [2018-12-09 11:40:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:59,302 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2018-12-09 11:40:59,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 11:40:59,303 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-12-09 11:40:59,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:59,303 INFO L225 Difference]: With dead ends: 173 [2018-12-09 11:40:59,304 INFO L226 Difference]: Without dead ends: 173 [2018-12-09 11:40:59,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-12-09 11:40:59,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-09 11:40:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 132. [2018-12-09 11:40:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-09 11:40:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2018-12-09 11:40:59,306 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 36 [2018-12-09 11:40:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:59,306 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2018-12-09 11:40:59,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 11:40:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2018-12-09 11:40:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 11:40:59,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:59,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:59,306 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-09 11:40:59,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:59,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2107399152, now seen corresponding path program 1 times [2018-12-09 11:40:59,307 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 11:40:59,307 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_165a8e73-71ed-4931-a177-32ab988adcc3/bin-2019/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 11:40:59,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:40:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:40:59,567 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 11:40:59,577 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 11:40:59,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:40:59 BoogieIcfgContainer [2018-12-09 11:40:59,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 11:40:59,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:40:59,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:40:59,588 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:40:59,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:40:34" (3/4) ... [2018-12-09 11:40:59,591 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 11:40:59,591 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:40:59,591 INFO L168 Benchmark]: Toolchain (without parser) took 25968.90 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 339.7 MB). Free memory was 936.7 MB in the beginning and 906.4 MB in the end (delta: 30.3 MB). Peak memory consumption was 370.0 MB. Max. memory is 11.5 GB. [2018-12-09 11:40:59,591 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:40:59,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:40:59,592 INFO L168 Benchmark]: Boogie Preprocessor took 38.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 11:40:59,592 INFO L168 Benchmark]: RCFGBuilder took 533.61 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: 68.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. [2018-12-09 11:40:59,592 INFO L168 Benchmark]: TraceAbstraction took 25094.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 906.4 MB in the end (delta: 154.0 MB). Peak memory consumption was 344.3 MB. Max. memory is 11.5 GB. [2018-12-09 11:40:59,592 INFO L168 Benchmark]: Witness Printer took 2.68 ms. Allocated memory is still 1.4 GB. Free memory is still 906.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:40:59,593 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 533.61 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: 68.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25094.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 906.4 MB in the end (delta: 154.0 MB). Peak memory consumption was 344.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.68 ms. Allocated memory is still 1.4 GB. Free memory is still 906.4 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={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L993] list->next = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L994] list->prev = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L995] list->colour = BLACK VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L997] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1: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))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1031] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1: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))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1034] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1: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))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1045] COND TRUE null != list VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1047] EXPR list->colour VAL [end={1:0}, list={-2:0}, list->colour=1, malloc(sizeof(struct TSLL))={-2: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={-2:0}, list->next={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1056] end = list->next [L1057] free(list) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1057] free(list) [L1058] list = end VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={-2: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))={-2: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))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 147 locations, 67 error locations. UNSAFE Result, 25.0s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 19.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1692 SDtfs, 3398 SDslu, 3328 SDs, 0 SdLazy, 5718 SolverSat, 348 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 654 GetRequests, 433 SyntacticMatches, 8 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 614 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 547 ConstructedInterpolants, 35 QuantifiedInterpolants, 122347 SizeOfPredicates, 149 NumberOfNonLiveVariables, 2271 ConjunctsInSsa, 199 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 6/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...