./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memcleanup.prp --file /storage/repos/svcomp/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a74485b04ec8988328f8bc8f67ebe898d81e7141 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 21:05:39,621 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 21:05:39,623 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 21:05:39,635 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 21:05:39,635 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 21:05:39,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 21:05:39,637 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 21:05:39,639 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 21:05:39,641 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 21:05:39,642 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 21:05:39,643 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 21:05:39,644 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 21:05:39,645 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 21:05:39,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 21:05:39,647 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 21:05:39,648 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 21:05:39,649 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 21:05:39,651 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 21:05:39,653 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 21:05:39,655 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 21:05:39,656 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 21:05:39,657 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 21:05:39,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 21:05:39,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 21:05:39,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 21:05:39,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 21:05:39,663 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 21:05:39,664 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 21:05:39,664 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 21:05:39,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 21:05:39,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 21:05:39,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 21:05:39,667 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 21:05:39,667 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 21:05:39,668 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 21:05:39,669 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 21:05:39,669 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-01-14 21:05:39,684 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 21:05:39,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 21:05:39,685 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 21:05:39,686 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 21:05:39,686 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 21:05:39,686 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 21:05:39,687 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 21:05:39,687 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 21:05:39,687 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 21:05:39,687 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 21:05:39,687 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 21:05:39,687 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 21:05:39,688 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 21:05:39,688 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 21:05:39,689 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 21:05:39,689 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 21:05:39,689 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 21:05:39,690 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 21:05:39,690 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 21:05:39,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:05:39,690 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 21:05:39,690 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 21:05:39,690 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 21:05:39,691 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 21:05:39,691 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-memcleanup) ) 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 -> a74485b04ec8988328f8bc8f67ebe898d81e7141 [2019-01-14 21:05:39,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 21:05:39,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 21:05:39,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 21:05:39,753 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 21:05:39,754 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 21:05:39,755 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2019-01-14 21:05:39,820 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7394a4309/9e791ca7aa124f7dbfdac4a65638d029/FLAG607f69005 [2019-01-14 21:05:40,310 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 21:05:40,310 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2019-01-14 21:05:40,345 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7394a4309/9e791ca7aa124f7dbfdac4a65638d029/FLAG607f69005 [2019-01-14 21:05:40,621 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7394a4309/9e791ca7aa124f7dbfdac4a65638d029 [2019-01-14 21:05:40,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 21:05:40,626 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 21:05:40,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 21:05:40,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 21:05:40,632 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 21:05:40,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:05:40" (1/1) ... [2019-01-14 21:05:40,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30305280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:40, skipping insertion in model container [2019-01-14 21:05:40,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:05:40" (1/1) ... [2019-01-14 21:05:40,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 21:05:40,693 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 21:05:41,015 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:05:41,028 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 21:05:41,094 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:05:41,230 INFO L195 MainTranslator]: Completed translation [2019-01-14 21:05:41,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:41 WrapperNode [2019-01-14 21:05:41,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 21:05:41,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 21:05:41,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 21:05:41,232 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 21:05:41,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:41" (1/1) ... [2019-01-14 21:05:41,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:41" (1/1) ... [2019-01-14 21:05:41,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:41" (1/1) ... [2019-01-14 21:05:41,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:41" (1/1) ... [2019-01-14 21:05:41,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:41" (1/1) ... [2019-01-14 21:05:41,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:41" (1/1) ... [2019-01-14 21:05:41,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:41" (1/1) ... [2019-01-14 21:05:41,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 21:05:41,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 21:05:41,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 21:05:41,294 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 21:05:41,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:05:41,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 21:05:41,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 21:05:41,343 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 21:05:41,344 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 21:05:41,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 21:05:41,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 21:05:41,344 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 21:05:41,344 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 21:05:41,344 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 21:05:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 21:05:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 21:05:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 21:05:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 21:05:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 21:05:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 21:05:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 21:05:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 21:05:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 21:05:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 21:05:41,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 21:05:41,347 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 21:05:41,347 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 21:05:41,347 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 21:05:41,347 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 21:05:41,347 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 21:05:41,348 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 21:05:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 21:05:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 21:05:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 21:05:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 21:05:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 21:05:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 21:05:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 21:05:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 21:05:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 21:05:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 21:05:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 21:05:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 21:05:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 21:05:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 21:05:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 21:05:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 21:05:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 21:05:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 21:05:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 21:05:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 21:05:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 21:05:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 21:05:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 21:05:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 21:05:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 21:05:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 21:05:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 21:05:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 21:05:41,352 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 21:05:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 21:05:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 21:05:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 21:05:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 21:05:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 21:05:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 21:05:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 21:05:41,353 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 21:05:41,354 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 21:05:41,354 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 21:05:41,354 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 21:05:41,354 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 21:05:41,354 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 21:05:41,354 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 21:05:41,354 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 21:05:41,355 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 21:05:41,356 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 21:05:41,356 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 21:05:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 21:05:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 21:05:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 21:05:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 21:05:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 21:05:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 21:05:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 21:05:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 21:05:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 21:05:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 21:05:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 21:05:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 21:05:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 21:05:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 21:05:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 21:05:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 21:05:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 21:05:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 21:05:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 21:05:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 21:05:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 21:05:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 21:05:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 21:05:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 21:05:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 21:05:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 21:05:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 21:05:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 21:05:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 21:05:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 21:05:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 21:05:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 21:05:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 21:05:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 21:05:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 21:05:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 21:05:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 21:05:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 21:05:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 21:05:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 21:05:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 21:05:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 21:05:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 21:05:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 21:05:41,714 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 21:05:42,236 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 21:05:42,236 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-14 21:05:42,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:05:42 BoogieIcfgContainer [2019-01-14 21:05:42,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 21:05:42,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 21:05:42,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 21:05:42,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 21:05:42,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 09:05:40" (1/3) ... [2019-01-14 21:05:42,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6d92f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:05:42, skipping insertion in model container [2019-01-14 21:05:42,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:41" (2/3) ... [2019-01-14 21:05:42,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6d92f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:05:42, skipping insertion in model container [2019-01-14 21:05:42,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:05:42" (3/3) ... [2019-01-14 21:05:42,245 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list_false-unreach-call_false-valid-memcleanup.i [2019-01-14 21:05:42,255 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 21:05:42,262 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-01-14 21:05:42,278 INFO L257 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-01-14 21:05:42,303 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 21:05:42,304 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 21:05:42,304 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 21:05:42,305 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 21:05:42,305 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 21:05:42,305 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 21:05:42,305 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 21:05:42,305 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 21:05:42,305 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 21:05:42,323 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-01-14 21:05:42,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 21:05:42,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:42,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:05:42,336 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 21:05:42,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:42,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1839855770, now seen corresponding path program 1 times [2019-01-14 21:05:42,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:42,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:42,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:42,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:42,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:42,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:42,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:05:42,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 21:05:42,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 21:05:42,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 21:05:42,487 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2019-01-14 21:05:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:42,510 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-01-14 21:05:42,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 21:05:42,511 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-14 21:05:42,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:42,520 INFO L225 Difference]: With dead ends: 80 [2019-01-14 21:05:42,521 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 21:05:42,522 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 [2019-01-14 21:05:42,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 21:05:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-14 21:05:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-14 21:05:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-01-14 21:05:42,564 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 10 [2019-01-14 21:05:42,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:42,564 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-01-14 21:05:42,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 21:05:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-01-14 21:05:42,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 21:05:42,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:42,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:05:42,566 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 21:05:42,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:42,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1200918369, now seen corresponding path program 1 times [2019-01-14 21:05:42,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:42,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:42,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:42,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:42,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:42,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:42,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:05:42,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:05:42,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:05:42,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:05:42,658 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 4 states. [2019-01-14 21:05:43,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:43,261 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-01-14 21:05:43,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:05:43,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-14 21:05:43,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:43,264 INFO L225 Difference]: With dead ends: 93 [2019-01-14 21:05:43,264 INFO L226 Difference]: Without dead ends: 93 [2019-01-14 21:05:43,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:05:43,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-14 21:05:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2019-01-14 21:05:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 21:05:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-01-14 21:05:43,275 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 11 [2019-01-14 21:05:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:43,276 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-01-14 21:05:43,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:05:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-01-14 21:05:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 21:05:43,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:43,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:05:43,277 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 21:05:43,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:43,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1200918370, now seen corresponding path program 1 times [2019-01-14 21:05:43,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:43,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:43,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:43,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:43,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:43,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:43,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:05:43,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:05:43,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:05:43,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:05:43,466 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 4 states. [2019-01-14 21:05:43,660 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 21:05:43,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:43,985 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-01-14 21:05:43,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:05:43,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-14 21:05:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:43,988 INFO L225 Difference]: With dead ends: 99 [2019-01-14 21:05:43,988 INFO L226 Difference]: Without dead ends: 99 [2019-01-14 21:05:43,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:05:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-14 21:05:43,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2019-01-14 21:05:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-14 21:05:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-01-14 21:05:43,998 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 11 [2019-01-14 21:05:43,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:43,998 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-01-14 21:05:43,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:05:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-01-14 21:05:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 21:05:43,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:44,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:05:44,000 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 21:05:44,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:44,001 INFO L82 PathProgramCache]: Analyzing trace with hash 709394635, now seen corresponding path program 1 times [2019-01-14 21:05:44,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:44,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:44,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:44,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:44,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:44,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:44,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:05:44,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:05:44,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:05:44,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:05:44,098 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 4 states. [2019-01-14 21:05:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:44,265 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2019-01-14 21:05:44,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:05:44,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-14 21:05:44,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:44,268 INFO L225 Difference]: With dead ends: 95 [2019-01-14 21:05:44,269 INFO L226 Difference]: Without dead ends: 95 [2019-01-14 21:05:44,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:05:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-14 21:05:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2019-01-14 21:05:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 21:05:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-01-14 21:05:44,278 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 19 [2019-01-14 21:05:44,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:44,278 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-01-14 21:05:44,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:05:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-01-14 21:05:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 21:05:44,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:44,280 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] [2019-01-14 21:05:44,280 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 21:05:44,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:44,280 INFO L82 PathProgramCache]: Analyzing trace with hash 516443081, now seen corresponding path program 1 times [2019-01-14 21:05:44,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:44,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:44,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:44,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:44,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:44,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:44,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:05:44,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:05:44,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:05:44,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:05:44,384 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 5 states. [2019-01-14 21:05:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:44,605 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-01-14 21:05:44,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:05:44,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-14 21:05:44,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:44,609 INFO L225 Difference]: With dead ends: 99 [2019-01-14 21:05:44,609 INFO L226 Difference]: Without dead ends: 99 [2019-01-14 21:05:44,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:05:44,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-14 21:05:44,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2019-01-14 21:05:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 21:05:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2019-01-14 21:05:44,618 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 20 [2019-01-14 21:05:44,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:44,620 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2019-01-14 21:05:44,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:05:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2019-01-14 21:05:44,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 21:05:44,622 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:44,622 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] [2019-01-14 21:05:44,622 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 21:05:44,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:44,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1784715431, now seen corresponding path program 1 times [2019-01-14 21:05:44,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:44,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:44,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:44,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:44,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:44,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:44,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:05:44,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:05:44,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:05:44,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:05:44,662 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 3 states. [2019-01-14 21:05:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:44,684 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2019-01-14 21:05:44,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:05:44,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 21:05:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:44,687 INFO L225 Difference]: With dead ends: 142 [2019-01-14 21:05:44,687 INFO L226 Difference]: Without dead ends: 142 [2019-01-14 21:05:44,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:05:44,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-14 21:05:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 101. [2019-01-14 21:05:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 21:05:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2019-01-14 21:05:44,696 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 20 [2019-01-14 21:05:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:44,697 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2019-01-14 21:05:44,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:05:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2019-01-14 21:05:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 21:05:44,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:44,698 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] [2019-01-14 21:05:44,699 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 21:05:44,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:44,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1488890801, now seen corresponding path program 1 times [2019-01-14 21:05:44,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:44,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:44,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:44,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:44,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:44,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:44,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 21:05:44,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:05:44,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:05:44,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:05:44,797 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2019-01-14 21:05:45,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:45,178 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2019-01-14 21:05:45,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:05:45,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-14 21:05:45,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:45,180 INFO L225 Difference]: With dead ends: 141 [2019-01-14 21:05:45,180 INFO L226 Difference]: Without dead ends: 141 [2019-01-14 21:05:45,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:05:45,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-14 21:05:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 104. [2019-01-14 21:05:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 21:05:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2019-01-14 21:05:45,195 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 20 [2019-01-14 21:05:45,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:45,195 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2019-01-14 21:05:45,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:05:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2019-01-14 21:05:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 21:05:45,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:45,201 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] [2019-01-14 21:05:45,201 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 21:05:45,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:45,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1171550577, now seen corresponding path program 1 times [2019-01-14 21:05:45,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:45,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:45,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:45,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:45,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:45,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:45,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:05:45,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:05:45,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:05:45,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:05:45,307 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand 5 states. [2019-01-14 21:05:45,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:45,513 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2019-01-14 21:05:45,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:05:45,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 21:05:45,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:45,516 INFO L225 Difference]: With dead ends: 118 [2019-01-14 21:05:45,516 INFO L226 Difference]: Without dead ends: 114 [2019-01-14 21:05:45,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:05:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-14 21:05:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2019-01-14 21:05:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 21:05:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2019-01-14 21:05:45,523 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 21 [2019-01-14 21:05:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:45,524 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2019-01-14 21:05:45,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:05:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2019-01-14 21:05:45,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 21:05:45,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:45,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:05:45,525 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 21:05:45,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:45,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1170133520, now seen corresponding path program 1 times [2019-01-14 21:05:45,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:45,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:45,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:45,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:45,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:45,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:45,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 21:05:45,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:05:45,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:05:45,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:05:45,743 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand 7 states. [2019-01-14 21:05:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:46,035 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2019-01-14 21:05:46,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 21:05:46,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-14 21:05:46,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:46,041 INFO L225 Difference]: With dead ends: 120 [2019-01-14 21:05:46,041 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 21:05:46,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-14 21:05:46,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 21:05:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2019-01-14 21:05:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 21:05:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2019-01-14 21:05:46,053 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 21 [2019-01-14 21:05:46,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:46,053 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2019-01-14 21:05:46,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:05:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2019-01-14 21:05:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 21:05:46,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:46,056 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:05:46,057 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 21:05:46,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:46,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1459924814, now seen corresponding path program 1 times [2019-01-14 21:05:46,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:46,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:46,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:46,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:46,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:46,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:46,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 21:05:46,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:05:46,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:05:46,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:05:46,267 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 6 states. [2019-01-14 21:05:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:46,489 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2019-01-14 21:05:46,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:05:46,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-14 21:05:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:46,491 INFO L225 Difference]: With dead ends: 105 [2019-01-14 21:05:46,491 INFO L226 Difference]: Without dead ends: 105 [2019-01-14 21:05:46,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:05:46,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-14 21:05:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2019-01-14 21:05:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 21:05:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2019-01-14 21:05:46,496 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 21 [2019-01-14 21:05:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:46,497 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2019-01-14 21:05:46,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:05:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2019-01-14 21:05:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 21:05:46,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:46,498 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:05:46,498 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 21:05:46,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:46,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1459924815, now seen corresponding path program 1 times [2019-01-14 21:05:46,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:46,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:46,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:46,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:46,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:46,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:46,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 21:05:46,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:05:46,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:05:46,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:05:46,624 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 6 states. [2019-01-14 21:05:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:46,939 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2019-01-14 21:05:46,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 21:05:46,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-14 21:05:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:46,942 INFO L225 Difference]: With dead ends: 96 [2019-01-14 21:05:46,942 INFO L226 Difference]: Without dead ends: 96 [2019-01-14 21:05:46,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-14 21:05:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-14 21:05:46,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2019-01-14 21:05:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-14 21:05:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2019-01-14 21:05:46,946 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 21 [2019-01-14 21:05:46,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:46,946 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2019-01-14 21:05:46,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:05:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2019-01-14 21:05:46,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 21:05:46,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:46,947 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:05:46,947 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 21:05:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:46,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1275124124, now seen corresponding path program 1 times [2019-01-14 21:05:46,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:46,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:46,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:46,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:46,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:47,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:05:47,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 21:05:47,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:47,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:05:47,536 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 [2019-01-14 21:05:47,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:47,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:47,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 21:05:47,644 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 [2019-01-14 21:05:47,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-01-14 21:05:47,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:47,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:47,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:47,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-01-14 21:05:47,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:47,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:47,738 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 [2019-01-14 21:05:47,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:47,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:47,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-01-14 21:05:47,880 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 [2019-01-14 21:05:47,887 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 [2019-01-14 21:05:47,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:47,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:47,921 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 22 [2019-01-14 21:05:47,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:47,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 21:05:47,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:47,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:47,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:47,953 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2019-01-14 21:05:48,105 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 20 treesize of output 16 [2019-01-14 21:05:48,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 4 [2019-01-14 21:05:48,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:48,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:48,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:48,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2019-01-14 21:05:48,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-14 21:05:48,178 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 [2019-01-14 21:05:48,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:48,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:48,196 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. [2019-01-14 21:05:48,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2019-01-14 21:05:48,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-01-14 21:05:48,333 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 [2019-01-14 21:05:48,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:48,347 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 [2019-01-14 21:05:48,347 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:48,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:48,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:48,357 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-01-14 21:05:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:48,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:05:48,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-01-14 21:05:48,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 21:05:48,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 21:05:48,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-01-14 21:05:48,423 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 22 states. [2019-01-14 21:05:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:50,578 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2019-01-14 21:05:50,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 21:05:50,579 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-01-14 21:05:50,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:50,581 INFO L225 Difference]: With dead ends: 194 [2019-01-14 21:05:50,581 INFO L226 Difference]: Without dead ends: 191 [2019-01-14 21:05:50,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=303, Invalid=1419, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 21:05:50,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-14 21:05:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 102. [2019-01-14 21:05:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 21:05:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2019-01-14 21:05:50,587 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 30 [2019-01-14 21:05:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:50,588 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2019-01-14 21:05:50,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 21:05:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2019-01-14 21:05:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 21:05:50,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:50,589 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:05:50,589 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 21:05:50,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:50,589 INFO L82 PathProgramCache]: Analyzing trace with hash -956667332, now seen corresponding path program 1 times [2019-01-14 21:05:50,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:50,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:50,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:50,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:50,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:51,204 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-01-14 21:05:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:51,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:05:51,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 21:05:51,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:51,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:05:51,400 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 [2019-01-14 21:05:51,402 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 [2019-01-14 21:05:51,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-01-14 21:05:51,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:51,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:51,450 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 [2019-01-14 21:05:51,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-01-14 21:05:51,529 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 27 treesize of output 22 [2019-01-14 21:05:51,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:51,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 21:05:51,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,610 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 [2019-01-14 21:05:51,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-01-14 21:05:51,613 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,628 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-14 21:05:51,664 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 20 treesize of output 16 [2019-01-14 21:05:51,670 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 16 treesize of output 4 [2019-01-14 21:05:51,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-01-14 21:05:51,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-14 21:05:51,731 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 [2019-01-14 21:05:51,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,747 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. [2019-01-14 21:05:51,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-01-14 21:05:51,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-01-14 21:05:51,810 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 [2019-01-14 21:05:51,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,819 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 [2019-01-14 21:05:51,820 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:51,827 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-01-14 21:05:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:51,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:05:51,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-01-14 21:05:51,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-14 21:05:51,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 21:05:51,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2019-01-14 21:05:51,897 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 23 states. [2019-01-14 21:05:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:53,007 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2019-01-14 21:05:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 21:05:53,014 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2019-01-14 21:05:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:53,015 INFO L225 Difference]: With dead ends: 175 [2019-01-14 21:05:53,015 INFO L226 Difference]: Without dead ends: 171 [2019-01-14 21:05:53,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2019-01-14 21:05:53,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-14 21:05:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 98. [2019-01-14 21:05:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-14 21:05:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-01-14 21:05:53,023 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 31 [2019-01-14 21:05:53,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:53,025 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-01-14 21:05:53,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-14 21:05:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-01-14 21:05:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 21:05:53,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:53,028 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2019-01-14 21:05:53,029 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 21:05:53,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:53,029 INFO L82 PathProgramCache]: Analyzing trace with hash -208880943, now seen corresponding path program 1 times [2019-01-14 21:05:53,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:53,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:53,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:53,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:53,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:53,297 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 21:05:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:53,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:05:53,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 21:05:53,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:53,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:05:53,824 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 [2019-01-14 21:05:53,829 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 [2019-01-14 21:05:53,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:53,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:53,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:53,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-01-14 21:05:53,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:53,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:53,873 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 [2019-01-14 21:05:53,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:53,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:53,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-01-14 21:05:53,949 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 [2019-01-14 21:05:53,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, 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 [2019-01-14 21:05:53,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:53,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,073 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 27 treesize of output 22 [2019-01-14 21:05:54,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:54,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 21:05:54,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,096 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-14 21:05:54,124 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 20 treesize of output 16 [2019-01-14 21:05:54,126 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 16 treesize of output 4 [2019-01-14 21:05:54,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-01-14 21:05:54,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-14 21:05:54,197 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 [2019-01-14 21:05:54,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-01-14 21:05:54,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-01-14 21:05:54,328 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 [2019-01-14 21:05:54,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-01-14 21:05:54,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:54,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 21:05:54,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,473 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:31 [2019-01-14 21:05:54,508 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 19 treesize of output 15 [2019-01-14 21:05:54,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2019-01-14 21:05:54,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,525 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. [2019-01-14 21:05:54,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2019-01-14 21:05:54,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:54,634 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 6 case distinctions, treesize of input 26 treesize of output 64 [2019-01-14 21:05:54,657 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 21:05:54,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,767 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 23 treesize of output 22 [2019-01-14 21:05:54,767 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:54,825 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 24 treesize of output 29 [2019-01-14 21:05:54,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 21:05:54,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:54,876 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 21 [2019-01-14 21:05:54,876 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:54,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 21:05:54,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-01-14 21:05:54,940 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2019-01-14 21:05:55,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:55,117 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 26 treesize of output 24 [2019-01-14 21:05:55,129 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2019-01-14 21:05:55,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:55,140 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 [2019-01-14 21:05:55,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:55,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:55,162 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 20 [2019-01-14 21:05:55,166 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 [2019-01-14 21:05:55,166 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:55,175 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 [2019-01-14 21:05:55,175 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:55,180 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:55,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 21:05:55,190 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:53, output treesize:7 [2019-01-14 21:05:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:55,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:05:55,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-01-14 21:05:55,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 21:05:55,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 21:05:55,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2019-01-14 21:05:55,244 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 32 states. [2019-01-14 21:05:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:57,559 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-01-14 21:05:57,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 21:05:57,560 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-01-14 21:05:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:57,563 INFO L225 Difference]: With dead ends: 72 [2019-01-14 21:05:57,563 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 21:05:57,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=514, Invalid=2908, Unknown=0, NotChecked=0, Total=3422 [2019-01-14 21:05:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 21:05:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2019-01-14 21:05:57,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 21:05:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-01-14 21:05:57,570 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 40 [2019-01-14 21:05:57,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:57,571 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-01-14 21:05:57,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 21:05:57,571 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-01-14 21:05:57,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 21:05:57,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:57,572 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2019-01-14 21:05:57,572 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 21:05:57,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:57,575 INFO L82 PathProgramCache]: Analyzing trace with hash 2032100207, now seen corresponding path program 1 times [2019-01-14 21:05:57,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:57,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:57,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:57,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:57,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:57,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:05:57,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 21:05:57,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:57,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:05:58,069 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 [2019-01-14 21:05:58,072 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 [2019-01-14 21:05:58,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2019-01-14 21:05:58,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:58,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:58,105 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 [2019-01-14 21:05:58,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-01-14 21:05:58,139 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 [2019-01-14 21:05:58,146 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 [2019-01-14 21:05:58,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,167 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 27 treesize of output 22 [2019-01-14 21:05:58,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:58,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 21:05:58,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,201 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-01-14 21:05:58,235 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 [2019-01-14 21:05:58,242 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 [2019-01-14 21:05:58,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:17 [2019-01-14 21:05:58,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-14 21:05:58,306 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 [2019-01-14 21:05:58,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-01-14 21:05:58,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:58,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:58,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 21:05:58,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-01-14 21:05:58,517 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 [2019-01-14 21:05:58,520 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 [2019-01-14 21:05:58,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-01-14 21:05:58,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:58,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 21:05:58,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,579 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-01-14 21:05:58,626 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 20 treesize of output 16 [2019-01-14 21:05:58,642 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 16 treesize of output 4 [2019-01-14 21:05:58,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,671 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. [2019-01-14 21:05:58,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:23 [2019-01-14 21:05:58,779 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2019-01-14 21:05:58,784 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 35 treesize of output 34 [2019-01-14 21:05:58,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:58,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:05:58,933 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 24 treesize of output 29 [2019-01-14 21:05:58,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 21:05:58,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 21:05:58,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-01-14 21:05:58,978 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:34, output treesize:50 [2019-01-14 21:05:59,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-01-14 21:05:59,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 21:05:59,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 21:05:59,129 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 [2019-01-14 21:05:59,130 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 21:05:59,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 21:05:59,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 21:05:59,142 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2019-01-14 21:05:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:05:59,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:05:59,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-01-14 21:05:59,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-14 21:05:59,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-14 21:05:59,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1019, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 21:05:59,229 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 34 states. [2019-01-14 21:06:00,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:06:00,862 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-01-14 21:06:00,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 21:06:00,862 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2019-01-14 21:06:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:06:00,862 INFO L225 Difference]: With dead ends: 51 [2019-01-14 21:06:00,863 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 21:06:00,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=401, Invalid=2569, Unknown=0, NotChecked=0, Total=2970 [2019-01-14 21:06:00,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 21:06:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 21:06:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 21:06:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 21:06:00,864 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-01-14 21:06:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:06:00,865 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 21:06:00,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-14 21:06:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 21:06:00,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 21:06:00,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 09:06:00 BoogieIcfgContainer [2019-01-14 21:06:00,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 21:06:00,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 21:06:00,872 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 21:06:00,872 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 21:06:00,874 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:05:42" (3/4) ... [2019-01-14 21:06:00,877 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 21:06:00,883 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 21:06:00,883 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-14 21:06:00,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 21:06:00,889 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-14 21:06:00,890 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 21:06:00,890 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 21:06:00,938 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 21:06:00,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 21:06:00,939 INFO L168 Benchmark]: Toolchain (without parser) took 20313.75 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 350.7 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -229.3 MB). Peak memory consumption was 121.5 MB. Max. memory is 11.5 GB. [2019-01-14 21:06:00,941 INFO L168 Benchmark]: CDTParser took 0.66 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:06:00,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 603.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -197.3 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. [2019-01-14 21:06:00,941 INFO L168 Benchmark]: Boogie Preprocessor took 62.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 21:06:00,942 INFO L168 Benchmark]: RCFGBuilder took 943.52 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: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-01-14 21:06:00,942 INFO L168 Benchmark]: TraceAbstraction took 18633.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.9 MB). Peak memory consumption was 107.2 MB. Max. memory is 11.5 GB. [2019-01-14 21:06:00,942 INFO L168 Benchmark]: Witness Printer took 66.07 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:06:00,945 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.66 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 603.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -197.3 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 943.52 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: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18633.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.9 MB). Peak memory consumption was 107.2 MB. Max. memory is 11.5 GB. * Witness Printer took 66.07 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 645]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 643]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 643]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 645]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 81 locations, 29 error locations. SAFE Result, 18.5s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 10.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 749 SDtfs, 1746 SDslu, 2612 SDs, 0 SdLazy, 3182 SolverSat, 497 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 115 SyntacticMatches, 5 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2205 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=8, 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, 15 MinimizatonAttempts, 326 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 460 ConstructedInterpolants, 25 QuantifiedInterpolants, 134885 SizeOfPredicates, 65 NumberOfNonLiveVariables, 658 ConjunctsInSsa, 153 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 10/66 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...