./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.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_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/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 3aee1e8d9b723b18f218b6c1185554e637930c5d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 16:24:11,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 16:24:11,726 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 16:24:11,732 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 16:24:11,733 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 16:24:11,733 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 16:24:11,734 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 16:24:11,735 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 16:24:11,735 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 16:24:11,736 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 16:24:11,736 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 16:24:11,737 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 16:24:11,737 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 16:24:11,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 16:24:11,738 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 16:24:11,738 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 16:24:11,739 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 16:24:11,740 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 16:24:11,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 16:24:11,741 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 16:24:11,742 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 16:24:11,742 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 16:24:11,744 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 16:24:11,744 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 16:24:11,744 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 16:24:11,744 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 16:24:11,745 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 16:24:11,745 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 16:24:11,746 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 16:24:11,746 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 16:24:11,746 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 16:24:11,747 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 16:24:11,747 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 16:24:11,747 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 16:24:11,748 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 16:24:11,748 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 16:24:11,748 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-01 16:24:11,755 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 16:24:11,755 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 16:24:11,756 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 16:24:11,756 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 16:24:11,756 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 16:24:11,756 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 16:24:11,756 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 16:24:11,757 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 16:24:11,757 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 16:24:11,757 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 16:24:11,757 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 16:24:11,757 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 16:24:11,757 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 16:24:11,757 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 16:24:11,757 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 16:24:11,758 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 16:24:11,758 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 16:24:11,758 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 16:24:11,758 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 16:24:11,758 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 16:24:11,758 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 16:24:11,758 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 16:24:11,759 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 16:24:11,759 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 16:24:11,759 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 16:24:11,759 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 16:24:11,759 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 16:24:11,759 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 16:24:11,759 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_657985f6-51c5-4566-ad6b-7247037ea331/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 -> 3aee1e8d9b723b18f218b6c1185554e637930c5d [2018-12-01 16:24:11,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 16:24:11,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 16:24:11,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 16:24:11,790 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 16:24:11,790 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 16:24:11,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-12-01 16:24:11,833 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/data/7e6384381/d51084bcbfc045cabff7b2eeca16395f/FLAG4fd8f5628 [2018-12-01 16:24:12,157 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 16:24:12,158 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-12-01 16:24:12,164 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/data/7e6384381/d51084bcbfc045cabff7b2eeca16395f/FLAG4fd8f5628 [2018-12-01 16:24:12,569 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/data/7e6384381/d51084bcbfc045cabff7b2eeca16395f [2018-12-01 16:24:12,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 16:24:12,573 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-01 16:24:12,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 16:24:12,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 16:24:12,576 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 16:24:12,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:24:12" (1/1) ... [2018-12-01 16:24:12,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:12, skipping insertion in model container [2018-12-01 16:24:12,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:24:12" (1/1) ... [2018-12-01 16:24:12,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 16:24:12,604 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 16:24:12,746 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:24:12,752 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 16:24:12,811 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:24:12,830 INFO L195 MainTranslator]: Completed translation [2018-12-01 16:24:12,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:12 WrapperNode [2018-12-01 16:24:12,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 16:24:12,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 16:24:12,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 16:24:12,831 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 16:24:12,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:12" (1/1) ... [2018-12-01 16:24:12,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:12" (1/1) ... [2018-12-01 16:24:12,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:12" (1/1) ... [2018-12-01 16:24:12,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:12" (1/1) ... [2018-12-01 16:24:12,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:12" (1/1) ... [2018-12-01 16:24:12,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:12" (1/1) ... [2018-12-01 16:24:12,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:12" (1/1) ... [2018-12-01 16:24:12,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 16:24:12,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 16:24:12,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 16:24:12,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 16:24:12,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/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-01 16:24:12,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 16:24:12,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 16:24:12,895 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 16:24:12,895 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-01 16:24:12,895 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-01 16:24:12,895 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-01 16:24:12,895 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-01 16:24:12,895 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-01 16:24:12,895 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-01 16:24:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-01 16:24:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-01 16:24:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-01 16:24:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-01 16:24:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-01 16:24:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-01 16:24:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-01 16:24:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-01 16:24:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-01 16:24:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-01 16:24:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-01 16:24:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-01 16:24:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-01 16:24:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-01 16:24:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-01 16:24:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-01 16:24:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-01 16:24:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-01 16:24:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-01 16:24:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-01 16:24:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-01 16:24:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-01 16:24:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-01 16:24:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-01 16:24:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-01 16:24:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-01 16:24:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-01 16:24:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-01 16:24:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-01 16:24:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-01 16:24:12,899 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-01 16:24:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-01 16:24:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-01 16:24:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-01 16:24:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-01 16:24:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-01 16:24:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-01 16:24:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-01 16:24:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-01 16:24:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-01 16:24:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-01 16:24:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-01 16:24:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-01 16:24:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-01 16:24:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-01 16:24:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-01 16:24:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-01 16:24:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-01 16:24:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-01 16:24:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-01 16:24:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-01 16:24:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-01 16:24:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-01 16:24:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-01 16:24:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-01 16:24:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-01 16:24:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-01 16:24:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-01 16:24:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-01 16:24:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-01 16:24:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-01 16:24:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-01 16:24:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-01 16:24:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-01 16:24:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-01 16:24:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-01 16:24:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-01 16:24:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-01 16:24:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-01 16:24:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 16:24:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 16:24:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 16:24:12,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 16:24:12,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 16:24:12,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 16:24:12,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 16:24:12,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 16:24:12,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 16:24:13,177 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 16:24:13,177 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-01 16:24:13,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:24:13 BoogieIcfgContainer [2018-12-01 16:24:13,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 16:24:13,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 16:24:13,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 16:24:13,180 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 16:24:13,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 04:24:12" (1/3) ... [2018-12-01 16:24:13,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fd06a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 04:24:13, skipping insertion in model container [2018-12-01 16:24:13,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:24:12" (2/3) ... [2018-12-01 16:24:13,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fd06a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 04:24:13, skipping insertion in model container [2018-12-01 16:24:13,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:24:13" (3/3) ... [2018-12-01 16:24:13,182 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-12-01 16:24:13,187 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 16:24:13,192 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2018-12-01 16:24:13,201 INFO L257 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2018-12-01 16:24:13,216 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 16:24:13,217 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 16:24:13,217 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-01 16:24:13,217 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 16:24:13,217 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 16:24:13,217 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 16:24:13,217 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 16:24:13,217 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 16:24:13,217 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 16:24:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states. [2018-12-01 16:24:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 16:24:13,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:13,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:13,234 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:13,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1280679066, now seen corresponding path program 1 times [2018-12-01 16:24:13,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:13,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:13,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:13,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:13,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:13,326 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-01 16:24:13,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:24:13,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 16:24:13,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:24:13,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:24:13,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:24:13,339 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 3 states. [2018-12-01 16:24:13,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:13,435 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-12-01 16:24:13,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:24:13,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-01 16:24:13,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:13,442 INFO L225 Difference]: With dead ends: 113 [2018-12-01 16:24:13,442 INFO L226 Difference]: Without dead ends: 109 [2018-12-01 16:24:13,443 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-01 16:24:13,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-01 16:24:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-12-01 16:24:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-01 16:24:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-12-01 16:24:13,467 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 7 [2018-12-01 16:24:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:13,468 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-12-01 16:24:13,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:24:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-12-01 16:24:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 16:24:13,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:13,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:13,469 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:13,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:13,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1280679065, now seen corresponding path program 1 times [2018-12-01 16:24:13,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:13,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:13,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:13,493 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-01 16:24:13,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:24:13,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 16:24:13,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:24:13,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:24:13,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:24:13,494 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 3 states. [2018-12-01 16:24:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:13,569 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-12-01 16:24:13,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:24:13,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-01 16:24:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:13,570 INFO L225 Difference]: With dead ends: 119 [2018-12-01 16:24:13,570 INFO L226 Difference]: Without dead ends: 119 [2018-12-01 16:24:13,571 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-01 16:24:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-01 16:24:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-12-01 16:24:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-01 16:24:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2018-12-01 16:24:13,578 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 7 [2018-12-01 16:24:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:13,578 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2018-12-01 16:24:13,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:24:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-12-01 16:24:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-01 16:24:13,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:13,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:13,579 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:13,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:13,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1559376120, now seen corresponding path program 1 times [2018-12-01 16:24:13,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:13,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:13,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:13,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:13,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:13,625 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-01 16:24:13,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:24:13,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:24:13,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 16:24:13,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 16:24:13,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 16:24:13,626 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 4 states. [2018-12-01 16:24:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:13,729 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-12-01 16:24:13,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 16:24:13,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-01 16:24:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:13,730 INFO L225 Difference]: With dead ends: 117 [2018-12-01 16:24:13,730 INFO L226 Difference]: Without dead ends: 117 [2018-12-01 16:24:13,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-01 16:24:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-01 16:24:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-12-01 16:24:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-01 16:24:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-12-01 16:24:13,736 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 12 [2018-12-01 16:24:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:13,736 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-12-01 16:24:13,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 16:24:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-12-01 16:24:13,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-01 16:24:13,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:13,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:13,737 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:13,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:13,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1559376119, now seen corresponding path program 1 times [2018-12-01 16:24:13,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:13,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:13,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:13,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:13,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:13,779 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-01 16:24:13,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:24:13,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:24:13,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 16:24:13,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 16:24:13,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 16:24:13,780 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 4 states. [2018-12-01 16:24:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:13,897 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2018-12-01 16:24:13,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 16:24:13,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-01 16:24:13,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:13,898 INFO L225 Difference]: With dead ends: 134 [2018-12-01 16:24:13,898 INFO L226 Difference]: Without dead ends: 134 [2018-12-01 16:24:13,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-01 16:24:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-01 16:24:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 111. [2018-12-01 16:24:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-01 16:24:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2018-12-01 16:24:13,902 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 12 [2018-12-01 16:24:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:13,902 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2018-12-01 16:24:13,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 16:24:13,902 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2018-12-01 16:24:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 16:24:13,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:13,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:13,903 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:13,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:13,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1007724238, now seen corresponding path program 1 times [2018-12-01 16:24:13,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:13,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:13,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:13,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:13,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:13,936 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-01 16:24:13,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:24:13,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:24:13,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 16:24:13,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 16:24:13,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 16:24:13,937 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 6 states. [2018-12-01 16:24:14,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:14,115 INFO L93 Difference]: Finished difference Result 181 states and 198 transitions. [2018-12-01 16:24:14,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 16:24:14,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-01 16:24:14,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:14,116 INFO L225 Difference]: With dead ends: 181 [2018-12-01 16:24:14,116 INFO L226 Difference]: Without dead ends: 181 [2018-12-01 16:24:14,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-01 16:24:14,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-01 16:24:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 110. [2018-12-01 16:24:14,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-01 16:24:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2018-12-01 16:24:14,121 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 15 [2018-12-01 16:24:14,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:14,122 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2018-12-01 16:24:14,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 16:24:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2018-12-01 16:24:14,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 16:24:14,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:14,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:14,123 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:14,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:14,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1007724237, now seen corresponding path program 1 times [2018-12-01 16:24:14,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:14,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:14,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:14,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:14,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:14,182 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-01 16:24:14,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:24:14,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:24:14,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 16:24:14,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 16:24:14,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 16:24:14,183 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 6 states. [2018-12-01 16:24:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:14,386 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2018-12-01 16:24:14,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 16:24:14,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-01 16:24:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:14,387 INFO L225 Difference]: With dead ends: 182 [2018-12-01 16:24:14,387 INFO L226 Difference]: Without dead ends: 182 [2018-12-01 16:24:14,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-01 16:24:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-01 16:24:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 105. [2018-12-01 16:24:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-01 16:24:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2018-12-01 16:24:14,390 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 15 [2018-12-01 16:24:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:14,391 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2018-12-01 16:24:14,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 16:24:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2018-12-01 16:24:14,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-01 16:24:14,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:14,391 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] [2018-12-01 16:24:14,391 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:14,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:14,392 INFO L82 PathProgramCache]: Analyzing trace with hash 305175762, now seen corresponding path program 1 times [2018-12-01 16:24:14,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:14,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:14,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:14,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:14,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:14,419 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-01 16:24:14,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:24:14,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 16:24:14,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 16:24:14,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 16:24:14,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 16:24:14,420 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand 4 states. [2018-12-01 16:24:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:14,470 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2018-12-01 16:24:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 16:24:14,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-01 16:24:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:14,471 INFO L225 Difference]: With dead ends: 119 [2018-12-01 16:24:14,471 INFO L226 Difference]: Without dead ends: 119 [2018-12-01 16:24:14,471 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-01 16:24:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-01 16:24:14,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2018-12-01 16:24:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-01 16:24:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-12-01 16:24:14,475 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 21 [2018-12-01 16:24:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:14,475 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-12-01 16:24:14,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 16:24:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-12-01 16:24:14,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 16:24:14,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:14,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] [2018-12-01 16:24:14,476 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:14,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:14,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1227495682, now seen corresponding path program 1 times [2018-12-01 16:24:14,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:14,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:14,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:14,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:14,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:14,539 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-01 16:24:14,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:24:14,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:24:14,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:24:14,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:24:14,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:24:14,540 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 5 states. [2018-12-01 16:24:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:14,612 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-12-01 16:24:14,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 16:24:14,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-01 16:24:14,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:14,613 INFO L225 Difference]: With dead ends: 111 [2018-12-01 16:24:14,613 INFO L226 Difference]: Without dead ends: 111 [2018-12-01 16:24:14,614 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-01 16:24:14,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-01 16:24:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2018-12-01 16:24:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-01 16:24:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-12-01 16:24:14,616 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 23 [2018-12-01 16:24:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:14,616 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-12-01 16:24:14,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:24:14,617 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-12-01 16:24:14,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 16:24:14,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:14,617 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-01 16:24:14,617 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:14,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:14,618 INFO L82 PathProgramCache]: Analyzing trace with hash -601833439, now seen corresponding path program 1 times [2018-12-01 16:24:14,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:14,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:14,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:14,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:14,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:14,647 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-01 16:24:14,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:24:14,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:24:14,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 16:24:14,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 16:24:14,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 16:24:14,648 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 6 states. [2018-12-01 16:24:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:14,812 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2018-12-01 16:24:14,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 16:24:14,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-01 16:24:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:14,812 INFO L225 Difference]: With dead ends: 165 [2018-12-01 16:24:14,813 INFO L226 Difference]: Without dead ends: 165 [2018-12-01 16:24:14,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-01 16:24:14,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-01 16:24:14,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 103. [2018-12-01 16:24:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-01 16:24:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-12-01 16:24:14,815 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 23 [2018-12-01 16:24:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:14,816 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-12-01 16:24:14,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 16:24:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-12-01 16:24:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 16:24:14,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:14,816 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-01 16:24:14,816 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:14,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:14,816 INFO L82 PathProgramCache]: Analyzing trace with hash -601833438, now seen corresponding path program 1 times [2018-12-01 16:24:14,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:14,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:14,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:14,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:14,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:14,876 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-01 16:24:14,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:24:14,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:24:14,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 16:24:14,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 16:24:14,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 16:24:14,876 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 6 states. [2018-12-01 16:24:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:15,038 INFO L93 Difference]: Finished difference Result 182 states and 197 transitions. [2018-12-01 16:24:15,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 16:24:15,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-01 16:24:15,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:15,039 INFO L225 Difference]: With dead ends: 182 [2018-12-01 16:24:15,039 INFO L226 Difference]: Without dead ends: 182 [2018-12-01 16:24:15,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-01 16:24:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-01 16:24:15,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 95. [2018-12-01 16:24:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-01 16:24:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2018-12-01 16:24:15,042 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 23 [2018-12-01 16:24:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:15,042 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2018-12-01 16:24:15,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 16:24:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2018-12-01 16:24:15,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 16:24:15,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:15,042 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] [2018-12-01 16:24:15,043 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:15,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:15,043 INFO L82 PathProgramCache]: Analyzing trace with hash -513964692, now seen corresponding path program 1 times [2018-12-01 16:24:15,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:15,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:15,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:15,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:15,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:15,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:24:15,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 16:24:15,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 16:24:15,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 16:24:15,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 16:24:15,102 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 5 states. [2018-12-01 16:24:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:15,182 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-12-01 16:24:15,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 16:24:15,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-12-01 16:24:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:15,183 INFO L225 Difference]: With dead ends: 109 [2018-12-01 16:24:15,183 INFO L226 Difference]: Without dead ends: 98 [2018-12-01 16:24:15,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 16:24:15,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-01 16:24:15,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-12-01 16:24:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-01 16:24:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-12-01 16:24:15,185 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 27 [2018-12-01 16:24:15,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:15,185 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-12-01 16:24:15,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 16:24:15,185 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-12-01 16:24:15,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-01 16:24:15,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:15,186 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:15,187 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:15,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:15,187 INFO L82 PathProgramCache]: Analyzing trace with hash 435598066, now seen corresponding path program 1 times [2018-12-01 16:24:15,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:15,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:15,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:15,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:15,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:15,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:24:15,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/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-01 16:24:15,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:15,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:15,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:15,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:15,390 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-01 16:24:15,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:15,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:15,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-12-01 16:24:15,415 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-01 16:24:15,417 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-01 16:24:15,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:15,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:15,427 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-01 16:24:15,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-12-01 16:24:15,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:15,483 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 36 treesize of output 37 [2018-12-01 16:24:15,485 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-01 16:24:15,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:15,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:15,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:15,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-12-01 16:24:15,522 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 50 [2018-12-01 16:24:15,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:15,526 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 30 treesize of output 18 [2018-12-01 16:24:15,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:15,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:15,538 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-01 16:24:15,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2018-12-01 16:24:15,597 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 36 treesize of output 24 [2018-12-01 16:24:15,599 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-01 16:24:15,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:15,604 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-01 16:24:15,605 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:15,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:15,611 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-01 16:24:15,612 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-12-01 16:24:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:15,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 16:24:15,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-12-01 16:24:15,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-01 16:24:15,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-01 16:24:15,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-12-01 16:24:15,674 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 22 states. [2018-12-01 16:24:16,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:16,274 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2018-12-01 16:24:16,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-01 16:24:16,275 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-12-01 16:24:16,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:16,275 INFO L225 Difference]: With dead ends: 179 [2018-12-01 16:24:16,275 INFO L226 Difference]: Without dead ends: 179 [2018-12-01 16:24:16,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2018-12-01 16:24:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-01 16:24:16,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 122. [2018-12-01 16:24:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-01 16:24:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-12-01 16:24:16,279 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 36 [2018-12-01 16:24:16,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:16,280 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-12-01 16:24:16,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-01 16:24:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-12-01 16:24:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-01 16:24:16,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:16,281 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:16,281 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:16,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:16,282 INFO L82 PathProgramCache]: Analyzing trace with hash 435598067, now seen corresponding path program 1 times [2018-12-01 16:24:16,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:16,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:16,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:16,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:16,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:16,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:24:16,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/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-01 16:24:16,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:16,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:16,452 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-01 16:24:16,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:16,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:16,461 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-01 16:24:16,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-12-01 16:24:16,475 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-01 16:24:16,477 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-01 16:24:16,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,490 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-01 16:24:16,491 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-01 16:24:16,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,500 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-01 16:24:16,501 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-12-01 16:24:16,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:16,545 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 36 treesize of output 37 [2018-12-01 16:24:16,547 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-01 16:24:16,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:16,569 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 19 treesize of output 24 [2018-12-01 16:24:16,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 16:24:16,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,584 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-12-01 16:24:16,615 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 102 treesize of output 92 [2018-12-01 16:24:16,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:16,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-12-01 16:24:16,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,640 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 50 treesize of output 45 [2018-12-01 16:24:16,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:16,644 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 30 treesize of output 18 [2018-12-01 16:24:16,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,654 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-01 16:24:16,654 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2018-12-01 16:24:16,709 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 47 treesize of output 33 [2018-12-01 16:24:16,711 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 28 treesize of output 17 [2018-12-01 16:24:16,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,716 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-01 16:24:16,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,726 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 22 treesize of output 20 [2018-12-01 16:24:16,728 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-01 16:24:16,728 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,733 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-01 16:24:16,733 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,734 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:16,737 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-01 16:24:16,738 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-12-01 16:24:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:16,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 16:24:16,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2018-12-01 16:24:16,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-01 16:24:16,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 16:24:16,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-01 16:24:16,765 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 17 states. [2018-12-01 16:24:17,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:17,563 INFO L93 Difference]: Finished difference Result 184 states and 200 transitions. [2018-12-01 16:24:17,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 16:24:17,564 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-12-01 16:24:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:17,565 INFO L225 Difference]: With dead ends: 184 [2018-12-01 16:24:17,565 INFO L226 Difference]: Without dead ends: 184 [2018-12-01 16:24:17,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2018-12-01 16:24:17,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-01 16:24:17,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 124. [2018-12-01 16:24:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-01 16:24:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-12-01 16:24:17,571 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 36 [2018-12-01 16:24:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:17,571 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-12-01 16:24:17,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-01 16:24:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-12-01 16:24:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 16:24:17,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:17,573 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:17,573 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:17,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:17,573 INFO L82 PathProgramCache]: Analyzing trace with hash 147100084, now seen corresponding path program 1 times [2018-12-01 16:24:17,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:17,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:17,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:17,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:17,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:17,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:24:17,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/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-01 16:24:17,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:17,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:17,999 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-01 16:24:17,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:18,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:18,010 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-01 16:24:18,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-12-01 16:24:18,032 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-01 16:24:18,034 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-01 16:24:18,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,043 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-01 16:24:18,045 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-01 16:24:18,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,052 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-01 16:24:18,052 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-12-01 16:24:18,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:18,112 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 36 treesize of output 37 [2018-12-01 16:24:18,114 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-01 16:24:18,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:18,134 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 19 treesize of output 24 [2018-12-01 16:24:18,135 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 12 treesize of output 11 [2018-12-01 16:24:18,136 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-12-01 16:24:18,180 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 3 [2018-12-01 16:24:18,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,213 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 114 treesize of output 104 [2018-12-01 16:24:18,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:18,218 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 30 treesize of output 18 [2018-12-01 16:24:18,218 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,227 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,240 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 21 treesize of output 14 [2018-12-01 16:24:18,242 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-01 16:24:18,242 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,243 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,256 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 50 treesize of output 45 [2018-12-01 16:24:18,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:18,259 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 30 treesize of output 18 [2018-12-01 16:24:18,259 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,263 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:18,270 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:144, output treesize:57 [2018-12-01 16:24:18,332 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 51 treesize of output 37 [2018-12-01 16:24:18,336 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 32 treesize of output 21 [2018-12-01 16:24:18,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,341 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-01 16:24:18,341 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,353 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 22 treesize of output 20 [2018-12-01 16:24:18,354 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-01 16:24:18,355 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,359 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-01 16:24:18,359 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,360 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:18,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:18,365 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-12-01 16:24:18,407 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-01 16:24:18,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-01 16:24:18,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 16:24:18,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 16:24:18,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 16:24:18,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-12-01 16:24:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:18,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 16:24:18,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-12-01 16:24:18,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-01 16:24:18,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-01 16:24:18,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2018-12-01 16:24:18,488 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 32 states. [2018-12-01 16:24:20,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:20,486 INFO L93 Difference]: Finished difference Result 182 states and 195 transitions. [2018-12-01 16:24:20,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-01 16:24:20,486 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-12-01 16:24:20,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:20,487 INFO L225 Difference]: With dead ends: 182 [2018-12-01 16:24:20,487 INFO L226 Difference]: Without dead ends: 182 [2018-12-01 16:24:20,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=408, Invalid=2347, Unknown=1, NotChecked=0, Total=2756 [2018-12-01 16:24:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-01 16:24:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 121. [2018-12-01 16:24:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-01 16:24:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-12-01 16:24:20,490 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 40 [2018-12-01 16:24:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:20,491 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-12-01 16:24:20,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-01 16:24:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-12-01 16:24:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-01 16:24:20,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:20,492 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:20,492 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:20,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:20,492 INFO L82 PathProgramCache]: Analyzing trace with hash 935958873, now seen corresponding path program 1 times [2018-12-01 16:24:20,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:20,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:20,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:20,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:20,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:20,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:24:20,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 16:24:20,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:20,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:20,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:20,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:20,697 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-01 16:24:20,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:20,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:20,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-12-01 16:24:20,708 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-01 16:24:20,710 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-01 16:24:20,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:20,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:20,717 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-01 16:24:20,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-12-01 16:24:20,745 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 19 treesize of output 20 [2018-12-01 16:24:20,747 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-01 16:24:20,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:20,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:20,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:20,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:24 [2018-12-01 16:24:20,778 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 34 treesize of output 33 [2018-12-01 16:24:20,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:20,781 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 22 treesize of output 14 [2018-12-01 16:24:20,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:20,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:20,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:20,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:24 [2018-12-01 16:24:20,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:20,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:20,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 16:24:20,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:20,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:20,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-12-01 16:24:20,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-01 16:24:20,843 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 7 [2018-12-01 16:24:20,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:20,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:20,851 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-01 16:24:20,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-12-01 16:24:20,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:20,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 65 [2018-12-01 16:24:20,918 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 2 case distinctions, treesize of input 48 treesize of output 47 [2018-12-01 16:24:20,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 16:24:20,944 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 49 treesize of output 48 [2018-12-01 16:24:20,944 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:20,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 16:24:20,970 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 2 xjuncts. [2018-12-01 16:24:20,971 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:81 [2018-12-01 16:24:21,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 76 [2018-12-01 16:24:21,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:21,025 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 83 treesize of output 67 [2018-12-01 16:24:21,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:21,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:21,053 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 70 [2018-12-01 16:24:21,054 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 16:24:21,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 16:24:21,096 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 50 [2018-12-01 16:24:21,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:21,099 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 30 treesize of output 18 [2018-12-01 16:24:21,099 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:21,103 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:21,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-01 16:24:21,116 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:149, output treesize:106 [2018-12-01 16:24:21,208 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 36 treesize of output 24 [2018-12-01 16:24:21,210 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-01 16:24:21,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:21,216 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-01 16:24:21,216 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:21,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:21,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2018-12-01 16:24:21,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-12-01 16:24:21,239 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:21,250 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 30 treesize of output 21 [2018-12-01 16:24:21,250 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:21,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-12-01 16:24:21,259 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:21,273 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2018-12-01 16:24:21,274 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-01 16:24:21,285 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-01 16:24:21,285 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:21,290 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:21,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:21,295 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:89, output treesize:5 [2018-12-01 16:24:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:21,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 16:24:21,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 23 [2018-12-01 16:24:21,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-01 16:24:21,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-01 16:24:21,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=479, Unknown=1, NotChecked=0, Total=552 [2018-12-01 16:24:21,327 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 24 states. [2018-12-01 16:24:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:22,199 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2018-12-01 16:24:22,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-01 16:24:22,200 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2018-12-01 16:24:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:22,200 INFO L225 Difference]: With dead ends: 206 [2018-12-01 16:24:22,200 INFO L226 Difference]: Without dead ends: 206 [2018-12-01 16:24:22,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 27 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=282, Invalid=1521, Unknown=3, NotChecked=0, Total=1806 [2018-12-01 16:24:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-01 16:24:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 146. [2018-12-01 16:24:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-01 16:24:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2018-12-01 16:24:22,203 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 42 [2018-12-01 16:24:22,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:22,203 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2018-12-01 16:24:22,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-01 16:24:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2018-12-01 16:24:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-01 16:24:22,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:22,203 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:22,204 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:22,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:22,204 INFO L82 PathProgramCache]: Analyzing trace with hash 935958874, now seen corresponding path program 1 times [2018-12-01 16:24:22,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:22,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:22,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:22,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:22,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:22,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:24:22,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 16:24:22,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:22,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:22,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:22,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:22,459 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-01 16:24:22,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-12-01 16:24:22,497 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-01 16:24:22,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, 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-01 16:24:22,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,511 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-01 16:24:22,513 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-01 16:24:22,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,523 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-01 16:24:22,523 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-12-01 16:24:22,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:22,591 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 36 treesize of output 37 [2018-12-01 16:24:22,593 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-01 16:24:22,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:22,615 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 19 treesize of output 24 [2018-12-01 16:24:22,617 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 12 treesize of output 11 [2018-12-01 16:24:22,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-12-01 16:24:22,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:22,673 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 62 treesize of output 61 [2018-12-01 16:24:22,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:22,677 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 22 treesize of output 14 [2018-12-01 16:24:22,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2018-12-01 16:24:22,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:22,706 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 26 treesize of output 37 [2018-12-01 16:24:22,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,711 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,721 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2018-12-01 16:24:22,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:22,751 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 21 [2018-12-01 16:24:22,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:22,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:22,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:22,767 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 20 treesize of output 21 [2018-12-01 16:24:22,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:72 [2018-12-01 16:24:22,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:22,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-12-01 16:24:22,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-12-01 16:24:22,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-12-01 16:24:22,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-01 16:24:22,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,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-01 16:24:22,866 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:66 [2018-12-01 16:24:22,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:22,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:22,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 83 [2018-12-01 16:24:22,964 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-01 16:24:22,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:22,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-12-01 16:24:22,999 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 15 [2018-12-01 16:24:23,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:23,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:23,016 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-01 16:24:23,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:88 [2018-12-01 16:24:23,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 130 [2018-12-01 16:24:23,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:23,063 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 38 treesize of output 22 [2018-12-01 16:24:23,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:23,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:23,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-12-01 16:24:23,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:23,097 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 38 treesize of output 22 [2018-12-01 16:24:23,097 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:23,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:23,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:23,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:101 [2018-12-01 16:24:23,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 61 [2018-12-01 16:24:23,211 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 29 treesize of output 18 [2018-12-01 16:24:23,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:23,222 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-12-01 16:24:23,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:23,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 16:24:23,231 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:23,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:23,246 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 22 treesize of output 20 [2018-12-01 16:24:23,248 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-01 16:24:23,248 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:23,252 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-01 16:24:23,252 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:23,253 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:23,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:23,259 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2018-12-01 16:24:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:23,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 16:24:23,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2018-12-01 16:24:23,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-01 16:24:23,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-01 16:24:23,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2018-12-01 16:24:23,328 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 32 states. [2018-12-01 16:24:25,780 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2018-12-01 16:24:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:27,462 INFO L93 Difference]: Finished difference Result 255 states and 278 transitions. [2018-12-01 16:24:27,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-01 16:24:27,462 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2018-12-01 16:24:27,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:27,464 INFO L225 Difference]: With dead ends: 255 [2018-12-01 16:24:27,464 INFO L226 Difference]: Without dead ends: 255 [2018-12-01 16:24:27,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=372, Invalid=2490, Unknown=0, NotChecked=0, Total=2862 [2018-12-01 16:24:27,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-12-01 16:24:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 148. [2018-12-01 16:24:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-01 16:24:27,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2018-12-01 16:24:27,467 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 42 [2018-12-01 16:24:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:27,467 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2018-12-01 16:24:27,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-01 16:24:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2018-12-01 16:24:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-01 16:24:27,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:27,468 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, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:27,468 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:27,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:27,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1353917894, now seen corresponding path program 1 times [2018-12-01 16:24:27,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:27,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:27,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:27,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:27,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-01 16:24:27,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:24:27,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 16:24:27,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 16:24:27,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 16:24:27,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 16:24:27,502 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand 6 states. [2018-12-01 16:24:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:27,583 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-12-01 16:24:27,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 16:24:27,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-12-01 16:24:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:27,584 INFO L225 Difference]: With dead ends: 118 [2018-12-01 16:24:27,584 INFO L226 Difference]: Without dead ends: 118 [2018-12-01 16:24:27,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-01 16:24:27,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-01 16:24:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 111. [2018-12-01 16:24:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-01 16:24:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-12-01 16:24:27,586 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 43 [2018-12-01 16:24:27,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:27,586 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-12-01 16:24:27,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 16:24:27,587 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-12-01 16:24:27,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-01 16:24:27,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:27,587 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:27,587 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:27,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:27,588 INFO L82 PathProgramCache]: Analyzing trace with hash -389524194, now seen corresponding path program 2 times [2018-12-01 16:24:27,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:27,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:27,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:27,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:27,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:27,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:24:27,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 16:24:27,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 16:24:27,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 16:24:27,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 16:24:27,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:27,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:27,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:27,812 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-01 16:24:27,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-12-01 16:24:27,831 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-01 16:24:27,832 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-01 16:24:27,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,842 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-01 16:24:27,843 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-01 16:24:27,843 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,849 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-01 16:24:27,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-12-01 16:24:27,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:27,903 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 26 treesize of output 31 [2018-12-01 16:24:27,905 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 12 treesize of output 15 [2018-12-01 16:24:27,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:27,921 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 42 treesize of output 43 [2018-12-01 16:24:27,922 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 11 [2018-12-01 16:24:27,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,933 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:59 [2018-12-01 16:24:27,963 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 116 treesize of output 111 [2018-12-01 16:24:27,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:27,965 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 42 treesize of output 30 [2018-12-01 16:24:27,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,983 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 78 treesize of output 68 [2018-12-01 16:24:27,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:27,987 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 42 treesize of output 30 [2018-12-01 16:24:27,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:27,996 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:49 [2018-12-01 16:24:28,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:28,146 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 16:24:28,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69 [2018-12-01 16:24:28,152 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 16:24:28,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2018-12-01 16:24:28,153 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-01 16:24:28,178 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 16:24:28,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-12-01 16:24:28,179 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:28,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:28,192 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 37 treesize of output 29 [2018-12-01 16:24:28,193 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 16:24:28,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-01 16:24:28,194 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:28,199 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 16 treesize of output 7 [2018-12-01 16:24:28,200 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:28,202 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:28,206 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-01 16:24:28,206 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:82, output treesize:7 [2018-12-01 16:24:28,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:28,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 16:24:28,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2018-12-01 16:24:28,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-01 16:24:28,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-01 16:24:28,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=722, Unknown=3, NotChecked=0, Total=812 [2018-12-01 16:24:28,264 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 29 states. [2018-12-01 16:24:28,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:28,913 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-12-01 16:24:28,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 16:24:28,914 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2018-12-01 16:24:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:28,914 INFO L225 Difference]: With dead ends: 124 [2018-12-01 16:24:28,914 INFO L226 Difference]: Without dead ends: 105 [2018-12-01 16:24:28,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=1273, Unknown=4, NotChecked=0, Total=1482 [2018-12-01 16:24:28,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-01 16:24:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2018-12-01 16:24:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-01 16:24:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-12-01 16:24:28,917 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 44 [2018-12-01 16:24:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:28,917 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-12-01 16:24:28,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-01 16:24:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-12-01 16:24:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-01 16:24:28,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:28,918 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:28,918 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:28,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:28,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1154571308, now seen corresponding path program 3 times [2018-12-01 16:24:28,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:28,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:28,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:28,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 16:24:28,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:29,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:24:29,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 16:24:29,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-01 16:24:29,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-01 16:24:29,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 16:24:29,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:29,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:29,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:29,163 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-01 16:24:29,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-12-01 16:24:29,184 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-01 16:24:29,185 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-01 16:24:29,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,192 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-01 16:24:29,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-12-01 16:24:29,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:29,244 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 27 treesize of output 28 [2018-12-01 16:24:29,245 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-01 16:24:29,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-12-01 16:24:29,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:29,276 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 42 treesize of output 41 [2018-12-01 16:24:29,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:29,280 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 22 treesize of output 14 [2018-12-01 16:24:29,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:31 [2018-12-01 16:24:29,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:29,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:29,292 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-01 16:24:29,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-12-01 16:24:29,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:29,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-01 16:24:29,320 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 7 [2018-12-01 16:24:29,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,330 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-01 16:24:29,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 [2018-12-01 16:24:29,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:29,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 65 [2018-12-01 16:24:29,412 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 2 case distinctions, treesize of input 48 treesize of output 47 [2018-12-01 16:24:29,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 16:24:29,438 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 49 treesize of output 48 [2018-12-01 16:24:29,439 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 16:24:29,470 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 2 xjuncts. [2018-12-01 16:24:29,470 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:87 [2018-12-01 16:24:29,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 79 [2018-12-01 16:24:29,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:29,535 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 86 treesize of output 70 [2018-12-01 16:24:29,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:29,571 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 3 case distinctions, treesize of input 55 treesize of output 59 [2018-12-01 16:24:29,571 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 16:24:29,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 16:24:29,613 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 63 treesize of output 53 [2018-12-01 16:24:29,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:29,616 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 30 treesize of output 18 [2018-12-01 16:24:29,616 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,621 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-01 16:24:29,638 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:155, output treesize:113 [2018-12-01 16:24:29,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2018-12-01 16:24:29,790 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 16:24:29,791 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 36 treesize of output 30 [2018-12-01 16:24:29,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,816 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2018-12-01 16:24:29,816 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 16:24:29,843 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 44 treesize of output 39 [2018-12-01 16:24:29,843 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,868 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 16:24:29,869 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 39 treesize of output 31 [2018-12-01 16:24:29,870 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,888 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-01 16:24:29,889 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,910 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-12-01 16:24:29,912 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 16:24:29,912 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 19 treesize of output 13 [2018-12-01 16:24:29,912 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,919 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-01 16:24:29,919 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,922 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:29,930 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:101, output treesize:5 [2018-12-01 16:24:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:29,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 16:24:29,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 31 [2018-12-01 16:24:29,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-01 16:24:29,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-01 16:24:29,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=869, Unknown=1, NotChecked=0, Total=992 [2018-12-01 16:24:29,972 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 32 states. [2018-12-01 16:24:31,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:31,189 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-12-01 16:24:31,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-01 16:24:31,189 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2018-12-01 16:24:31,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:31,190 INFO L225 Difference]: With dead ends: 161 [2018-12-01 16:24:31,190 INFO L226 Difference]: Without dead ends: 161 [2018-12-01 16:24:31,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=368, Invalid=2077, Unknown=5, NotChecked=0, Total=2450 [2018-12-01 16:24:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-01 16:24:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 122. [2018-12-01 16:24:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-01 16:24:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2018-12-01 16:24:31,194 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 45 [2018-12-01 16:24:31,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:31,195 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2018-12-01 16:24:31,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-01 16:24:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2018-12-01 16:24:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-01 16:24:31,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:31,195 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:31,196 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:31,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:31,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1154571309, now seen corresponding path program 2 times [2018-12-01 16:24:31,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:31,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:31,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:31,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 16:24:31,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:31,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:24:31,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 16:24:31,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 16:24:31,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 16:24:31,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 16:24:31,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:31,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:31,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:31,479 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-01 16:24:31,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-12-01 16:24:31,514 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-01 16:24:31,515 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-01 16:24:31,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,526 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-01 16:24:31,528 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-01 16:24:31,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,529 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,536 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-01 16:24:31,537 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-12-01 16:24:31,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:31,605 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 19 treesize of output 24 [2018-12-01 16:24:31,607 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 12 treesize of output 11 [2018-12-01 16:24:31,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:31,625 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 47 treesize of output 48 [2018-12-01 16:24:31,627 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-01 16:24:31,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:61 [2018-12-01 16:24:31,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2018-12-01 16:24:31,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:31,683 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 26 treesize of output 37 [2018-12-01 16:24:31,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:31,707 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 62 treesize of output 61 [2018-12-01 16:24:31,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:31,710 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 22 treesize of output 14 [2018-12-01 16:24:31,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,727 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:106, output treesize:68 [2018-12-01 16:24:31,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:31,762 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 21 [2018-12-01 16:24:31,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:31,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:31,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:31,779 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 20 treesize of output 21 [2018-12-01 16:24:31,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:75 [2018-12-01 16:24:31,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2018-12-01 16:24:31,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-01 16:24:31,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:31,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-12-01 16:24:31,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-12-01 16:24:31,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,879 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-01 16:24:31,879 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:69 [2018-12-01 16:24:31,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:31,967 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 19 treesize of output 28 [2018-12-01 16:24:31,969 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 15 [2018-12-01 16:24:31,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:31,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:31,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:31,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2018-12-01 16:24:31,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 8 treesize of output 7 [2018-12-01 16:24:31,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:32,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:32,018 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-01 16:24:32,018 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:107, output treesize:99 [2018-12-01 16:24:32,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-12-01 16:24:32,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:32,069 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 38 treesize of output 22 [2018-12-01 16:24:32,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:32,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:32,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 99 [2018-12-01 16:24:32,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:32,102 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 38 treesize of output 22 [2018-12-01 16:24:32,102 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:32,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:32,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:32,126 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:190, output treesize:104 [2018-12-01 16:24:32,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 66 [2018-12-01 16:24:32,285 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-01 16:24:32,285 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-01 16:24:32,295 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 16:24:32,295 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 27 treesize of output 19 [2018-12-01 16:24:32,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:32,304 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-01 16:24:32,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:32,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:32,325 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 22 treesize of output 20 [2018-12-01 16:24:32,326 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 16:24:32,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-01 16:24:32,326 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:32,331 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-01 16:24:32,331 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:32,332 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:32,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:32,340 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:121, output treesize:18 [2018-12-01 16:24:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:32,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 16:24:32,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2018-12-01 16:24:32,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-01 16:24:32,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-01 16:24:32,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2018-12-01 16:24:32,414 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 35 states. [2018-12-01 16:24:33,304 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2018-12-01 16:24:33,608 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 48 [2018-12-01 16:24:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:35,682 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2018-12-01 16:24:35,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-01 16:24:35,682 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2018-12-01 16:24:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:35,683 INFO L225 Difference]: With dead ends: 166 [2018-12-01 16:24:35,683 INFO L226 Difference]: Without dead ends: 166 [2018-12-01 16:24:35,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=454, Invalid=2738, Unknown=0, NotChecked=0, Total=3192 [2018-12-01 16:24:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-01 16:24:35,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 104. [2018-12-01 16:24:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-01 16:24:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-12-01 16:24:35,685 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 45 [2018-12-01 16:24:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:35,685 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-12-01 16:24:35,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-01 16:24:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-12-01 16:24:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-01 16:24:35,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:35,686 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:35,686 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:35,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:35,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1671435109, now seen corresponding path program 1 times [2018-12-01 16:24:35,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:35,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:35,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:35,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 16:24:35,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:35,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:24:35,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 16:24:35,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:35,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:35,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:35,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:35,921 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-01 16:24:35,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:35,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:35,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-12-01 16:24:35,957 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-01 16:24:35,958 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-01 16:24:35,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:35,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:35,968 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-01 16:24:35,970 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-01 16:24:35,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:35,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:35,977 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-01 16:24:35,977 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-12-01 16:24:36,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:36,044 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 36 treesize of output 37 [2018-12-01 16:24:36,045 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 11 [2018-12-01 16:24:36,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:36,063 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 37 treesize of output 42 [2018-12-01 16:24:36,064 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 12 treesize of output 15 [2018-12-01 16:24:36,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,076 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2018-12-01 16:24:36,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:36,110 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 70 treesize of output 69 [2018-12-01 16:24:36,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:36,113 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 26 treesize of output 22 [2018-12-01 16:24:36,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2018-12-01 16:24:36,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:36,140 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 30 treesize of output 45 [2018-12-01 16:24:36,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,160 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:70 [2018-12-01 16:24:36,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:36,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:36,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:36,166 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 26 treesize of output 46 [2018-12-01 16:24:36,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:87 [2018-12-01 16:24:36,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:36,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-12-01 16:24:36,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2018-12-01 16:24:36,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-12-01 16:24:36,246 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 22 treesize of output 30 [2018-12-01 16:24:36,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,262 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-01 16:24:36,262 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:85 [2018-12-01 16:24:36,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:36,378 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 87 treesize of output 88 [2018-12-01 16:24:36,380 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-01 16:24:36,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:36,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:36,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2018-12-01 16:24:36,431 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-01 16:24:36,431 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,470 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:120, output treesize:100 [2018-12-01 16:24:36,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 164 [2018-12-01 16:24:36,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:36,562 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 46 treesize of output 26 [2018-12-01 16:24:36,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 128 [2018-12-01 16:24:36,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:36,698 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 46 treesize of output 26 [2018-12-01 16:24:36,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:36,777 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-01 16:24:36,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:231, output treesize:121 [2018-12-01 16:24:37,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2018-12-01 16:24:37,146 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 75 treesize of output 60 [2018-12-01 16:24:37,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:37,169 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-01 16:24:37,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:37,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:37,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:37,187 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2018-12-01 16:24:37,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 50 [2018-12-01 16:24:37,263 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 27 treesize of output 16 [2018-12-01 16:24:37,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:37,269 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-01 16:24:37,269 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:37,274 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-12-01 16:24:37,275 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:37,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:37,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:37,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-12-01 16:24:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:37,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 16:24:37,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2018-12-01 16:24:37,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-01 16:24:37,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-01 16:24:37,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2018-12-01 16:24:37,381 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 36 states. [2018-12-01 16:24:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:38,879 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2018-12-01 16:24:38,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-01 16:24:38,879 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 46 [2018-12-01 16:24:38,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:38,880 INFO L225 Difference]: With dead ends: 164 [2018-12-01 16:24:38,880 INFO L226 Difference]: Without dead ends: 164 [2018-12-01 16:24:38,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=327, Invalid=2025, Unknown=0, NotChecked=0, Total=2352 [2018-12-01 16:24:38,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-01 16:24:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 126. [2018-12-01 16:24:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-01 16:24:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2018-12-01 16:24:38,882 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 46 [2018-12-01 16:24:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:38,882 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2018-12-01 16:24:38,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-01 16:24:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2018-12-01 16:24:38,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-01 16:24:38,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:38,883 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:38,883 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:38,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:38,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1671435108, now seen corresponding path program 1 times [2018-12-01 16:24:38,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:38,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:38,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:38,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:38,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:39,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 16:24:39,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 16:24:39,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:24:39,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 16:24:39,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,201 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-01 16:24:39,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-12-01 16:24:39,230 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-01 16:24:39,231 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-01 16:24:39,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,242 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-01 16:24:39,243 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-01 16:24:39,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,251 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-01 16:24:39,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-12-01 16:24:39,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,317 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 26 treesize of output 31 [2018-12-01 16:24:39,319 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 12 treesize of output 15 [2018-12-01 16:24:39,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,335 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 51 treesize of output 52 [2018-12-01 16:24:39,336 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 11 [2018-12-01 16:24:39,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2018-12-01 16:24:39,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 70 [2018-12-01 16:24:39,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,387 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 30 treesize of output 45 [2018-12-01 16:24:39,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,413 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 70 treesize of output 69 [2018-12-01 16:24:39,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,417 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 26 treesize of output 22 [2018-12-01 16:24:39,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:70 [2018-12-01 16:24:39,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,440 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 20 treesize of output 21 [2018-12-01 16:24:39,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,456 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 6 treesize of output 5 [2018-12-01 16:24:39,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:76 [2018-12-01 16:24:39,525 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 16:24:39,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 67 [2018-12-01 16:24:39,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-12-01 16:24:39,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-12-01 16:24:39,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2018-12-01 16:24:39,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,565 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,575 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-01 16:24:39,575 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:95, output treesize:86 [2018-12-01 16:24:39,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 119 [2018-12-01 16:24:39,688 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-01 16:24:39,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 103 [2018-12-01 16:24:39,728 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-01 16:24:39,728 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,746 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:101 [2018-12-01 16:24:39,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 206 [2018-12-01 16:24:39,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,789 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 46 treesize of output 26 [2018-12-01 16:24:39,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 127 [2018-12-01 16:24:39,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 16:24:39,830 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 46 treesize of output 26 [2018-12-01 16:24:39,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:39,859 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-01 16:24:39,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:232, output treesize:122 [2018-12-01 16:24:40,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 98 [2018-12-01 16:24:40,030 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 56 treesize of output 23 [2018-12-01 16:24:40,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:40,042 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-01 16:24:40,043 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:40,051 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-12-01 16:24:40,051 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:40,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 16:24:40,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-12-01 16:24:40,070 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-01 16:24:40,070 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:40,076 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 20 treesize of output 11 [2018-12-01 16:24:40,077 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:40,080 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-01 16:24:40,080 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 16:24:40,081 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 16:24:40,086 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-01 16:24:40,086 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:152, output treesize:9 [2018-12-01 16:24:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:24:40,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 16:24:40,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2018-12-01 16:24:40,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-01 16:24:40,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-01 16:24:40,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-12-01 16:24:40,113 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand 33 states. [2018-12-01 16:24:41,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:24:41,393 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2018-12-01 16:24:41,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-01 16:24:41,393 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 46 [2018-12-01 16:24:41,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:24:41,394 INFO L225 Difference]: With dead ends: 162 [2018-12-01 16:24:41,394 INFO L226 Difference]: Without dead ends: 162 [2018-12-01 16:24:41,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=241, Invalid=1921, Unknown=0, NotChecked=0, Total=2162 [2018-12-01 16:24:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-01 16:24:41,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 126. [2018-12-01 16:24:41,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-01 16:24:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-12-01 16:24:41,396 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 46 [2018-12-01 16:24:41,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:24:41,396 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-12-01 16:24:41,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-01 16:24:41,396 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-12-01 16:24:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-01 16:24:41,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:24:41,396 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:24:41,396 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION]=== [2018-12-01 16:24:41,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:24:41,397 INFO L82 PathProgramCache]: Analyzing trace with hash 68631713, now seen corresponding path program 1 times [2018-12-01 16:24:41,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:24:41,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:24:41,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:41,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:24:41,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:24:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:24:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:24:41,438 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 16:24:41,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 04:24:41 BoogieIcfgContainer [2018-12-01 16:24:41,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 16:24:41,466 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 16:24:41,466 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 16:24:41,466 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 16:24:41,467 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:24:13" (3/4) ... [2018-12-01 16:24:41,469 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 16:24:41,500 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_657985f6-51c5-4566-ad6b-7247037ea331/bin-2019/uautomizer/witness.graphml [2018-12-01 16:24:41,501 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 16:24:41,501 INFO L168 Benchmark]: Toolchain (without parser) took 28929.12 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 336.1 MB). Free memory was 950.6 MB in the beginning and 796.0 MB in the end (delta: 154.6 MB). Peak memory consumption was 490.7 MB. Max. memory is 11.5 GB. [2018-12-01 16:24:41,501 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:24:41,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -125.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-12-01 16:24:41,502 INFO L168 Benchmark]: Boogie Preprocessor took 32.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 16:24:41,502 INFO L168 Benchmark]: RCFGBuilder took 314.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. [2018-12-01 16:24:41,502 INFO L168 Benchmark]: TraceAbstraction took 28287.92 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 248.5 MB). Free memory was 1.0 GB in the beginning and 806.6 MB in the end (delta: 209.4 MB). Peak memory consumption was 457.9 MB. Max. memory is 11.5 GB. [2018-12-01 16:24:41,502 INFO L168 Benchmark]: Witness Printer took 34.36 ms. Allocated memory is still 1.4 GB. Free memory was 806.6 MB in the beginning and 796.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. [2018-12-01 16:24:41,503 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -125.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 314.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28287.92 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 248.5 MB). Free memory was 1.0 GB in the beginning and 806.6 MB in the end (delta: 209.4 MB). Peak memory consumption was 457.9 MB. Max. memory is 11.5 GB. * Witness Printer took 34.36 ms. Allocated memory is still 1.4 GB. Free memory was 806.6 MB in the beginning and 796.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={20:0}, malloc(sizeof(SLL))={20:0}] [L996] list->next = ((void*)0) VAL [list={20:0}, malloc(sizeof(SLL))={20:0}] [L997] list->colour = BLACK VAL [list={20:0}, malloc(sizeof(SLL))={20:0}] [L999] SLL* end = list; VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] end->next = malloc(sizeof(SLL)) VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1006] EXPR end->next VAL [end={20:0}, end->next={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1006] end = end->next [L1007] end->next = ((void*)0) VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] end->colour = RED VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={12:0}] [L1016] end->next = malloc(sizeof(SLL)) VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={12:0}] [L1017] EXPR end->next VAL [end={12:0}, end->next={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={12:0}] [L1017] end = end->next [L1018] end->next = ((void*)0) VAL [end={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={12:0}] [L1019] end->colour = BLACK VAL [end={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={12:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={12:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={12:0}] [L1028] EXPR end->colour VAL [end={20:0}, end->colour=1, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={12:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end VAL [end={20:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={12:0}] [L1032] EXPR end->colour VAL [end={20:0}, end->colour=1, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={12:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={20:0}, end->next={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={12:0}] [L1038] COND FALSE !(!(end->next)) [L1039] EXPR end->next VAL [end={20:0}, end->next={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={12:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={12:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={12:0}] [L1032] EXPR end->colour VAL [end={12:0}, end->colour=0, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={12:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR end->next VAL [end={12:0}, end->next={22:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={12:0}] [L1034] end = end->next [L1035] EXPR end->next VAL [end={22:0}, end->next={0:0}, list={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={22:0}, malloc(sizeof(SLL))={12:0}] [L1035] end = end->next [L1038] end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 112 locations, 49 error locations. UNSAFE Result, 28.2s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 17.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1278 SDtfs, 4448 SDslu, 6096 SDs, 0 SdLazy, 13286 SolverSat, 901 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 828 GetRequests, 297 SyntacticMatches, 42 SemanticMatches, 489 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4847 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=16, 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, 22 MinimizatonAttempts, 905 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 1120 NumberOfCodeBlocks, 1120 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1040 ConstructedInterpolants, 183 QuantifiedInterpolants, 1191401 SizeOfPredicates, 168 NumberOfNonLiveVariables, 1916 ConjunctsInSsa, 486 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 14/155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...