./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 00:53:50,652 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:53:50,654 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:53:50,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:53:50,666 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:53:50,668 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:53:50,669 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:53:50,672 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:53:50,673 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:53:50,677 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:53:50,678 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:53:50,680 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:53:50,681 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:53:50,682 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:53:50,683 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:53:50,684 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:53:50,685 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:53:50,687 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:53:50,690 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:53:50,691 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:53:50,693 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:53:50,694 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:53:50,697 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:53:50,697 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:53:50,698 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:53:50,698 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:53:50,699 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:53:50,701 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:53:50,702 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:53:50,703 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:53:50,703 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:53:50,704 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:53:50,704 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:53:50,704 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:53:50,705 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:53:50,707 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:53:50,707 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-01-14 00:53:50,737 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:53:50,737 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:53:50,738 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:53:50,738 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:53:50,739 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:53:50,742 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:53:50,742 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:53:50,742 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:53:50,742 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:53:50,742 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:53:50,742 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:53:50,743 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:53:50,743 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:53:50,743 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:53:50,743 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:53:50,743 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:53:50,746 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:53:50,746 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:53:50,747 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:53:50,747 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:53:50,747 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:53:50,748 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:53:50,748 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:53:50,748 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:53:50,748 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:53:50,748 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 00:53:50,802 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:53:50,819 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:53:50,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:53:50,829 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:53:50,829 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:53:50,831 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 00:53:50,891 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d688c2a/d463afaa2f014d68ad7bfc20b675ceb2/FLAGa1306e70d [2019-01-14 00:53:51,376 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:53:51,377 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2019-01-14 00:53:51,397 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d688c2a/d463afaa2f014d68ad7bfc20b675ceb2/FLAGa1306e70d [2019-01-14 00:53:51,652 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d688c2a/d463afaa2f014d68ad7bfc20b675ceb2 [2019-01-14 00:53:51,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:53:51,658 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:53:51,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:53:51,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:53:51,665 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:53:51,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:53:51" (1/1) ... [2019-01-14 00:53:51,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ab6c94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:53:51, skipping insertion in model container [2019-01-14 00:53:51,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:53:51" (1/1) ... [2019-01-14 00:53:51,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:53:51,744 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:53:52,089 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:53:52,105 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:53:52,187 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:53:52,319 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:53:52,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:53:52 WrapperNode [2019-01-14 00:53:52,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:53:52,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:53:52,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:53:52,322 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:53:52,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:53:52" (1/1) ... [2019-01-14 00:53:52,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:53:52" (1/1) ... [2019-01-14 00:53:52,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:53:52" (1/1) ... [2019-01-14 00:53:52,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:53:52" (1/1) ... [2019-01-14 00:53:52,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:53:52" (1/1) ... [2019-01-14 00:53:52,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:53:52" (1/1) ... [2019-01-14 00:53:52,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:53:52" (1/1) ... [2019-01-14 00:53:52,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:53:52,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:53:52,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:53:52,393 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:53:52,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:53:52" (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 00:53:52,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:53:52,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:53:52,454 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 00:53:52,454 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:53:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 00:53:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 00:53:52,454 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 00:53:52,455 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 00:53:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 00:53:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 00:53:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 00:53:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 00:53:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 00:53:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 00:53:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 00:53:52,458 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 00:53:52,458 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 00:53:52,458 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 00:53:52,458 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 00:53:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 00:53:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 00:53:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 00:53:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 00:53:52,461 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 00:53:52,461 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 00:53:52,461 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 00:53:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 00:53:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 00:53:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 00:53:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 00:53:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 00:53:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 00:53:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 00:53:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 00:53:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 00:53:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 00:53:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 00:53:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 00:53:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 00:53:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 00:53:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 00:53:52,463 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 00:53:52,464 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 00:53:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 00:53:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 00:53:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 00:53:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 00:53:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 00:53:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 00:53:52,466 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 00:53:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 00:53:52,467 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 00:53:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 00:53:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 00:53:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 00:53:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 00:53:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 00:53:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 00:53:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 00:53:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 00:53:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 00:53:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 00:53:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 00:53:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 00:53:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 00:53:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 00:53:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 00:53:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 00:53:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 00:53:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 00:53:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 00:53:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 00:53:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 00:53:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 00:53:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 00:53:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 00:53:52,473 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 00:53:52,474 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 00:53:52,474 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 00:53:52,474 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 00:53:52,474 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 00:53:52,474 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 00:53:52,474 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 00:53:52,474 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 00:53:52,475 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 00:53:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 00:53:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 00:53:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 00:53:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 00:53:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 00:53:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 00:53:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 00:53:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 00:53:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 00:53:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 00:53:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 00:53:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 00:53:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 00:53:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 00:53:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 00:53:52,478 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 00:53:52,479 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 00:53:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 00:53:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 00:53:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 00:53:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 00:53:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 00:53:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 00:53:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:53:52,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 00:53:52,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 00:53:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 00:53:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 00:53:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 00:53:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:53:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:53:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:53:52,870 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 00:53:53,225 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:53:53,225 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-14 00:53:53,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:53:53 BoogieIcfgContainer [2019-01-14 00:53:53,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:53:53,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:53:53,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:53:53,231 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:53:53,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:53:51" (1/3) ... [2019-01-14 00:53:53,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abf99c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:53:53, skipping insertion in model container [2019-01-14 00:53:53,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:53:52" (2/3) ... [2019-01-14 00:53:53,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abf99c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:53:53, skipping insertion in model container [2019-01-14 00:53:53,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:53:53" (3/3) ... [2019-01-14 00:53:53,234 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list_false-unreach-call_false-valid-memcleanup.i [2019-01-14 00:53:53,244 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:53:53,252 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-01-14 00:53:53,269 INFO L257 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-01-14 00:53:53,295 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:53:53,296 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:53:53,296 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:53:53,296 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:53:53,297 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:53:53,297 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:53:53,297 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:53:53,297 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:53:53,297 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:53:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-01-14 00:53:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 00:53:53,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:53:53,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:53:53,329 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:53:53,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:53:53,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1839855770, now seen corresponding path program 1 times [2019-01-14 00:53:53,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:53:53,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:53:53,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:53,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:53:53,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:53:53,472 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 00:53:53,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:53:53,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:53:53,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 00:53:53,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 00:53:53,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 00:53:53,495 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2019-01-14 00:53:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:53:53,514 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-01-14 00:53:53,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 00:53:53,516 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-14 00:53:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:53:53,524 INFO L225 Difference]: With dead ends: 80 [2019-01-14 00:53:53,524 INFO L226 Difference]: Without dead ends: 72 [2019-01-14 00:53:53,526 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 00:53:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-14 00:53:53,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-14 00:53:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-14 00:53:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-01-14 00:53:53,567 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 10 [2019-01-14 00:53:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:53:53,568 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-01-14 00:53:53,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 00:53:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-01-14 00:53:53,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 00:53:53,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:53:53,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:53:53,570 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:53:53,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:53:53,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1200918369, now seen corresponding path program 1 times [2019-01-14 00:53:53,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:53:53,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:53:53,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:53,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:53:53,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:53:53,718 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 00:53:53,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:53:53,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 00:53:53,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 00:53:53,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 00:53:53,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:53:53,721 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 4 states. [2019-01-14 00:53:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:53:54,153 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-01-14 00:53:54,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:53:54,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-14 00:53:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:53:54,155 INFO L225 Difference]: With dead ends: 93 [2019-01-14 00:53:54,156 INFO L226 Difference]: Without dead ends: 93 [2019-01-14 00:53:54,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:53:54,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-14 00:53:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2019-01-14 00:53:54,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 00:53:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-01-14 00:53:54,167 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 11 [2019-01-14 00:53:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:53:54,169 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-01-14 00:53:54,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 00:53:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-01-14 00:53:54,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 00:53:54,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:53:54,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:53:54,170 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:53:54,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:53:54,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1200918370, now seen corresponding path program 1 times [2019-01-14 00:53:54,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:53:54,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:53:54,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:54,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:53:54,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:53:54,350 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 00:53:54,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:53:54,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 00:53:54,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 00:53:54,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 00:53:54,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:53:54,355 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 4 states. [2019-01-14 00:53:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:53:54,796 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-01-14 00:53:54,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:53:54,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-14 00:53:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:53:54,799 INFO L225 Difference]: With dead ends: 99 [2019-01-14 00:53:54,800 INFO L226 Difference]: Without dead ends: 99 [2019-01-14 00:53:54,800 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 00:53:54,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-14 00:53:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2019-01-14 00:53:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-14 00:53:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-01-14 00:53:54,809 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 11 [2019-01-14 00:53:54,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:53:54,810 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-01-14 00:53:54,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 00:53:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-01-14 00:53:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 00:53:54,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:53:54,811 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 00:53:54,812 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:53:54,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:53:54,812 INFO L82 PathProgramCache]: Analyzing trace with hash 709394635, now seen corresponding path program 1 times [2019-01-14 00:53:54,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:53:54,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:53:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:54,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:53:54,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:53:54,888 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 00:53:54,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:53:54,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 00:53:54,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 00:53:54,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 00:53:54,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:53:54,891 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 4 states. [2019-01-14 00:53:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:53:55,046 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2019-01-14 00:53:55,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:53:55,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-14 00:53:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:53:55,049 INFO L225 Difference]: With dead ends: 95 [2019-01-14 00:53:55,049 INFO L226 Difference]: Without dead ends: 95 [2019-01-14 00:53:55,049 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 00:53:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-14 00:53:55,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2019-01-14 00:53:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 00:53:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-01-14 00:53:55,057 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 19 [2019-01-14 00:53:55,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:53:55,058 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-01-14 00:53:55,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 00:53:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-01-14 00:53:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 00:53:55,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:53:55,059 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 00:53:55,060 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:53:55,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:53:55,060 INFO L82 PathProgramCache]: Analyzing trace with hash 516443081, now seen corresponding path program 1 times [2019-01-14 00:53:55,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:53:55,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:53:55,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:55,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:53:55,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:53:55,152 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 00:53:55,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:53:55,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 00:53:55,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:53:55,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:53:55,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:53:55,155 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 5 states. [2019-01-14 00:53:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:53:55,347 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-01-14 00:53:55,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:53:55,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-14 00:53:55,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:53:55,350 INFO L225 Difference]: With dead ends: 99 [2019-01-14 00:53:55,350 INFO L226 Difference]: Without dead ends: 99 [2019-01-14 00:53:55,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:53:55,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-14 00:53:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2019-01-14 00:53:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 00:53:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2019-01-14 00:53:55,360 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 20 [2019-01-14 00:53:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:53:55,360 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2019-01-14 00:53:55,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:53:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2019-01-14 00:53:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 00:53:55,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:53:55,362 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 00:53:55,362 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:53:55,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:53:55,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1784715431, now seen corresponding path program 1 times [2019-01-14 00:53:55,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:53:55,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:53:55,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:55,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:53:55,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:53:55,424 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 00:53:55,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:53:55,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 00:53:55,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:53:55,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:53:55,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:53:55,426 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 3 states. [2019-01-14 00:53:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:53:55,454 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2019-01-14 00:53:55,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:53:55,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 00:53:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:53:55,457 INFO L225 Difference]: With dead ends: 142 [2019-01-14 00:53:55,457 INFO L226 Difference]: Without dead ends: 142 [2019-01-14 00:53:55,457 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 00:53:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-14 00:53:55,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 101. [2019-01-14 00:53:55,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 00:53:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2019-01-14 00:53:55,468 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 20 [2019-01-14 00:53:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:53:55,468 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2019-01-14 00:53:55,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:53:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2019-01-14 00:53:55,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 00:53:55,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:53:55,472 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 00:53:55,472 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:53:55,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:53:55,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1488890801, now seen corresponding path program 1 times [2019-01-14 00:53:55,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:53:55,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:53:55,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:55,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:53:55,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:53:55,562 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 00:53:55,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:53:55,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 00:53:55,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:53:55,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:53:55,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:53:55,564 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2019-01-14 00:53:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:53:55,987 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2019-01-14 00:53:55,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:53:55,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-14 00:53:55,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:53:55,988 INFO L225 Difference]: With dead ends: 141 [2019-01-14 00:53:55,989 INFO L226 Difference]: Without dead ends: 141 [2019-01-14 00:53:55,989 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 00:53:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-14 00:53:55,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 104. [2019-01-14 00:53:55,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 00:53:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2019-01-14 00:53:56,001 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 20 [2019-01-14 00:53:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:53:56,002 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2019-01-14 00:53:56,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:53:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2019-01-14 00:53:56,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 00:53:56,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:53:56,004 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 00:53:56,005 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:53:56,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:53:56,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1171550577, now seen corresponding path program 1 times [2019-01-14 00:53:56,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:53:56,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:53:56,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:56,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:53:56,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:53:56,114 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 00:53:56,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:53:56,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 00:53:56,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:53:56,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:53:56,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:53:56,115 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand 5 states. [2019-01-14 00:53:56,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:53:56,318 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2019-01-14 00:53:56,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:53:56,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 00:53:56,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:53:56,320 INFO L225 Difference]: With dead ends: 118 [2019-01-14 00:53:56,320 INFO L226 Difference]: Without dead ends: 114 [2019-01-14 00:53:56,320 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 00:53:56,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-14 00:53:56,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2019-01-14 00:53:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 00:53:56,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2019-01-14 00:53:56,327 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 21 [2019-01-14 00:53:56,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:53:56,328 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2019-01-14 00:53:56,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:53:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2019-01-14 00:53:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 00:53:56,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:53:56,329 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 00:53:56,329 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:53:56,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:53:56,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1170133520, now seen corresponding path program 1 times [2019-01-14 00:53:56,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:53:56,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:53:56,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:56,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:53:56,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:53:56,444 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 00:53:56,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:53:56,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 00:53:56,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:53:56,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:53:56,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:53:56,446 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand 7 states. [2019-01-14 00:53:56,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:53:56,788 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2019-01-14 00:53:56,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:53:56,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-14 00:53:56,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:53:56,791 INFO L225 Difference]: With dead ends: 120 [2019-01-14 00:53:56,791 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 00:53:56,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:53:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 00:53:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2019-01-14 00:53:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 00:53:56,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2019-01-14 00:53:56,797 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 21 [2019-01-14 00:53:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:53:56,798 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2019-01-14 00:53:56,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:53:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2019-01-14 00:53:56,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 00:53:56,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:53:56,799 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 00:53:56,799 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:53:56,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:53:56,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1459924814, now seen corresponding path program 1 times [2019-01-14 00:53:56,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:53:56,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:53:56,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:56,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:53:56,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:53:56,906 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 00:53:56,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:53:56,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:53:56,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:53:56,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:53:56,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:53:56,907 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 6 states. [2019-01-14 00:53:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:53:57,153 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2019-01-14 00:53:57,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:53:57,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-14 00:53:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:53:57,156 INFO L225 Difference]: With dead ends: 105 [2019-01-14 00:53:57,157 INFO L226 Difference]: Without dead ends: 105 [2019-01-14 00:53:57,158 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 00:53:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-14 00:53:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2019-01-14 00:53:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 00:53:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2019-01-14 00:53:57,163 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 21 [2019-01-14 00:53:57,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:53:57,163 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2019-01-14 00:53:57,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:53:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2019-01-14 00:53:57,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 00:53:57,164 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:53:57,164 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 00:53:57,165 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:53:57,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:53:57,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1459924815, now seen corresponding path program 1 times [2019-01-14 00:53:57,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:53:57,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:53:57,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:57,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:53:57,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:53:57,490 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-01-14 00:53:57,515 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 00:53:57,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:53:57,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:53:57,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:53:57,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:53:57,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:53:57,516 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 6 states. [2019-01-14 00:53:57,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:53:57,813 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2019-01-14 00:53:57,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:53:57,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-14 00:53:57,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:53:57,816 INFO L225 Difference]: With dead ends: 96 [2019-01-14 00:53:57,816 INFO L226 Difference]: Without dead ends: 96 [2019-01-14 00:53:57,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:53:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-14 00:53:57,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2019-01-14 00:53:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-14 00:53:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2019-01-14 00:53:57,820 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 21 [2019-01-14 00:53:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:53:57,820 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2019-01-14 00:53:57,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:53:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2019-01-14 00:53:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 00:53:57,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:53:57,822 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 00:53:57,822 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:53:57,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:53:57,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1275124124, now seen corresponding path program 1 times [2019-01-14 00:53:57,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:53:57,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:53:57,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:57,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:53:57,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:53:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:53:58,183 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 00:53:58,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:53:58,184 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 00:53:58,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:53:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:53:58,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:53:58,334 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 00:53:58,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:53:58,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:53:58,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 00:53:58,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, 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 00:53:58,614 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 00:53:58,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:53:58,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:53:58,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:53:58,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-01-14 00:53:58,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:53:58,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:53:58,722 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 00:53:58,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:53:58,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:53:58,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-01-14 00:53:58,864 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 00:53:58,870 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 00:53:58,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:53:58,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:53:58,902 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 00:53:58,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:53:58,910 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 00:53:58,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:53:58,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:53:58,930 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 00:53:58,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2019-01-14 00:53:59,081 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 00:53:59,084 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 00:53:59,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:53:59,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:53:59,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:53:59,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2019-01-14 00:53:59,143 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 00:53:59,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, 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 00:53:59,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:53:59,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:53:59,162 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 00:53:59,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2019-01-14 00:53:59,297 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 00:53:59,302 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 00:53:59,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:53:59,313 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 00:53:59,313 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:53:59,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:53:59,325 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 00:53:59,325 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-01-14 00:53:59,381 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 00:53:59,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:53:59,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-01-14 00:53:59,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 00:53:59,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 00:53:59,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-01-14 00:53:59,408 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 22 states. [2019-01-14 00:54:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:54:01,763 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2019-01-14 00:54:01,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 00:54:01,764 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-01-14 00:54:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:54:01,765 INFO L225 Difference]: With dead ends: 194 [2019-01-14 00:54:01,765 INFO L226 Difference]: Without dead ends: 191 [2019-01-14 00:54:01,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=303, Invalid=1419, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 00:54:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-14 00:54:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 102. [2019-01-14 00:54:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 00:54:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2019-01-14 00:54:01,774 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 30 [2019-01-14 00:54:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:54:01,775 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2019-01-14 00:54:01,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 00:54:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2019-01-14 00:54:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 00:54:01,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:54:01,784 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 00:54:01,784 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:54:01,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:54:01,785 INFO L82 PathProgramCache]: Analyzing trace with hash -956667332, now seen corresponding path program 1 times [2019-01-14 00:54:01,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:54:01,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:54:01,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:01,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:01,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:54:02,056 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 00:54:02,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:54:02,057 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 00:54:02,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:54:02,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:54:02,156 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 00:54:02,158 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 00:54:02,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-01-14 00:54:02,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:02,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:02,218 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 00:54:02,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-01-14 00:54:02,302 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 00:54:02,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:02,322 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 00:54:02,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,355 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 00:54:02,358 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 00:54:02,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,376 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 00:54:02,377 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-14 00:54:02,416 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 00:54:02,427 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 00:54:02,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-01-14 00:54:02,490 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 00:54:02,494 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 00:54:02,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,511 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 00:54:02,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-01-14 00:54:02,574 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 00:54:02,578 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 00:54:02,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,608 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 00:54:02,608 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:02,616 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 00:54:02,617 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-01-14 00:54:02,632 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 00:54:02,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:54:02,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-01-14 00:54:02,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-14 00:54:02,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 00:54:02,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2019-01-14 00:54:02,652 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 23 states. [2019-01-14 00:54:03,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:54:03,685 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2019-01-14 00:54:03,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 00:54:03,686 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2019-01-14 00:54:03,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:54:03,688 INFO L225 Difference]: With dead ends: 175 [2019-01-14 00:54:03,689 INFO L226 Difference]: Without dead ends: 171 [2019-01-14 00:54:03,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2019-01-14 00:54:03,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-14 00:54:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 98. [2019-01-14 00:54:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-14 00:54:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-01-14 00:54:03,697 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 31 [2019-01-14 00:54:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:54:03,697 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-01-14 00:54:03,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-14 00:54:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-01-14 00:54:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 00:54:03,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:54:03,702 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 00:54:03,702 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:54:03,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:54:03,703 INFO L82 PathProgramCache]: Analyzing trace with hash -208880943, now seen corresponding path program 1 times [2019-01-14 00:54:03,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:54:03,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:54:03,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:03,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:03,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:54:03,977 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 00:54:04,378 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2019-01-14 00:54:04,711 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 00:54:04,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:54:04,711 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 00:54:04,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:54:04,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:54:04,882 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 00:54:04,884 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 00:54:04,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:04,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:04,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:04,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-01-14 00:54:04,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:04,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:04,954 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 00:54:04,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:04,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:04,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-01-14 00:54:05,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:54:05,039 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 00:54:05,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,279 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 00:54:05,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:05,316 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 00:54:05,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,334 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 00:54:05,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-14 00:54:05,376 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 00:54:05,379 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 00:54:05,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-01-14 00:54:05,447 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 00:54:05,451 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 00:54:05,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-01-14 00:54:05,656 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 00:54:05,659 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 00:54:05,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,685 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 00:54:05,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:05,691 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 00:54:05,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:31 [2019-01-14 00:54:05,740 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 00:54:05,750 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 00:54:05,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:05,766 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 00:54:05,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2019-01-14 00:54:05,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:05,906 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 00:54:05,930 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 00:54:05,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:06,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-01-14 00:54:06,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:06,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:06,111 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 00:54:06,112 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 00:54:06,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:06,159 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 00:54:06,159 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:06,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 00:54:06,226 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 00:54:06,227 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2019-01-14 00:54:06,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:06,388 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 00:54:06,398 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 00:54:06,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:06,406 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 00:54:06,406 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:06,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:06,437 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 00:54:06,445 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 00:54:06,446 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:06,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 00:54:06,454 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:06,459 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:06,484 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 00:54:06,485 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:53, output treesize:7 [2019-01-14 00:54:06,517 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 00:54:06,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:54:06,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-01-14 00:54:06,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 00:54:06,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 00:54:06,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2019-01-14 00:54:06,537 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 32 states. [2019-01-14 00:54:08,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:54:08,767 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-01-14 00:54:08,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 00:54:08,769 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-01-14 00:54:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:54:08,770 INFO L225 Difference]: With dead ends: 72 [2019-01-14 00:54:08,770 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 00:54:08,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=514, Invalid=2908, Unknown=0, NotChecked=0, Total=3422 [2019-01-14 00:54:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 00:54:08,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2019-01-14 00:54:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 00:54:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-01-14 00:54:08,776 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 40 [2019-01-14 00:54:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:54:08,776 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-01-14 00:54:08,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 00:54:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-01-14 00:54:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 00:54:08,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:54:08,777 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 00:54:08,778 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-14 00:54:08,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:54:08,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2032100207, now seen corresponding path program 1 times [2019-01-14 00:54:08,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:54:08,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:54:08,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:08,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:08,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:54:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:54:09,232 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 00:54:09,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:54:09,232 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 00:54:09,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:54:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:54:09,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:54:09,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 00:54:09,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 00:54:09,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2019-01-14 00:54:09,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:09,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:09,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:54:09,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-01-14 00:54:09,493 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 00:54:09,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:54:09,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,521 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 00:54:09,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:09,528 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 00:54:09,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,544 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 00:54:09,545 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-01-14 00:54:09,579 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 00:54:09,589 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 00:54:09,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:17 [2019-01-14 00:54:09,746 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 00:54:09,749 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 00:54:09,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-01-14 00:54:09,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:09,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:09,838 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 00:54:09,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-01-14 00:54:09,874 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 00:54:09,876 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 00:54:09,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,897 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 00:54:09,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:09,931 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 00:54:09,931 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,951 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 00:54:09,951 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-01-14 00:54:09,981 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 00:54:09,983 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 00:54:09,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:54:09,991 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 00:54:09,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:23 [2019-01-14 00:54:10,083 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 00:54:10,087 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 00:54:10,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:10,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:54:10,251 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 00:54:10,252 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 00:54:10,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:54:10,295 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 00:54:10,296 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:34, output treesize:50 [2019-01-14 00:54:10,378 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 00:54:10,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 00:54:10,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:54:10,397 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 00:54:10,398 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:54:10,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:54:10,410 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 00:54:10,410 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2019-01-14 00:54:10,480 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 00:54:10,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:54:10,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-01-14 00:54:10,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-14 00:54:10,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-14 00:54:10,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1019, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 00:54:10,499 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 34 states. [2019-01-14 00:54:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:54:12,064 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-01-14 00:54:12,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 00:54:12,064 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2019-01-14 00:54:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:54:12,065 INFO L225 Difference]: With dead ends: 51 [2019-01-14 00:54:12,065 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 00:54:12,067 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 00:54:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 00:54:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 00:54:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 00:54:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 00:54:12,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-01-14 00:54:12,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:54:12,069 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 00:54:12,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-14 00:54:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 00:54:12,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 00:54:12,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:54:12 BoogieIcfgContainer [2019-01-14 00:54:12,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:54:12,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:54:12,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:54:12,075 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:54:12,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:53:53" (3/4) ... [2019-01-14 00:54:12,080 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 00:54:12,087 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 00:54:12,088 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-14 00:54:12,088 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 00:54:12,094 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-14 00:54:12,095 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 00:54:12,096 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 00:54:12,149 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:54:12,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:54:12,150 INFO L168 Benchmark]: Toolchain (without parser) took 20492.75 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.8 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -240.2 MB). Peak memory consumption was 101.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:54:12,151 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:54:12,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2019-01-14 00:54:12,153 INFO L168 Benchmark]: Boogie Preprocessor took 70.86 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 00:54:12,154 INFO L168 Benchmark]: RCFGBuilder took 834.33 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.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2019-01-14 00:54:12,154 INFO L168 Benchmark]: TraceAbstraction took 18846.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -118.1 MB). Peak memory consumption was 90.0 MB. Max. memory is 11.5 GB. [2019-01-14 00:54:12,154 INFO L168 Benchmark]: Witness Printer took 73.95 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 11.5 GB. [2019-01-14 00:54:12,159 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 661.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.86 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 834.33 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.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18846.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -118.1 MB). Peak memory consumption was 90.0 MB. Max. memory is 11.5 GB. * Witness Printer took 73.95 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 642]: 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: 642]: 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: 637]: 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: 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: 634]: 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: 663]: 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: 658]: 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: 658]: 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: 655]: 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: 626]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 664]: 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: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference 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: 664]: free always succeeds For all program executions holds that free 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: 643]: 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: 643]: 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.7s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 10.0s 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.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 115 SyntacticMatches, 5 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2205 ImplicationChecksByTransitivity, 9.1s 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.7s 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...