./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0232_false-valid-free.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_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232_false-valid-free.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/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 1197d671a588cd166018a116686924380f8bf0f7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:01:37,695 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:01:37,696 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:01:37,702 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:01:37,703 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:01:37,703 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:01:37,704 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:01:37,705 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:01:37,705 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:01:37,706 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:01:37,706 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:01:37,706 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:01:37,707 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:01:37,707 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:01:37,708 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:01:37,708 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:01:37,709 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:01:37,710 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:01:37,711 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:01:37,712 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:01:37,712 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:01:37,713 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:01:37,714 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:01:37,714 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:01:37,714 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:01:37,715 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:01:37,715 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:01:37,716 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:01:37,716 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:01:37,717 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:01:37,717 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:01:37,717 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:01:37,717 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:01:37,717 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:01:37,718 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:01:37,718 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:01:37,719 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 21:01:37,726 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:01:37,726 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:01:37,726 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:01:37,727 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:01:37,727 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 21:01:37,727 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 21:01:37,727 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 21:01:37,727 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:01:37,727 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:01:37,727 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 21:01:37,728 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:01:37,728 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:01:37,728 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:01:37,728 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 21:01:37,728 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 21:01:37,728 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 21:01:37,728 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:01:37,728 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:01:37,728 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 21:01:37,728 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:01:37,728 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:01:37,729 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:01:37,729 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:01:37,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:01:37,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:01:37,729 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:01:37,729 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 21:01:37,729 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:01:37,729 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_8745153f-f611-413d-bf8e-1453489b7c8b/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 -> 1197d671a588cd166018a116686924380f8bf0f7 [2018-12-02 21:01:37,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:01:37,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:01:37,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:01:37,759 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:01:37,759 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:01:37,760 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety/test-0232_false-valid-free.i [2018-12-02 21:01:37,800 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/data/9110e8ef8/eaa34d5319344b369ba63e3675b18676/FLAGf8bac19ad [2018-12-02 21:01:38,247 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:01:38,247 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/sv-benchmarks/c/memsafety/test-0232_false-valid-free.i [2018-12-02 21:01:38,253 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/data/9110e8ef8/eaa34d5319344b369ba63e3675b18676/FLAGf8bac19ad [2018-12-02 21:01:38,260 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/data/9110e8ef8/eaa34d5319344b369ba63e3675b18676 [2018-12-02 21:01:38,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:01:38,263 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 21:01:38,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:01:38,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:01:38,265 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:01:38,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:01:38" (1/1) ... [2018-12-02 21:01:38,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198b87e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:01:38, skipping insertion in model container [2018-12-02 21:01:38,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:01:38" (1/1) ... [2018-12-02 21:01:38,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:01:38,289 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:01:38,429 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:01:38,434 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:01:38,495 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:01:38,514 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:01:38,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:01:38 WrapperNode [2018-12-02 21:01:38,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:01:38,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:01:38,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:01:38,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:01:38,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:01:38" (1/1) ... [2018-12-02 21:01:38,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:01:38" (1/1) ... [2018-12-02 21:01:38,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:01:38" (1/1) ... [2018-12-02 21:01:38,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:01:38" (1/1) ... [2018-12-02 21:01:38,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:01:38" (1/1) ... [2018-12-02 21:01:38,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:01:38" (1/1) ... [2018-12-02 21:01:38,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:01:38" (1/1) ... [2018-12-02 21:01:38,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:01:38,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:01:38,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:01:38,545 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:01:38,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:01:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/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-02 21:01:38,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:01:38,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:01:38,576 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-02 21:01:38,576 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:01:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 21:01:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 21:01:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 21:01:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 21:01:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 21:01:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 21:01:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 21:01:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 21:01:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 21:01:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 21:01:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 21:01:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 21:01:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 21:01:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 21:01:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 21:01:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 21:01:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 21:01:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 21:01:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 21:01:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 21:01:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 21:01:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 21:01:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 21:01:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 21:01:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 21:01:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 21:01:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 21:01:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 21:01:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 21:01:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 21:01:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 21:01:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 21:01:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 21:01:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 21:01:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 21:01:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 21:01:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 21:01:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 21:01:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 21:01:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 21:01:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 21:01:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 21:01:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 21:01:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 21:01:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 21:01:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 21:01:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 21:01:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 21:01:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 21:01:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 21:01:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 21:01:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 21:01:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 21:01:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 21:01:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 21:01:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 21:01:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-02 21:01:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:01:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 21:01:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 21:01:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:01:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 21:01:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:01:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:01:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:01:38,853 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:01:38,853 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 21:01:38,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:01:38 BoogieIcfgContainer [2018-12-02 21:01:38,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:01:38,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:01:38,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:01:38,857 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:01:38,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:01:38" (1/3) ... [2018-12-02 21:01:38,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4c66bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:01:38, skipping insertion in model container [2018-12-02 21:01:38,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:01:38" (2/3) ... [2018-12-02 21:01:38,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4c66bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:01:38, skipping insertion in model container [2018-12-02 21:01:38,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:01:38" (3/3) ... [2018-12-02 21:01:38,859 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-free.i [2018-12-02 21:01:38,865 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:01:38,870 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 51 error locations. [2018-12-02 21:01:38,879 INFO L257 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2018-12-02 21:01:38,894 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 21:01:38,895 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:01:38,895 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 21:01:38,895 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:01:38,895 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:01:38,895 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:01:38,895 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:01:38,895 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:01:38,895 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:01:38,905 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2018-12-02 21:01:38,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-02 21:01:38,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:38,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:38,912 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:38,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:38,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1830902200, now seen corresponding path program 1 times [2018-12-02 21:01:38,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:38,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:38,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:38,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:38,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:38,984 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-02 21:01:38,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:38,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:01:38,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 21:01:38,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 21:01:38,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 21:01:38,998 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 2 states. [2018-12-02 21:01:39,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:39,010 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-12-02 21:01:39,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 21:01:39,011 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-12-02 21:01:39,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:39,016 INFO L225 Difference]: With dead ends: 106 [2018-12-02 21:01:39,017 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 21:01:39,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 21:01:39,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 21:01:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-02 21:01:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 21:01:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-12-02 21:01:39,041 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 8 [2018-12-02 21:01:39,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:39,041 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-12-02 21:01:39,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 21:01:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-12-02 21:01:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 21:01:39,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:39,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:39,042 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:39,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:39,042 INFO L82 PathProgramCache]: Analyzing trace with hash 923514391, now seen corresponding path program 1 times [2018-12-02 21:01:39,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:39,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:39,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:39,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:39,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:39,102 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-02 21:01:39,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:39,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:01:39,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:01:39,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:01:39,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:01:39,103 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 5 states. [2018-12-02 21:01:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:39,235 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-12-02 21:01:39,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:01:39,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 21:01:39,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:39,236 INFO L225 Difference]: With dead ends: 97 [2018-12-02 21:01:39,236 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 21:01:39,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:01:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 21:01:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-02 21:01:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 21:01:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-12-02 21:01:39,241 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 9 [2018-12-02 21:01:39,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:39,241 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-12-02 21:01:39,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:01:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-12-02 21:01:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 21:01:39,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:39,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:39,242 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:39,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:39,242 INFO L82 PathProgramCache]: Analyzing trace with hash 923514392, now seen corresponding path program 1 times [2018-12-02 21:01:39,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:39,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:39,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:39,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:39,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:39,292 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-02 21:01:39,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:39,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:01:39,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:01:39,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:01:39,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:01:39,293 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 5 states. [2018-12-02 21:01:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:39,432 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2018-12-02 21:01:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:01:39,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 21:01:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:39,435 INFO L225 Difference]: With dead ends: 121 [2018-12-02 21:01:39,435 INFO L226 Difference]: Without dead ends: 121 [2018-12-02 21:01:39,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:01:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-02 21:01:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2018-12-02 21:01:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 21:01:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-12-02 21:01:39,440 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 9 [2018-12-02 21:01:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:39,440 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-12-02 21:01:39,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:01:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-12-02 21:01:39,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 21:01:39,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:39,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:39,441 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:39,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:39,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1435824870, now seen corresponding path program 1 times [2018-12-02 21:01:39,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:39,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:39,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:39,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:39,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:39,461 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-02 21:01:39,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:39,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:01:39,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:01:39,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:01:39,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:01:39,462 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 3 states. [2018-12-02 21:01:39,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:39,502 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-12-02 21:01:39,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:01:39,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 21:01:39,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:39,503 INFO L225 Difference]: With dead ends: 99 [2018-12-02 21:01:39,503 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 21:01:39,503 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-02 21:01:39,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 21:01:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-02 21:01:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 21:01:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-12-02 21:01:39,506 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 10 [2018-12-02 21:01:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:39,506 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-12-02 21:01:39,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:01:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-12-02 21:01:39,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 21:01:39,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:39,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:39,507 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:39,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:39,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1435824871, now seen corresponding path program 1 times [2018-12-02 21:01:39,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:39,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:39,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:39,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:39,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:39,521 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-02 21:01:39,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:39,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:01:39,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:01:39,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:01:39,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:01:39,522 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 3 states. [2018-12-02 21:01:39,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:39,559 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-12-02 21:01:39,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:01:39,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 21:01:39,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:39,560 INFO L225 Difference]: With dead ends: 95 [2018-12-02 21:01:39,560 INFO L226 Difference]: Without dead ends: 95 [2018-12-02 21:01:39,561 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-02 21:01:39,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-02 21:01:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-02 21:01:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-02 21:01:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2018-12-02 21:01:39,565 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 10 [2018-12-02 21:01:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:39,565 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-12-02 21:01:39,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:01:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2018-12-02 21:01:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 21:01:39,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:39,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:39,567 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:39,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:39,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2128044514, now seen corresponding path program 1 times [2018-12-02 21:01:39,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:39,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:39,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:39,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:39,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:39,658 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-02 21:01:39,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:39,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 21:01:39,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:01:39,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:01:39,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:01:39,659 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 8 states. [2018-12-02 21:01:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:39,821 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2018-12-02 21:01:39,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 21:01:39,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-02 21:01:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:39,822 INFO L225 Difference]: With dead ends: 106 [2018-12-02 21:01:39,822 INFO L226 Difference]: Without dead ends: 106 [2018-12-02 21:01:39,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:01:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-02 21:01:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2018-12-02 21:01:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 21:01:39,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-12-02 21:01:39,828 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 15 [2018-12-02 21:01:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:39,828 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-12-02 21:01:39,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:01:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-12-02 21:01:39,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 21:01:39,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:39,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:39,829 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:39,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:39,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1545148638, now seen corresponding path program 1 times [2018-12-02 21:01:39,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:39,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:39,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:39,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:39,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:39,886 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-02 21:01:39,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:39,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:01:39,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:01:39,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:01:39,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:01:39,887 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 7 states. [2018-12-02 21:01:39,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:39,985 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-12-02 21:01:39,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:01:39,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-02 21:01:39,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:39,986 INFO L225 Difference]: With dead ends: 101 [2018-12-02 21:01:39,986 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 21:01:39,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:01:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 21:01:39,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-12-02 21:01:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 21:01:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-12-02 21:01:39,989 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 16 [2018-12-02 21:01:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:39,989 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-12-02 21:01:39,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:01:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-12-02 21:01:39,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 21:01:39,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:39,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:39,990 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:39,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:39,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1729987530, now seen corresponding path program 1 times [2018-12-02 21:01:39,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:39,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:39,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:39,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:39,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:40,043 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-02 21:01:40,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:40,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:01:40,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:01:40,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:01:40,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:01:40,044 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 7 states. [2018-12-02 21:01:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:40,163 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-12-02 21:01:40,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:01:40,163 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-02 21:01:40,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:40,163 INFO L225 Difference]: With dead ends: 111 [2018-12-02 21:01:40,163 INFO L226 Difference]: Without dead ends: 111 [2018-12-02 21:01:40,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:01:40,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-02 21:01:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2018-12-02 21:01:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-02 21:01:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2018-12-02 21:01:40,166 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 24 [2018-12-02 21:01:40,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:40,167 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2018-12-02 21:01:40,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:01:40,168 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2018-12-02 21:01:40,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 21:01:40,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:40,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:40,168 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:40,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:40,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1729987531, now seen corresponding path program 1 times [2018-12-02 21:01:40,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:40,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:40,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:40,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:40,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:40,272 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-02 21:01:40,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:40,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:01:40,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:01:40,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:01:40,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:01:40,273 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 7 states. [2018-12-02 21:01:40,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:40,406 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-12-02 21:01:40,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:01:40,406 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-02 21:01:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:40,407 INFO L225 Difference]: With dead ends: 116 [2018-12-02 21:01:40,407 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 21:01:40,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:01:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 21:01:40,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2018-12-02 21:01:40,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 21:01:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-12-02 21:01:40,411 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 24 [2018-12-02 21:01:40,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:40,411 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-12-02 21:01:40,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:01:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-12-02 21:01:40,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 21:01:40,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:40,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:40,412 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:40,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:40,413 INFO L82 PathProgramCache]: Analyzing trace with hash 393473866, now seen corresponding path program 1 times [2018-12-02 21:01:40,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:40,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:40,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:40,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:40,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:40,455 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-02 21:01:40,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:40,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:01:40,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:01:40,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:01:40,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:01:40,456 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 6 states. [2018-12-02 21:01:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:40,524 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-12-02 21:01:40,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:01:40,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-02 21:01:40,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:40,525 INFO L225 Difference]: With dead ends: 88 [2018-12-02 21:01:40,525 INFO L226 Difference]: Without dead ends: 88 [2018-12-02 21:01:40,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:01:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-02 21:01:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-02 21:01:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 21:01:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-12-02 21:01:40,528 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 26 [2018-12-02 21:01:40,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:40,528 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-12-02 21:01:40,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:01:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-12-02 21:01:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 21:01:40,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:40,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:40,529 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:40,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:40,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1549046728, now seen corresponding path program 1 times [2018-12-02 21:01:40,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:40,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:40,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:40,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:40,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:40,570 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-02 21:01:40,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:40,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:01:40,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:01:40,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:01:40,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:01:40,571 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 7 states. [2018-12-02 21:01:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:40,663 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-12-02 21:01:40,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:01:40,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-02 21:01:40,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:40,664 INFO L225 Difference]: With dead ends: 87 [2018-12-02 21:01:40,665 INFO L226 Difference]: Without dead ends: 87 [2018-12-02 21:01:40,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:01:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-02 21:01:40,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-02 21:01:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 21:01:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-12-02 21:01:40,667 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 27 [2018-12-02 21:01:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:40,667 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-12-02 21:01:40,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:01:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-12-02 21:01:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 21:01:40,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:40,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:40,668 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:40,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:40,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1549046727, now seen corresponding path program 1 times [2018-12-02 21:01:40,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:40,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:40,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:40,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:40,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:40,741 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-02 21:01:40,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:40,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:01:40,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:01:40,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:01:40,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:01:40,742 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 8 states. [2018-12-02 21:01:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:40,835 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-12-02 21:01:40,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:01:40,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-02 21:01:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:40,836 INFO L225 Difference]: With dead ends: 86 [2018-12-02 21:01:40,836 INFO L226 Difference]: Without dead ends: 86 [2018-12-02 21:01:40,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:01:40,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-02 21:01:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-02 21:01:40,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 21:01:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-12-02 21:01:40,839 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 27 [2018-12-02 21:01:40,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:40,839 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-12-02 21:01:40,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:01:40,839 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-12-02 21:01:40,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 21:01:40,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:40,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:40,840 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:40,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:40,841 INFO L82 PathProgramCache]: Analyzing trace with hash -775808307, now seen corresponding path program 1 times [2018-12-02 21:01:40,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:40,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:40,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:40,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:40,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:41,017 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-02 21:01:41,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:41,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 21:01:41,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:01:41,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:01:41,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:01:41,018 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 12 states. [2018-12-02 21:01:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:41,328 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-12-02 21:01:41,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 21:01:41,328 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-12-02 21:01:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:41,328 INFO L225 Difference]: With dead ends: 118 [2018-12-02 21:01:41,329 INFO L226 Difference]: Without dead ends: 118 [2018-12-02 21:01:41,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-12-02 21:01:41,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-02 21:01:41,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2018-12-02 21:01:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 21:01:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-02 21:01:41,331 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 28 [2018-12-02 21:01:41,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:41,331 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-02 21:01:41,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:01:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-02 21:01:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 21:01:41,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:41,332 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:41,332 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:41,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:41,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1761151540, now seen corresponding path program 1 times [2018-12-02 21:01:41,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:41,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:41,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:41,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:41,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:01:41,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:01:41,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/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-02 21:01:41,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:41,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:01:41,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-02 21:01:41,498 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-02 21:01:41,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:41,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:41,505 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-02 21:01:41,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-02 21:01:41,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-02 21:01:41,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:41,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:41,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-12-02 21:01:41,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 21:01:41,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-02 21:01:41,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:41,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:41,614 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-02 21:01:41,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-02 21:01:41,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-12-02 21:01:41,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-12-02 21:01:41,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:41,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-12-02 21:01:41,651 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:41,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-02 21:01:41,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:41,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:41,665 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-02 21:01:41,665 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-12-02 21:01:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:01:41,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:01:41,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2018-12-02 21:01:41,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 21:01:41,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 21:01:41,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:01:41,693 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 17 states. [2018-12-02 21:01:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:42,190 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-02 21:01:42,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 21:01:42,190 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-12-02 21:01:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:42,191 INFO L225 Difference]: With dead ends: 105 [2018-12-02 21:01:42,191 INFO L226 Difference]: Without dead ends: 105 [2018-12-02 21:01:42,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2018-12-02 21:01:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-02 21:01:42,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2018-12-02 21:01:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 21:01:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-12-02 21:01:42,193 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 29 [2018-12-02 21:01:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:42,193 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-12-02 21:01:42,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 21:01:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-12-02 21:01:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 21:01:42,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:42,193 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:42,194 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:42,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:42,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1761151541, now seen corresponding path program 1 times [2018-12-02 21:01:42,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:42,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:42,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:42,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:42,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:01:42,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:01:42,286 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/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-02 21:01:42,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:42,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:01:42,326 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-02 21:01:42,327 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-02 21:01:42,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,335 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-02 21:01:42,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 7 [2018-12-02 21:01:42,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,338 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,342 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-02 21:01:42,342 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-12-02 21:01:42,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:42,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 21:01:42,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:42,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:42,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 21:01:42,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-12-02 21:01:42,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-12-02 21:01:42,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-02 21:01:42,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 21:01:42,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-12-02 21:01:42,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,488 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-02 21:01:42,488 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-12-02 21:01:42,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-12-02 21:01:42,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-12-02 21:01:42,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-02 21:01:42,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-02 21:01:42,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 21:01:42,558 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-02 21:01:42,567 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:42,574 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-02 21:01:42,575 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-12-02 21:01:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:01:42,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:01:42,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-12-02 21:01:42,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 21:01:42,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 21:01:42,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2018-12-02 21:01:42,608 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 17 states. [2018-12-02 21:01:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:43,165 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-12-02 21:01:43,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 21:01:43,165 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-12-02 21:01:43,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:43,166 INFO L225 Difference]: With dead ends: 101 [2018-12-02 21:01:43,166 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 21:01:43,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=446, Unknown=1, NotChecked=0, Total=552 [2018-12-02 21:01:43,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 21:01:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-12-02 21:01:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 21:01:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2018-12-02 21:01:43,170 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 29 [2018-12-02 21:01:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:43,171 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2018-12-02 21:01:43,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 21:01:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2018-12-02 21:01:43,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 21:01:43,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:43,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:43,172 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:43,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:43,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1719746328, now seen corresponding path program 1 times [2018-12-02 21:01:43,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:43,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:43,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:43,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:43,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:43,330 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-02 21:01:43,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:43,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 21:01:43,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:01:43,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:01:43,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:01:43,330 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 12 states. [2018-12-02 21:01:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:43,605 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-12-02 21:01:43,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 21:01:43,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-12-02 21:01:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:43,606 INFO L225 Difference]: With dead ends: 110 [2018-12-02 21:01:43,606 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 21:01:43,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:01:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 21:01:43,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-12-02 21:01:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 21:01:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-12-02 21:01:43,609 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 29 [2018-12-02 21:01:43,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:43,609 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-12-02 21:01:43,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:01:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-12-02 21:01:43,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 21:01:43,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:43,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:43,610 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:43,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:43,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1772528688, now seen corresponding path program 1 times [2018-12-02 21:01:43,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:43,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:43,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:43,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:43,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:43,837 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-02 21:01:43,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:43,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 21:01:43,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:01:43,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:01:43,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:01:43,838 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 13 states. [2018-12-02 21:01:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:44,227 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-12-02 21:01:44,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 21:01:44,227 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-12-02 21:01:44,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:44,228 INFO L225 Difference]: With dead ends: 129 [2018-12-02 21:01:44,228 INFO L226 Difference]: Without dead ends: 129 [2018-12-02 21:01:44,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-12-02 21:01:44,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-02 21:01:44,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2018-12-02 21:01:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-02 21:01:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2018-12-02 21:01:44,231 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 30 [2018-12-02 21:01:44,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:44,231 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2018-12-02 21:01:44,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:01:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2018-12-02 21:01:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 21:01:44,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:44,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:44,232 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:44,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:44,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1772528689, now seen corresponding path program 1 times [2018-12-02 21:01:44,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:44,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:44,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:44,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:44,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:01:44,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:44,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:01:44,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:01:44,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:01:44,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:01:44,251 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand 3 states. [2018-12-02 21:01:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:44,277 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-12-02 21:01:44,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:01:44,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 21:01:44,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:44,277 INFO L225 Difference]: With dead ends: 110 [2018-12-02 21:01:44,277 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 21:01:44,278 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-02 21:01:44,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 21:01:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-02 21:01:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-02 21:01:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2018-12-02 21:01:44,280 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 30 [2018-12-02 21:01:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:44,280 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2018-12-02 21:01:44,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:01:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-12-02 21:01:44,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 21:01:44,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:44,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:44,281 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:44,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:44,281 INFO L82 PathProgramCache]: Analyzing trace with hash -886185508, now seen corresponding path program 1 times [2018-12-02 21:01:44,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:44,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:44,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:44,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:44,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:44,323 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-02 21:01:44,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:44,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:01:44,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:01:44,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:01:44,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:01:44,323 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 6 states. [2018-12-02 21:01:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:44,376 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-12-02 21:01:44,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:01:44,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-02 21:01:44,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:44,377 INFO L225 Difference]: With dead ends: 109 [2018-12-02 21:01:44,377 INFO L226 Difference]: Without dead ends: 109 [2018-12-02 21:01:44,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:01:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-02 21:01:44,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-02 21:01:44,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 21:01:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-12-02 21:01:44,380 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 31 [2018-12-02 21:01:44,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:44,380 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-12-02 21:01:44,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:01:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-12-02 21:01:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 21:01:44,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:44,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:44,381 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:44,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:44,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1701946896, now seen corresponding path program 1 times [2018-12-02 21:01:44,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:44,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:44,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:44,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:44,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:44,595 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-02 21:01:44,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:44,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 21:01:44,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:01:44,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:01:44,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:01:44,596 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 13 states. [2018-12-02 21:01:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:44,884 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-12-02 21:01:44,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 21:01:44,884 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-12-02 21:01:44,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:44,885 INFO L225 Difference]: With dead ends: 117 [2018-12-02 21:01:44,885 INFO L226 Difference]: Without dead ends: 117 [2018-12-02 21:01:44,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:01:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-02 21:01:44,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2018-12-02 21:01:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-02 21:01:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-12-02 21:01:44,887 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 32 [2018-12-02 21:01:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:44,887 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-12-02 21:01:44,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:01:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-12-02 21:01:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 21:01:44,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:44,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:44,888 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:44,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:44,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1220746145, now seen corresponding path program 1 times [2018-12-02 21:01:44,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:44,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:44,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:44,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:44,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:44,941 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-02 21:01:44,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:44,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:01:44,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:01:44,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:01:44,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:01:44,942 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 8 states. [2018-12-02 21:01:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:45,062 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2018-12-02 21:01:45,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:01:45,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-12-02 21:01:45,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:45,063 INFO L225 Difference]: With dead ends: 116 [2018-12-02 21:01:45,063 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 21:01:45,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-02 21:01:45,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 21:01:45,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-12-02 21:01:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-02 21:01:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2018-12-02 21:01:45,066 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 33 [2018-12-02 21:01:45,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:45,066 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2018-12-02 21:01:45,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:01:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2018-12-02 21:01:45,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 21:01:45,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:45,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:45,066 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:45,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:45,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1265757093, now seen corresponding path program 1 times [2018-12-02 21:01:45,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:45,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:45,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:45,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:45,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:01:45,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:45,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-02 21:01:45,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 21:01:45,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 21:01:45,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:01:45,590 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 17 states. [2018-12-02 21:01:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:46,246 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-12-02 21:01:46,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 21:01:46,246 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-12-02 21:01:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:46,247 INFO L225 Difference]: With dead ends: 139 [2018-12-02 21:01:46,247 INFO L226 Difference]: Without dead ends: 137 [2018-12-02 21:01:46,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-02 21:01:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-02 21:01:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2018-12-02 21:01:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-02 21:01:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-12-02 21:01:46,249 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 37 [2018-12-02 21:01:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:46,249 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-12-02 21:01:46,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 21:01:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-12-02 21:01:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 21:01:46,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:46,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:46,250 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:46,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:46,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1265757865, now seen corresponding path program 1 times [2018-12-02 21:01:46,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:46,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:46,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:46,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:46,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:46,514 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-02 21:01:46,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:01:46,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-02 21:01:46,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 21:01:46,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 21:01:46,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-12-02 21:01:46,515 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 16 states. [2018-12-02 21:01:46,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:46,931 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-12-02 21:01:46,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 21:01:46,931 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-12-02 21:01:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:46,932 INFO L225 Difference]: With dead ends: 118 [2018-12-02 21:01:46,932 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 21:01:46,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2018-12-02 21:01:46,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 21:01:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-12-02 21:01:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 21:01:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-12-02 21:01:46,934 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 37 [2018-12-02 21:01:46,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:46,934 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-12-02 21:01:46,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 21:01:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-12-02 21:01:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 21:01:46,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:46,935 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:46,935 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:46,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:46,935 INFO L82 PathProgramCache]: Analyzing trace with hash 177997755, now seen corresponding path program 1 times [2018-12-02 21:01:46,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:46,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:46,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:46,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:46,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:01:47,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:01:47,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/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-02 21:01:47,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:47,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:01:47,103 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-02 21:01:47,105 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-02 21:01:47,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:47,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:47,109 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-02 21:01:47,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-02 21:01:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:01:47,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:01:47,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-12-02 21:01:47,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 21:01:47,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 21:01:47,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:01:47,184 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 17 states. [2018-12-02 21:01:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:47,538 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-12-02 21:01:47,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 21:01:47,538 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-12-02 21:01:47,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:47,538 INFO L225 Difference]: With dead ends: 83 [2018-12-02 21:01:47,538 INFO L226 Difference]: Without dead ends: 83 [2018-12-02 21:01:47,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 21:01:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-02 21:01:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-02 21:01:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 21:01:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-12-02 21:01:47,540 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 42 [2018-12-02 21:01:47,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:47,540 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-12-02 21:01:47,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 21:01:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-12-02 21:01:47,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 21:01:47,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:47,541 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:47,541 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:47,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:47,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1970667529, now seen corresponding path program 1 times [2018-12-02 21:01:47,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:47,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:47,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:47,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:47,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:48,101 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-02 21:01:48,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:01:48,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/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-02 21:01:48,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:48,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:01:48,132 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-02 21:01:48,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:01:48,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 21:01:48,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 21:01:48,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-02 21:01:48,266 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-02 21:01:48,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 21:01:48,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 43 [2018-12-02 21:01:48,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-02 21:01:48,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,301 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,306 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-02 21:01:48,307 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-12-02 21:01:48,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:48,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:48,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 21:01:48,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:44 [2018-12-02 21:01:48,624 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-02 21:01:48,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-02 21:01:48,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,637 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-02 21:01:48,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:135 [2018-12-02 21:01:48,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:48,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:48,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:48,750 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 24 treesize of output 29 [2018-12-02 21:01:48,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,767 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 67 treesize of output 91 [2018-12-02 21:01:48,769 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-12-02 21:01:48,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:48,771 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:01:48,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 102 [2018-12-02 21:01:48,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,789 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:01:48,790 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 84 treesize of output 101 [2018-12-02 21:01:48,792 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 62 treesize of output 53 [2018-12-02 21:01:48,792 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,799 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,813 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 74 treesize of output 64 [2018-12-02 21:01:48,815 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 64 treesize of output 54 [2018-12-02 21:01:48,816 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:01:48,821 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:01:48,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:01:48,830 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:178, output treesize:72 [2018-12-02 21:01:48,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-12-02 21:01:48,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2018-12-02 21:01:48,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:01:48,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:56 [2018-12-02 21:01:48,934 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 50 treesize of output 46 [2018-12-02 21:01:48,936 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 13 [2018-12-02 21:01:48,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:48,944 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:01:48,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-12-02 21:01:48,945 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 21:01:48,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:48,955 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:3 [2018-12-02 21:01:48,965 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-02 21:01:48,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:01:48,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 35 [2018-12-02 21:01:48,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-02 21:01:48,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-02 21:01:48,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1143, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 21:01:48,983 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 36 states. [2018-12-02 21:01:50,231 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2018-12-02 21:01:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:01:51,085 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-12-02 21:01:51,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-02 21:01:51,086 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 45 [2018-12-02 21:01:51,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:01:51,087 INFO L225 Difference]: With dead ends: 135 [2018-12-02 21:01:51,087 INFO L226 Difference]: Without dead ends: 135 [2018-12-02 21:01:51,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=408, Invalid=3752, Unknown=0, NotChecked=0, Total=4160 [2018-12-02 21:01:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-02 21:01:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 82. [2018-12-02 21:01:51,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 21:01:51,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-12-02 21:01:51,090 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 45 [2018-12-02 21:01:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:01:51,090 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-12-02 21:01:51,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-02 21:01:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-12-02 21:01:51,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 21:01:51,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:01:51,091 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:01:51,091 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:01:51,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:01:51,092 INFO L82 PathProgramCache]: Analyzing trace with hash 961151324, now seen corresponding path program 1 times [2018-12-02 21:01:51,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:01:51,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:01:51,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:51,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:51,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:01:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:51,900 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-02 21:01:51,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:01:51,900 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/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-02 21:01:51,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:01:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:01:51,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:01:51,934 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-02 21:01:51,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:51,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:51,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:01:52,002 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-02 21:01:52,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:52,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:52,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-02 21:01:52,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 21:01:52,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 21:01:52,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:52,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:52,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:52,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-12-02 21:01:52,077 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-02 21:01:52,079 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-02 21:01:52,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:52,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:52,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-12-02 21:01:52,107 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 22 treesize of output 21 [2018-12-02 21:01:52,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:52,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:52,126 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-02 21:01:52,126 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:44 [2018-12-02 21:01:52,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:52,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:52,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 21:01:52,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:52,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:52,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46 [2018-12-02 21:01:52,637 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-02 21:01:52,641 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-02 21:01:52,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:52,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:52,668 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-02 21:01:52,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:112 [2018-12-02 21:01:54,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:54,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:54,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:54,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:54,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 71 [2018-12-02 21:01:54,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:54,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-12-02 21:01:54,935 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 40 [2018-12-02 21:01:54,935 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:54,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:54,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 86 [2018-12-02 21:01:54,966 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-02 21:01:54,970 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 28 treesize of output 29 [2018-12-02 21:01:54,970 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:54,974 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:54,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:54,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:54,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 87 [2018-12-02 21:01:54,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2018-12-02 21:01:54,994 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:55,004 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:55,012 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:55,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:55,024 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:157, output treesize:128 [2018-12-02 21:01:55,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 21:01:55,150 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-02 21:01:55,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:55,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:01:55,164 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-02 21:01:55,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:137, output treesize:126 [2018-12-02 21:01:55,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:55,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:01:55,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 76 [2018-12-02 21:01:55,233 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-12-02 21:01:55,234 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 21:01:55,251 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 42 treesize of output 35 [2018-12-02 21:01:55,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:55,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-02 21:01:55,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:01:55,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 32 [2018-12-02 21:01:55,270 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:01:55,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 52 [2018-12-02 21:01:55,280 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-02 21:01:55,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2018-12-02 21:01:55,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 5 xjuncts. [2018-12-02 21:01:55,354 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:127, output treesize:177 [2018-12-02 21:01:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:01:55,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:01:55,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2018-12-02 21:01:55,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-02 21:01:55,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-02 21:01:55,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1491, Unknown=1, NotChecked=0, Total=1640 [2018-12-02 21:01:55,456 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 41 states. [2018-12-02 21:01:58,295 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2018-12-02 21:02:02,549 WARN L180 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-12-02 21:02:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:02:03,009 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-12-02 21:02:03,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 21:02:03,010 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 46 [2018-12-02 21:02:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:02:03,010 INFO L225 Difference]: With dead ends: 82 [2018-12-02 21:02:03,010 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 21:02:03,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=283, Invalid=2685, Unknown=2, NotChecked=0, Total=2970 [2018-12-02 21:02:03,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 21:02:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-12-02 21:02:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-02 21:02:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-12-02 21:02:03,012 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 46 [2018-12-02 21:02:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:02:03,012 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-12-02 21:02:03,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-02 21:02:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-12-02 21:02:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 21:02:03,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:02:03,013 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:02:03,013 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:02:03,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:02:03,013 INFO L82 PathProgramCache]: Analyzing trace with hash -269079956, now seen corresponding path program 1 times [2018-12-02 21:02:03,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:02:03,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:02:03,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:02:03,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:02:03,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:02:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:02:03,854 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-02 21:02:03,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:02:03,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/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-02 21:02:03,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:02:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:02:03,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:02:03,909 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-02 21:02:03,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:03,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:03,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:02:04,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:02:04,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:02:04,060 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-02 21:02:04,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:04,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:04,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-12-02 21:02:04,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 21:02:04,134 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 10 treesize of output 9 [2018-12-02 21:02:04,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:04,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:04,152 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-02 21:02:04,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-02 21:02:04,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 32 [2018-12-02 21:02:04,260 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26 [2018-12-02 21:02:04,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 21:02:04,301 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 17 treesize of output 16 [2018-12-02 21:02:04,302 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:04,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:02:04,358 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-02 21:02:04,361 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-02 21:02:04,362 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:04,365 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:04,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:02:04,410 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:46, output treesize:72 [2018-12-02 21:02:04,508 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 21:02:04,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:04,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:02:04,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:02:04,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 21:02:04,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:04,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:04,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:45 [2018-12-02 21:02:05,046 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-02 21:02:05,048 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-02 21:02:05,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:05,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:05,057 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-02 21:02:05,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:106 [2018-12-02 21:02:07,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:02:07,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:02:07,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:02:07,173 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-02 21:02:07,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-12-02 21:02:07,187 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 40 [2018-12-02 21:02:07,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,190 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,207 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 65 treesize of output 68 [2018-12-02 21:02:07,208 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-02 21:02:07,211 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 28 treesize of output 29 [2018-12-02 21:02:07,211 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,214 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:02:07,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:02:07,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-12-02 21:02:07,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-12-02 21:02:07,230 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,237 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,242 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,250 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:150, output treesize:80 [2018-12-02 21:02:07,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 21:02:07,550 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-02 21:02:07,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:94, output treesize:83 [2018-12-02 21:02:07,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:02:07,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:02:07,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 53 [2018-12-02 21:02:07,711 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2018-12-02 21:02:07,713 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 21:02:07,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-12-02 21:02:07,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-02 21:02:07,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,749 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:84, output treesize:10 [2018-12-02 21:02:07,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:02:07,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-02 21:02:07,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:07,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:02:07,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-12-02 21:02:07,915 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:02:07,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:02:07,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 41 [2018-12-02 21:02:07,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-02 21:02:07,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-02 21:02:07,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1575, Unknown=1, NotChecked=0, Total=1722 [2018-12-02 21:02:07,947 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 42 states. [2018-12-02 21:02:50,426 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2018-12-02 21:02:51,345 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 48 [2018-12-02 21:02:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:02:51,781 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-12-02 21:02:51,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-02 21:02:51,782 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 47 [2018-12-02 21:02:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:02:51,782 INFO L225 Difference]: With dead ends: 131 [2018-12-02 21:02:51,782 INFO L226 Difference]: Without dead ends: 131 [2018-12-02 21:02:51,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1667 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=527, Invalid=5015, Unknown=8, NotChecked=0, Total=5550 [2018-12-02 21:02:51,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-02 21:02:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 80. [2018-12-02 21:02:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-02 21:02:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-12-02 21:02:51,785 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 47 [2018-12-02 21:02:51,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:02:51,785 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-12-02 21:02:51,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-02 21:02:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-12-02 21:02:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 21:02:51,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:02:51,786 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:02:51,786 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:02:51,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:02:51,786 INFO L82 PathProgramCache]: Analyzing trace with hash -887799508, now seen corresponding path program 1 times [2018-12-02 21:02:51,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:02:51,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:02:51,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:02:51,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:02:51,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:02:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:02:52,429 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-02 21:02:52,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:02:52,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/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-02 21:02:52,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:02:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:02:52,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:02:52,461 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-02 21:02:52,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:52,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:52,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:02:52,534 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-02 21:02:52,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:52,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:52,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-02 21:02:52,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 21:02:52,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 21:02:52,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:52,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:52,574 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-02 21:02:52,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-12-02 21:02:52,605 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-02 21:02:52,606 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-02 21:02:52,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:52,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:52,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-12-02 21:02:52,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 21 [2018-12-02 21:02:52,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:52,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:52,646 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-02 21:02:52,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2018-12-02 21:02:52,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:02:52,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:02:52,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 21:02:52,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:02:52,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:02:52,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:41 [2018-12-02 21:03:02,548 WARN L180 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-02 21:03:28,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:28,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:28,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:28,364 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 28 treesize of output 21 [2018-12-02 21:03:28,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,394 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:03:28,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 102 [2018-12-02 21:03:28,403 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:03:28,404 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 0 case distinctions, treesize of input 98 treesize of output 75 [2018-12-02 21:03:28,404 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 82 [2018-12-02 21:03:28,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:28,425 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 69 treesize of output 58 [2018-12-02 21:03:28,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:28,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2018-12-02 21:03:28,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-12-02 21:03:28,446 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,450 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2018-12-02 21:03:28,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:28,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2018-12-02 21:03:28,455 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,460 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,461 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 21:03:28,461 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,466 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:03:28,466 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 24 treesize of output 20 [2018-12-02 21:03:28,466 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,469 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,472 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-12-02 21:03:28,481 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-12-02 21:03:28,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:28,484 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 34 treesize of output 41 [2018-12-02 21:03:28,484 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,488 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:28,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:28,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 77 [2018-12-02 21:03:28,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-12-02 21:03:28,504 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,511 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,517 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-12-02 21:03:28,534 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 27 treesize of output 23 [2018-12-02 21:03:28,534 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,540 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-02 21:03:28,542 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 3 [2018-12-02 21:03:28,543 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,546 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:28,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:03:28,559 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 5 variables, input treesize:149, output treesize:113 [2018-12-02 21:03:28,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:28,917 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 114 treesize of output 135 [2018-12-02 21:03:28,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 21:03:28,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:28,968 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 56 treesize of output 77 [2018-12-02 21:03:28,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 21:03:29,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-02 21:03:29,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:171, output treesize:361 [2018-12-02 21:03:29,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 57 [2018-12-02 21:03:29,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:29,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:29,160 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 54 [2018-12-02 21:03:29,161 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:03:29,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:03:29,234 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 49 treesize of output 43 [2018-12-02 21:03:29,236 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 24 treesize of output 15 [2018-12-02 21:03:29,236 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:29,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:29,243 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 37 treesize of output 33 [2018-12-02 21:03:29,245 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 14 treesize of output 6 [2018-12-02 21:03:29,245 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:29,250 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:29,342 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 127 treesize of output 123 [2018-12-02 21:03:29,343 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 23 treesize of output 15 [2018-12-02 21:03:29,343 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:29,354 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:29,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:29,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:29,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 79 [2018-12-02 21:03:29,405 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 18 treesize of output 10 [2018-12-02 21:03:29,405 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:29,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:29,429 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 50 [2018-12-02 21:03:29,430 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-02 21:03:29,454 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-02 21:03:29,454 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:29,469 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-02 21:03:29,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 133 [2018-12-02 21:03:29,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-12-02 21:03:29,539 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:29,549 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:29,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:29,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:29,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 81 [2018-12-02 21:03:29,625 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 54 [2018-12-02 21:03:29,626 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:03:29,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:03:29,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-12-02 21:03:29,645 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:29,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-12-02 21:03:29,652 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 21:03:29,659 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:03:29,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: 11 dim-0 vars, and 7 xjuncts. [2018-12-02 21:03:29,775 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 16 variables, input treesize:421, output treesize:219 [2018-12-02 21:03:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:03:30,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:03:30,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2018-12-02 21:03:30,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-02 21:03:30,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-02 21:03:30,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1979, Unknown=35, NotChecked=0, Total=2162 [2018-12-02 21:03:30,111 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 47 states. [2018-12-02 21:04:42,122 WARN L180 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 105 DAG size of output: 78 [2018-12-02 21:04:46,740 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2018-12-02 21:04:51,987 WARN L180 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2018-12-02 21:05:02,663 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 105 [2018-12-02 21:05:10,621 WARN L180 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2018-12-02 21:05:15,229 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2018-12-02 21:05:16,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:05:16,506 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2018-12-02 21:05:16,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-02 21:05:16,506 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 49 [2018-12-02 21:05:16,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:05:16,507 INFO L225 Difference]: With dead ends: 132 [2018-12-02 21:05:16,507 INFO L226 Difference]: Without dead ends: 132 [2018-12-02 21:05:16,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 86.4s TimeCoverageRelationStatistics Valid=434, Invalid=5048, Unknown=68, NotChecked=0, Total=5550 [2018-12-02 21:05:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-02 21:05:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2018-12-02 21:05:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-02 21:05:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-12-02 21:05:16,509 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 49 [2018-12-02 21:05:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:05:16,510 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-12-02 21:05:16,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-02 21:05:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-12-02 21:05:16,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 21:05:16,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:05:16,510 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:05:16,510 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:05:16,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:05:16,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1751980893, now seen corresponding path program 1 times [2018-12-02 21:05:16,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:05:16,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:05:16,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:05:16,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:05:16,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:05:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:05:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:05:16,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:05:16,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/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-02 21:05:16,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:05:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:05:16,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:05:16,615 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-02 21:05:16,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 8 treesize of output 7 [2018-12-02 21:05:16,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:16,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:16,620 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-02 21:05:16,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-02 21:05:16,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:16,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:16,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 21:05:16,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:16,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:16,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-02 21:05:16,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-02 21:05:16,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-02 21:05:16,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:16,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:16,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:16,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-02 21:05:16,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:16,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-02 21:05:16,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:16,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:05:16,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-02 21:05:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:05:16,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:05:16,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 13 [2018-12-02 21:05:16,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 21:05:16,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 21:05:16,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:05:16,682 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 14 states. [2018-12-02 21:05:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:05:16,855 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-12-02 21:05:16,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 21:05:16,855 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-12-02 21:05:16,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:05:16,856 INFO L225 Difference]: With dead ends: 116 [2018-12-02 21:05:16,856 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 21:05:16,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-12-02 21:05:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 21:05:16,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2018-12-02 21:05:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-02 21:05:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-12-02 21:05:16,858 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 50 [2018-12-02 21:05:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:05:16,858 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-12-02 21:05:16,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 21:05:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-12-02 21:05:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 21:05:16,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:05:16,859 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:05:16,859 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:05:16,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:05:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash 344336873, now seen corresponding path program 1 times [2018-12-02 21:05:16,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:05:16,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:05:16,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:05:16,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:05:16,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:05:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:05:17,080 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-02 21:05:17,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:05:17,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/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-02 21:05:17,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:05:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:05:17,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:05:17,122 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-02 21:05:17,123 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-02 21:05:17,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:17,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:17,127 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-02 21:05:17,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-02 21:05:20,486 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 21:05:21,492 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#t~ite6.base| Int) (append_~item~0.base Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~item~0.base (store (store (select |c_old(#memory_$Pointer$.base)| append_~item~0.base) 0 (select (select |c_old(#memory_$Pointer$.base)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|)) 4 |append_#t~ite6.base|)))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| append_~item~0.base))))) is different from true [2018-12-02 21:05:21,512 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 39 treesize of output 39 [2018-12-02 21:05:21,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 21:05:21,515 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 18 treesize of output 19 [2018-12-02 21:05:21,515 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,519 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,527 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 38 treesize of output 35 [2018-12-02 21:05:21,529 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 24 treesize of output 16 [2018-12-02 21:05:21,529 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,533 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-12-02 21:05:21,541 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-12-02 21:05:21,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:21,544 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 27 treesize of output 31 [2018-12-02 21:05:21,544 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,548 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-02 21:05:21,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:21,558 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 0 case distinctions, treesize of input 20 treesize of output 23 [2018-12-02 21:05:21,558 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,561 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,564 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,574 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-02 21:05:21,574 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:53, output treesize:28 [2018-12-02 21:05:21,681 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 45 treesize of output 41 [2018-12-02 21:05:21,682 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 19 treesize of output 11 [2018-12-02 21:05:21,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,687 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 40 treesize of output 36 [2018-12-02 21:05:21,688 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 19 treesize of output 11 [2018-12-02 21:05:21,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:05:21,703 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:86, output treesize:64 [2018-12-02 21:05:21,775 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 37 treesize of output 36 [2018-12-02 21:05:21,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,786 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 32 treesize of output 31 [2018-12-02 21:05:21,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:05:21,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:68 [2018-12-02 21:05:21,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:21,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:21,833 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 49 treesize of output 43 [2018-12-02 21:05:21,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,835 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 21:05:21,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,846 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 40 treesize of output 32 [2018-12-02 21:05:21,847 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-12-02 21:05:21,848 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-02 21:05:21,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:05:21,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:05:21,855 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:27 [2018-12-02 21:05:21,883 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 27 treesize of output 23 [2018-12-02 21:05:21,884 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 14 treesize of output 6 [2018-12-02 21:05:21,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-02 21:05:21,889 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:21,892 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:4 [2018-12-02 21:05:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 21:05:21,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:05:21,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2018-12-02 21:05:21,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-02 21:05:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-02 21:05:21,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1084, Unknown=8, NotChecked=66, Total=1260 [2018-12-02 21:05:21,924 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 36 states. [2018-12-02 21:05:27,182 WARN L180 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-12-02 21:05:30,948 WARN L180 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-12-02 21:05:36,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:05:36,349 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-12-02 21:05:36,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 21:05:36,350 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 54 [2018-12-02 21:05:36,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:05:36,350 INFO L225 Difference]: With dead ends: 119 [2018-12-02 21:05:36,350 INFO L226 Difference]: Without dead ends: 119 [2018-12-02 21:05:36,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=335, Invalid=2958, Unknown=17, NotChecked=112, Total=3422 [2018-12-02 21:05:36,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-02 21:05:36,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2018-12-02 21:05:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 21:05:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-12-02 21:05:36,353 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 54 [2018-12-02 21:05:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:05:36,353 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-12-02 21:05:36,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-02 21:05:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-12-02 21:05:36,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 21:05:36,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:05:36,354 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:05:36,354 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:05:36,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:05:36,354 INFO L82 PathProgramCache]: Analyzing trace with hash 344337645, now seen corresponding path program 1 times [2018-12-02 21:05:36,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:05:36,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:05:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:05:36,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:05:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:05:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:05:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:05:37,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:05:37,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/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-02 21:05:37,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:05:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:05:37,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:05:37,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:37,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:37,368 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-02 21:05:37,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:37,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:37,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-12-02 21:05:37,404 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 13 treesize of output 10 [2018-12-02 21:05:37,406 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 10 treesize of output 9 [2018-12-02 21:05:37,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:37,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:37,423 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-02 21:05:37,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-12-02 21:05:37,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 21:05:37,464 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-02 21:05:37,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:37,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:37,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 32 [2018-12-02 21:05:37,481 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 21 treesize of output 20 [2018-12-02 21:05:37,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:37,497 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26 [2018-12-02 21:05:37,497 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 21:05:37,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:05:37,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:05:37,515 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:36, output treesize:57 [2018-12-02 21:05:48,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:48,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:48,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 21:05:48,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:48,188 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 1 case distinctions, treesize of input 78 treesize of output 77 [2018-12-02 21:05:48,190 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-12-02 21:05:48,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:48,193 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 32 treesize of output 55 [2018-12-02 21:05:48,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:48,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:48,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:48,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:48,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-12-02 21:05:48,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 82 [2018-12-02 21:05:48,224 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:48,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:48,249 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:05:48,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:48,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 86 [2018-12-02 21:05:48,252 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:48,263 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:48,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:48,272 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:05:48,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 107 [2018-12-02 21:05:48,279 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 0 case distinctions, treesize of input 103 treesize of output 76 [2018-12-02 21:05:48,280 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:48,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:48,295 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 69 treesize of output 100 [2018-12-02 21:05:48,296 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:48,307 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 61 treesize of output 56 [2018-12-02 21:05:48,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:48,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2018-12-02 21:05:48,314 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 0 case distinctions, treesize of input 53 treesize of output 48 [2018-12-02 21:05:48,314 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:05:48,322 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:05:48,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-12-02 21:05:48,329 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:48,333 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:05:48,338 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:05:48,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-12-02 21:05:48,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 3 [2018-12-02 21:05:48,355 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:48,359 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:48,361 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 69 treesize of output 65 [2018-12-02 21:05:48,362 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 25 treesize of output 21 [2018-12-02 21:05:48,362 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:48,367 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:48,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:05:48,381 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:143, output treesize:111 [2018-12-02 21:05:49,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:49,115 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 2 case distinctions, treesize of input 124 treesize of output 149 [2018-12-02 21:05:49,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 21:05:49,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:49,183 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 2 case distinctions, treesize of input 70 treesize of output 87 [2018-12-02 21:05:49,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 21:05:49,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-12-02 21:05:49,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:195, output treesize:434 [2018-12-02 21:05:49,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 75 [2018-12-02 21:05:49,431 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 41 treesize of output 30 [2018-12-02 21:05:49,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:49,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:49,524 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 120 treesize of output 106 [2018-12-02 21:05:49,526 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 89 treesize of output 72 [2018-12-02 21:05:49,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:49,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:49,615 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 149 treesize of output 139 [2018-12-02 21:05:49,618 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 64 treesize of output 51 [2018-12-02 21:05:49,618 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:49,632 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:49,705 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 137 treesize of output 129 [2018-12-02 21:05:49,707 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 41 treesize of output 30 [2018-12-02 21:05:49,707 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:49,721 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:05:49,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-12-02 21:05:49,788 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:490, output treesize:398 [2018-12-02 21:05:50,261 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2018-12-02 21:05:50,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:50,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:50,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 125 [2018-12-02 21:05:50,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:50,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:50,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:50,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 87 [2018-12-02 21:05:50,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:50,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:50,399 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 69 treesize of output 84 [2018-12-02 21:05:50,399 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:50,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-02 21:05:50,462 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:224, output treesize:201 [2018-12-02 21:05:50,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:50,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:50,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:50,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:50,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 108 [2018-12-02 21:05:50,656 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 107 [2018-12-02 21:05:50,658 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-02 21:05:50,747 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-02 21:05:50,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:50,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:50,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:50,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 82 [2018-12-02 21:05:50,810 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-02 21:05:50,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-12-02 21:05:51,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-12-02 21:05:51,063 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:240, output treesize:405 [2018-12-02 21:05:59,302 WARN L180 SmtUtils]: Spent 8.10 s on a formula simplification. DAG size of input: 115 DAG size of output: 48 [2018-12-02 21:05:59,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:59,308 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 65 treesize of output 50 [2018-12-02 21:05:59,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:59,311 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 35 treesize of output 29 [2018-12-02 21:05:59,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:59,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:59,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-12-02 21:05:59,319 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-02 21:05:59,323 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-02 21:05:59,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:59,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:59,339 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 70 treesize of output 65 [2018-12-02 21:05:59,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 13 treesize of output 5 [2018-12-02 21:05:59,341 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:59,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:05:59,350 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 33 treesize of output 23 [2018-12-02 21:05:59,350 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:05:59,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-02 21:05:59,357 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:05:59,362 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:05:59,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-02 21:05:59,371 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:136, output treesize:42 [2018-12-02 21:05:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:05:59,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:05:59,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2018-12-02 21:05:59,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-02 21:05:59,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-02 21:05:59,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2894, Unknown=5, NotChecked=0, Total=3080 [2018-12-02 21:05:59,476 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 56 states. [2018-12-02 21:06:21,502 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-12-02 21:06:22,465 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-12-02 21:06:22,814 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2018-12-02 21:06:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:06:27,947 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-12-02 21:06:27,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-02 21:06:27,947 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 54 [2018-12-02 21:06:27,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:06:27,949 INFO L225 Difference]: With dead ends: 128 [2018-12-02 21:06:27,949 INFO L226 Difference]: Without dead ends: 128 [2018-12-02 21:06:27,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2189 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=595, Invalid=7772, Unknown=5, NotChecked=0, Total=8372 [2018-12-02 21:06:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-02 21:06:27,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 101. [2018-12-02 21:06:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 21:06:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-12-02 21:06:27,954 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 54 [2018-12-02 21:06:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:06:27,954 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-12-02 21:06:27,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-02 21:06:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-12-02 21:06:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 21:06:27,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:06:27,955 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:06:27,955 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:06:27,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:06:27,955 INFO L82 PathProgramCache]: Analyzing trace with hash 344337646, now seen corresponding path program 1 times [2018-12-02 21:06:27,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:06:27,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:06:27,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:06:27,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:06:27,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:06:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:06:28,361 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-02 21:06:28,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:06:28,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:06:28,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:06:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:06:28,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:06:28,406 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-02 21:06:28,408 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-02 21:06:28,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:28,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:28,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:28,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 21:06:28,495 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-02 21:06:28,497 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-02 21:06:28,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:28,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:28,504 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-02 21:06:28,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-12-02 21:06:28,594 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 23 treesize of output 18 [2018-12-02 21:06:28,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:06:28,597 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 18 treesize of output 25 [2018-12-02 21:06:28,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:28,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:28,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:06:28,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:39 [2018-12-02 21:06:29,522 WARN L180 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-02 21:06:29,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-12-02 21:06:29,545 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-12-02 21:06:29,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:06:29,566 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 18 treesize of output 17 [2018-12-02 21:06:29,566 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:29,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:06:29,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 21:06:29,593 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:62, output treesize:109 [2018-12-02 21:06:30,786 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 42 [2018-12-02 21:06:30,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-12-02 21:06:30,838 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-02 21:06:30,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:06:30,841 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-12-02 21:06:30,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-12-02 21:06:30,843 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:30,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:30,850 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:30,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:30,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2018-12-02 21:06:30,900 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-12-02 21:06:30,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:06:30,904 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 42 [2018-12-02 21:06:30,904 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:30,910 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:30,919 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:06:30,919 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 38 treesize of output 35 [2018-12-02 21:06:30,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:06:30,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2018-12-02 21:06:30,923 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:30,928 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:30,933 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:30,938 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 66 treesize of output 62 [2018-12-02 21:06:30,940 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-12-02 21:06:30,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:06:30,943 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 39 [2018-12-02 21:06:30,943 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:30,948 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:30,960 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:06:30,960 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 49 treesize of output 48 [2018-12-02 21:06:30,963 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 29 treesize of output 22 [2018-12-02 21:06:30,963 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:30,969 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:30,976 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:30,999 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 3 xjuncts. [2018-12-02 21:06:30,999 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:126, output treesize:94 [2018-12-02 21:06:31,386 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 75 treesize of output 74 [2018-12-02 21:06:31,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:31,407 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 63 treesize of output 62 [2018-12-02 21:06:31,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:31,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:06:31,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:139, output treesize:137 [2018-12-02 21:06:31,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:06:31,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:06:31,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 89 [2018-12-02 21:06:31,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:31,496 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 21:06:31,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:31,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2018-12-02 21:06:31,531 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2018-12-02 21:06:31,532 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-02 21:06:31,538 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:06:31,549 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:06:31,550 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 49 treesize of output 55 [2018-12-02 21:06:31,552 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 44 treesize of output 33 [2018-12-02 21:06:31,552 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:31,556 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:31,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:06:31,564 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:179, output treesize:46 [2018-12-02 21:06:31,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-02 21:06:31,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 21:06:31,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:31,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 21:06:31,617 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:31,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:31,624 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 26 treesize of output 22 [2018-12-02 21:06:31,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 21:06:31,626 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:31,629 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-02 21:06:31,629 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:31,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:31,633 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-02 21:06:31,633 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:9 [2018-12-02 21:06:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:06:31,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:06:31,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [19] total 39 [2018-12-02 21:06:31,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-02 21:06:31,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-02 21:06:31,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1435, Unknown=1, NotChecked=0, Total=1560 [2018-12-02 21:06:31,687 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 40 states. [2018-12-02 21:06:35,078 WARN L180 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-12-02 21:06:36,449 WARN L180 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2018-12-02 21:06:44,569 WARN L180 SmtUtils]: Spent 7.22 s on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2018-12-02 21:06:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:06:48,102 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-12-02 21:06:48,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-02 21:06:48,102 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 54 [2018-12-02 21:06:48,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:06:48,102 INFO L225 Difference]: With dead ends: 126 [2018-12-02 21:06:48,102 INFO L226 Difference]: Without dead ends: 126 [2018-12-02 21:06:48,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=402, Invalid=4015, Unknown=5, NotChecked=0, Total=4422 [2018-12-02 21:06:48,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-02 21:06:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 103. [2018-12-02 21:06:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 21:06:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2018-12-02 21:06:48,105 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 54 [2018-12-02 21:06:48,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:06:48,105 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2018-12-02 21:06:48,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-02 21:06:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-12-02 21:06:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 21:06:48,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:06:48,105 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:06:48,105 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:06:48,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:06:48,106 INFO L82 PathProgramCache]: Analyzing trace with hash -626068770, now seen corresponding path program 1 times [2018-12-02 21:06:48,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:06:48,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:06:48,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:06:48,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:06:48,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:06:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:06:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:06:48,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:06:48,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:06:48,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:06:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:06:48,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:06:48,414 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-02 21:06:48,415 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-02 21:06:48,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:48,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:48,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:48,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-02 21:06:50,179 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-02 21:06:50,183 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-02 21:06:50,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, 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-02 21:06:50,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:50,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:50,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:06:50,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:67 [2018-12-02 21:06:50,783 WARN L180 SmtUtils]: Spent 567.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-02 21:06:50,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:06:50,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:06:50,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 15 treesize of output 8 [2018-12-02 21:06:50,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:50,822 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 42 treesize of output 46 [2018-12-02 21:06:50,823 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-12-02 21:06:50,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:06:50,826 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 39 [2018-12-02 21:06:50,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:50,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:50,839 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:06:50,839 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 49 treesize of output 48 [2018-12-02 21:06:50,841 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 29 treesize of output 22 [2018-12-02 21:06:50,842 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:50,846 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:50,850 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:50,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:50,857 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:82, output treesize:30 [2018-12-02 21:06:50,952 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 35 treesize of output 29 [2018-12-02 21:06:50,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-12-02 21:06:50,954 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-02 21:06:50,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:06:50,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:06:50,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:33 [2018-12-02 21:06:51,018 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:06:51,019 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 42 [2018-12-02 21:06:51,021 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 31 treesize of output 22 [2018-12-02 21:06:51,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:51,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:51,029 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-02 21:06:51,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2018-12-02 21:06:51,054 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 26 treesize of output 22 [2018-12-02 21:06:51,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 21:06:51,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:51,059 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-02 21:06:51,059 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:06:51,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:51,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:06:51,064 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-12-02 21:06:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:06:51,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:06:51,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2018-12-02 21:06:51,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-02 21:06:51,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-02 21:06:51,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=926, Unknown=3, NotChecked=0, Total=1056 [2018-12-02 21:06:51,098 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 33 states. [2018-12-02 21:06:57,018 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-12-02 21:07:01,932 WARN L180 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-02 21:07:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:07:02,295 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-12-02 21:07:02,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 21:07:02,296 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 58 [2018-12-02 21:07:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:07:02,297 INFO L225 Difference]: With dead ends: 122 [2018-12-02 21:07:02,297 INFO L226 Difference]: Without dead ends: 122 [2018-12-02 21:07:02,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=317, Invalid=2329, Unknown=6, NotChecked=0, Total=2652 [2018-12-02 21:07:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-02 21:07:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2018-12-02 21:07:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-02 21:07:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2018-12-02 21:07:02,300 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 58 [2018-12-02 21:07:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:07:02,300 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2018-12-02 21:07:02,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-02 21:07:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2018-12-02 21:07:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 21:07:02,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:07:02,301 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:07:02,301 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:07:02,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:07:02,301 INFO L82 PathProgramCache]: Analyzing trace with hash -626080717, now seen corresponding path program 1 times [2018-12-02 21:07:02,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:07:02,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:07:02,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:07:02,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:07:02,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:07:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:07:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 21:07:02,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:07:02,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:07:02,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:07:02,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:07:02,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:07:02,327 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 5 states. [2018-12-02 21:07:02,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:07:02,386 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-12-02 21:07:02,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:07:02,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-02 21:07:02,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:07:02,387 INFO L225 Difference]: With dead ends: 116 [2018-12-02 21:07:02,387 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 21:07:02,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:07:02,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 21:07:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2018-12-02 21:07:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-02 21:07:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2018-12-02 21:07:02,388 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 58 [2018-12-02 21:07:02,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:07:02,388 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2018-12-02 21:07:02,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:07:02,388 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2018-12-02 21:07:02,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 21:07:02,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:07:02,389 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:07:02,389 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:07:02,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:07:02,389 INFO L82 PathProgramCache]: Analyzing trace with hash -626080716, now seen corresponding path program 1 times [2018-12-02 21:07:02,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:07:02,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:07:02,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:07:02,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:07:02,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:07:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:07:02,839 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-02 21:07:02,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:07:02,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:07:02,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:07:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:07:02,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:07:02,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 21:07:02,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 21:07:02,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:02,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:02,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:02,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 21:07:03,011 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-02 21:07:03,013 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-02 21:07:03,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:03,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:03,021 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-02 21:07:03,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-12-02 21:07:03,133 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 29 treesize of output 24 [2018-12-02 21:07:03,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:03,137 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 24 treesize of output 31 [2018-12-02 21:07:03,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:03,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:03,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:07:03,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:45 [2018-12-02 21:07:04,076 WARN L180 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-12-02 21:07:04,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2018-12-02 21:07:04,100 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2018-12-02 21:07:04,101 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:07:04,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-12-02 21:07:04,122 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:04,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:07:04,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 21:07:04,150 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:121 [2018-12-02 21:07:05,752 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-02 21:07:05,802 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 50 treesize of output 41 [2018-12-02 21:07:05,804 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-12-02 21:07:05,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:05,809 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-12-02 21:07:05,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-12-02 21:07:05,812 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:05,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:05,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:05,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:05,864 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 72 treesize of output 68 [2018-12-02 21:07:05,865 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-12-02 21:07:05,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:05,868 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 39 [2018-12-02 21:07:05,868 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:05,872 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:05,884 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:07:05,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 65 [2018-12-02 21:07:05,886 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 46 treesize of output 37 [2018-12-02 21:07:05,887 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:05,892 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:05,898 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:05,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 67 [2018-12-02 21:07:05,903 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-12-02 21:07:05,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:05,907 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 42 [2018-12-02 21:07:05,907 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:05,914 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:05,922 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:07:05,922 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 38 treesize of output 35 [2018-12-02 21:07:05,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:05,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2018-12-02 21:07:05,926 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:05,930 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:05,935 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:05,953 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 2 xjuncts. [2018-12-02 21:07:05,953 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:138, output treesize:63 [2018-12-02 21:07:06,332 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 77 treesize of output 76 [2018-12-02 21:07:06,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:06,355 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 65 treesize of output 64 [2018-12-02 21:07:06,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:06,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:07:06,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:143, output treesize:141 [2018-12-02 21:07:06,452 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 21:07:06,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:06,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:06,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:06,456 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 97 treesize of output 91 [2018-12-02 21:07:06,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:06,498 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 81 treesize of output 69 [2018-12-02 21:07:06,501 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2018-12-02 21:07:06,501 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-02 21:07:06,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:07:06,519 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:07:06,520 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 49 treesize of output 55 [2018-12-02 21:07:06,522 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 44 treesize of output 33 [2018-12-02 21:07:06,522 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:06,526 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:06,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:07:06,532 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:183, output treesize:48 [2018-12-02 21:07:06,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-02 21:07:06,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 21:07:06,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:06,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 21:07:06,678 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:06,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:06,685 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 26 treesize of output 22 [2018-12-02 21:07:06,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 21:07:06,687 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:06,691 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-02 21:07:06,691 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:06,692 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:06,695 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-02 21:07:06,695 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:9 [2018-12-02 21:07:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:07:06,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:07:06,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [21] total 42 [2018-12-02 21:07:06,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-02 21:07:06,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-02 21:07:06,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1667, Unknown=1, NotChecked=0, Total=1806 [2018-12-02 21:07:06,752 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 43 states. [2018-12-02 21:07:10,400 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2018-12-02 21:07:11,910 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-02 21:07:14,554 WARN L180 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-12-02 21:07:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:07:19,643 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-12-02 21:07:19,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 21:07:19,643 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 58 [2018-12-02 21:07:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:07:19,644 INFO L225 Difference]: With dead ends: 122 [2018-12-02 21:07:19,644 INFO L226 Difference]: Without dead ends: 122 [2018-12-02 21:07:19,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=436, Invalid=4529, Unknown=5, NotChecked=0, Total=4970 [2018-12-02 21:07:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-02 21:07:19,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 111. [2018-12-02 21:07:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-02 21:07:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-12-02 21:07:19,646 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 58 [2018-12-02 21:07:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:07:19,646 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-12-02 21:07:19,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-02 21:07:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-12-02 21:07:19,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 21:07:19,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:07:19,646 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:07:19,646 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:07:19,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:07:19,647 INFO L82 PathProgramCache]: Analyzing trace with hash 2066704733, now seen corresponding path program 1 times [2018-12-02 21:07:19,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:07:19,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:07:19,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:07:19,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:07:19,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:07:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:07:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 21:07:19,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:07:19,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:07:19,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:07:19,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:07:19,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:07:19,666 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 5 states. [2018-12-02 21:07:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:07:19,723 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-12-02 21:07:19,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:07:19,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-02 21:07:19,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:07:19,723 INFO L225 Difference]: With dead ends: 115 [2018-12-02 21:07:19,724 INFO L226 Difference]: Without dead ends: 115 [2018-12-02 21:07:19,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:07:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-02 21:07:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-12-02 21:07:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-02 21:07:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2018-12-02 21:07:19,726 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 59 [2018-12-02 21:07:19,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:07:19,726 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2018-12-02 21:07:19,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:07:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2018-12-02 21:07:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 21:07:19,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:07:19,726 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:07:19,726 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:07:19,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:07:19,726 INFO L82 PathProgramCache]: Analyzing trace with hash 2066334302, now seen corresponding path program 1 times [2018-12-02 21:07:19,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:07:19,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:07:19,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:07:19,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:07:19,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:07:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:07:20,877 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-02 21:07:20,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:07:20,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:07:20,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:07:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:07:20,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:07:20,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 6 treesize of output 5 [2018-12-02 21:07:20,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:20,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:20,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:07:20,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 21:07:20,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 21:07:20,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:20,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:20,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:20,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-02 21:07:21,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-12-02 21:07:21,033 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 17 treesize of output 18 [2018-12-02 21:07:21,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:21,048 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-02 21:07:21,048 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:21,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:21,064 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-02 21:07:21,066 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-02 21:07:21,066 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:21,067 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:21,074 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-02 21:07:21,074 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:40, output treesize:37 [2018-12-02 21:07:21,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:21,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:21,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 21:07:21,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:21,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:21,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:39 [2018-12-02 21:07:27,474 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 38 [2018-12-02 21:07:43,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:43,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:43,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 21:07:43,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:43,789 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 67 treesize of output 55 [2018-12-02 21:07:43,791 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-12-02 21:07:43,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:43,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2018-12-02 21:07:43,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:43,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:43,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:43,818 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 38 treesize of output 29 [2018-12-02 21:07:43,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:43,822 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 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-02 21:07:43,823 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:07:43,830 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:07:43,840 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:07:43,848 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 58 treesize of output 58 [2018-12-02 21:07:43,850 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 21:07:43,856 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 18 treesize of output 19 [2018-12-02 21:07:43,856 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:43,862 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:43,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:43,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:43,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 59 [2018-12-02 21:07:43,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2018-12-02 21:07:43,891 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:43,901 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:43,912 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:43,958 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 21:07:43,958 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:43,964 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 72 [2018-12-02 21:07:43,966 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-12-02 21:07:43,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:43,970 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 42 [2018-12-02 21:07:43,970 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:43,976 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:43,989 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:07:43,991 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 45 treesize of output 50 [2018-12-02 21:07:43,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:43,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2018-12-02 21:07:43,995 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:44,002 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:44,010 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:44,018 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 79 treesize of output 83 [2018-12-02 21:07:44,020 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-12-02 21:07:44,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:44,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 26 treesize of output 39 [2018-12-02 21:07:44,025 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:44,029 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:44,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:44,049 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:07:44,051 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 60 treesize of output 79 [2018-12-02 21:07:44,053 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 29 treesize of output 22 [2018-12-02 21:07:44,053 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:44,062 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:44,073 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:44,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:07:44,097 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 6 variables, input treesize:126, output treesize:99 [2018-12-02 21:07:44,735 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-12-02 21:07:44,740 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 105 treesize of output 104 [2018-12-02 21:07:44,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:44,793 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 69 treesize of output 68 [2018-12-02 21:07:44,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:44,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 21:07:44,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:175, output treesize:173 [2018-12-02 21:07:44,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:44,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:44,970 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 125 treesize of output 119 [2018-12-02 21:07:44,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:44,971 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 21:07:44,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:44,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:45,001 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:07:45,006 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 80 treesize of output 122 [2018-12-02 21:07:45,008 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 60 treesize of output 49 [2018-12-02 21:07:45,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:45,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:45,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:45,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:45,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:07:45,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 91 [2018-12-02 21:07:45,048 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 96 [2018-12-02 21:07:45,049 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-02 21:07:45,082 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-02 21:07:45,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-02 21:07:45,110 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:215, output treesize:241 [2018-12-02 21:07:45,499 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-12-02 21:07:45,502 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 22 [2018-12-02 21:07:45,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:45,515 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-02 21:07:45,516 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:45,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:45,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:07:45,538 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:75, output treesize:45 [2018-12-02 21:07:45,669 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 39 treesize of output 39 [2018-12-02 21:07:45,672 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:07:45,672 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 11 [2018-12-02 21:07:45,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:45,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 21:07:45,682 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:45,685 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-02 21:07:45,685 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:07:45,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:45,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:07:45,690 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:3 [2018-12-02 21:07:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:07:45,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:07:45,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 46 [2018-12-02 21:07:45,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-02 21:07:45,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-02 21:07:45,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1993, Unknown=14, NotChecked=0, Total=2162 [2018-12-02 21:07:45,724 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 47 states. [2018-12-02 21:08:09,326 WARN L180 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-12-02 21:08:12,116 WARN L180 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-02 21:08:17,849 WARN L180 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-12-02 21:08:32,818 WARN L180 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2018-12-02 21:08:36,966 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-12-02 21:08:37,952 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2018-12-02 21:08:38,526 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2018-12-02 21:08:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:08:39,879 INFO L93 Difference]: Finished difference Result 192 states and 203 transitions. [2018-12-02 21:08:39,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-02 21:08:39,880 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 59 [2018-12-02 21:08:39,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:08:39,880 INFO L225 Difference]: With dead ends: 192 [2018-12-02 21:08:39,881 INFO L226 Difference]: Without dead ends: 192 [2018-12-02 21:08:39,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 44.9s TimeCoverageRelationStatistics Valid=473, Invalid=5060, Unknown=17, NotChecked=0, Total=5550 [2018-12-02 21:08:39,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-02 21:08:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 119. [2018-12-02 21:08:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-02 21:08:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2018-12-02 21:08:39,883 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 59 [2018-12-02 21:08:39,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:08:39,883 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2018-12-02 21:08:39,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-02 21:08:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2018-12-02 21:08:39,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 21:08:39,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:08:39,883 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:08:39,883 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:08:39,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:08:39,884 INFO L82 PathProgramCache]: Analyzing trace with hash -356662591, now seen corresponding path program 1 times [2018-12-02 21:08:39,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:08:39,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:08:39,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:08:39,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:08:39,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:08:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:08:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:08:40,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:08:40,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:08:40,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:08:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:08:40,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:08:40,272 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-02 21:08:40,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:08:40,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:08:40,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:08:40,299 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-02 21:08:40,300 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-02 21:08:40,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:08:40,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:08:40,305 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-02 21:08:40,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-12-02 21:08:40,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:08:40,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:08:40,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 21:08:40,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:08:40,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:08:40,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-12-02 21:08:42,499 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-02 21:08:52,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:08:52,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:08:52,242 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-02 21:08:52,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:08:52,251 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 35 treesize of output 39 [2018-12-02 21:08:52,253 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 21:08:52,255 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 18 treesize of output 19 [2018-12-02 21:08:52,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:08:52,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:08:52,266 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 38 treesize of output 35 [2018-12-02 21:08:52,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-12-02 21:08:52,268 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:08:52,271 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:08:52,274 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:08:52,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:08:52,279 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:16 [2018-12-02 21:08:52,366 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 23 treesize of output 19 [2018-12-02 21:08:52,367 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 19 treesize of output 11 [2018-12-02 21:08:52,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:08:52,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:08:52,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:08:52,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:27 [2018-12-02 21:08:52,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:08:52,424 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 32 treesize of output 32 [2018-12-02 21:08:52,426 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-12-02 21:08:52,427 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-02 21:08:52,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:08:52,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:08:52,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:32 [2018-12-02 21:08:52,486 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-02 21:08:52,488 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 14 treesize of output 6 [2018-12-02 21:08:52,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:08:52,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-02 21:08:52,492 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:08:52,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:08:52,496 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-02 21:08:52,496 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:36, output treesize:10 [2018-12-02 21:08:52,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:08:52,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-02 21:08:52,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:08:52,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:08:52,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-02 21:08:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:08:52,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:08:52,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 39 [2018-12-02 21:08:52,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-02 21:08:52,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-02 21:08:52,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1407, Unknown=11, NotChecked=0, Total=1560 [2018-12-02 21:08:52,560 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand 40 states. [2018-12-02 21:09:08,108 WARN L180 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2018-12-02 21:09:12,515 WARN L180 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-12-02 21:09:22,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:09:22,617 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-12-02 21:09:22,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 21:09:22,617 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 60 [2018-12-02 21:09:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:09:22,618 INFO L225 Difference]: With dead ends: 168 [2018-12-02 21:09:22,619 INFO L226 Difference]: Without dead ends: 168 [2018-12-02 21:09:22,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=413, Invalid=3235, Unknown=12, NotChecked=0, Total=3660 [2018-12-02 21:09:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-02 21:09:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 122. [2018-12-02 21:09:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-02 21:09:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-12-02 21:09:22,621 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 60 [2018-12-02 21:09:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:09:22,622 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-12-02 21:09:22,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-02 21:09:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-12-02 21:09:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 21:09:22,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:09:22,622 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:09:22,622 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION]=== [2018-12-02 21:09:22,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:09:22,622 INFO L82 PathProgramCache]: Analyzing trace with hash -368145965, now seen corresponding path program 1 times [2018-12-02 21:09:22,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:09:22,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:09:22,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:22,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:09:22,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:09:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:09:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:09:22,651 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 21:09:22,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:09:22 BoogieIcfgContainer [2018-12-02 21:09:22,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:09:22,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:09:22,674 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:09:22,674 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:09:22,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:01:38" (3/4) ... [2018-12-02 21:09:22,676 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 21:09:22,705 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8745153f-f611-413d-bf8e-1453489b7c8b/bin-2019/uautomizer/witness.graphml [2018-12-02 21:09:22,705 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:09:22,705 INFO L168 Benchmark]: Toolchain (without parser) took 464442.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 265.3 MB). Free memory was 956.0 MB in the beginning and 795.6 MB in the end (delta: 160.4 MB). Peak memory consumption was 425.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:09:22,706 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:09:22,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:09:22,706 INFO L168 Benchmark]: Boogie Preprocessor took 30.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 21:09:22,706 INFO L168 Benchmark]: RCFGBuilder took 309.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2018-12-02 21:09:22,706 INFO L168 Benchmark]: TraceAbstraction took 463819.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.8 MB). Free memory was 1.1 GB in the beginning and 795.6 MB in the end (delta: 258.4 MB). Peak memory consumption was 395.2 MB. Max. memory is 11.5 GB. [2018-12-02 21:09:22,706 INFO L168 Benchmark]: Witness Printer took 30.63 ms. Allocated memory is still 1.3 GB. Free memory is still 795.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:09:22,707 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 250.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 309.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 463819.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.8 MB). Free memory was 1.1 GB in the beginning and 795.6 MB in the end (delta: 258.4 MB). Peak memory consumption was 395.2 MB. Max. memory is 11.5 GB. * Witness Printer took 30.63 ms. Allocated memory is still 1.3 GB. Free memory is still 795.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 648]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L635] struct item *list = ((void *)0); VAL [list={10:0}] [L637] CALL append(&list) VAL [plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628] EXPR item->next VAL [item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={14:0}, item={11:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={14:0}, item={11:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L631] *plist = item VAL [item={11:0}, malloc(sizeof *item)={14:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L637] RET append(&list) VAL [list={10:0}] [L638] COND TRUE __VERIFIER_nondet_int() [L637] CALL append(&list) VAL [plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={12:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={11:0}, item={12:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L627] item->next = *plist VAL [\read(**plist)={11:0}, item={12:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L628] EXPR item->next VAL [item={12:0}, item->next={11:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [item={12:0}, item->next={11:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L629] EXPR item->next VAL [item={12:0}, item->next={11:0}, item->next={11:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L629] EXPR item->next->data VAL [item={12:0}, item->next={11:0}, item->next={11:0}, item->next->data={14:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={14:0}, item={12:0}, item->next={11:0}, item->next={11:0}, item->next->data={14:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={14:0}, item={12:0}, item->next={11:0}, item->next={11:0}, item->next->data={14:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L631] *plist = item VAL [item={12:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L637] RET append(&list) VAL [list={10:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={12:0}, list={10:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={12:0}, list={10:0}] [L640] EXPR list->next VAL [\read(*list)={12:0}, list={10:0}, list->next={11:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={12:0}, list={10:0}, next={11:0}] [L641] EXPR list->data VAL [\read(*list)={12:0}, list={10:0}, list->data={14:0}, next={11:0}] [L641] free(list->data) VAL [\read(*list)={12:0}, list={10:0}, list->data={14:0}, next={11:0}] [L641] free(list->data) [L642] EXPR \read(*list) VAL [\read(*list)={12:0}, list={10:0}, next={11:0}] [L642] free(list) VAL [\read(*list)={12:0}, list={10:0}, next={11:0}] [L642] free(list) [L643] list = next VAL [list={10:0}, next={11:0}] [L645] \read(*list) VAL [\read(*list)={11:0}, list={10:0}, next={11:0}] [L645] COND TRUE \read(*list) [L646] EXPR \read(*list) VAL [\read(*list)={11:0}, list={10:0}, next={11:0}] [L646] EXPR list->next VAL [\read(*list)={11:0}, list={10:0}, list->next={0:0}, next={11:0}] [L646] struct item *next = list->next; [L647] COND TRUE !next VAL [list={10:0}, next={11:0}, next={0:0}] [L648] EXPR \read(*list) VAL [\read(*list)={11:0}, list={10:0}, next={0:0}, next={11:0}] [L648] EXPR list->data VAL [\read(*list)={11:0}, list={10:0}, list->data={14:0}, next={11:0}, next={0:0}] [L648] free(list->data) VAL [\read(*list)={11:0}, list={10:0}, list->data={14:0}, next={11:0}, next={0:0}] [L648] free(list->data) VAL [\read(*list)={11:0}, list={10:0}, list->data={14:0}, next={11:0}, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 106 locations, 51 error locations. UNSAFE Result, 463.7s OverallTime, 39 OverallIterations, 2 TraceHistogramMax, 332.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1895 SDtfs, 4547 SDslu, 12147 SDs, 0 SdLazy, 20165 SolverSat, 966 SolverUnsat, 153 SolverUnknown, 0 SolverNotchecked, 187.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1601 GetRequests, 512 SyntacticMatches, 56 SemanticMatches, 1033 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13538 ImplicationChecksByTransitivity, 264.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=38, 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.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 517 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 129.3s InterpolantComputationTime, 2137 NumberOfCodeBlocks, 2137 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 2024 ConstructedInterpolants, 178 QuantifiedInterpolants, 2410613 SizeOfPredicates, 366 NumberOfNonLiveVariables, 4138 ConjunctsInSsa, 1065 ConjunctsInUnsatCore, 53 InterpolantComputations, 25 PerfectInterpolantSequences, 195/420 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...