./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 2e94e6aa 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-2e94e6a [2019-01-01 20:11:02,568 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:11:02,570 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:11:02,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:11:02,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:11:02,587 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:11:02,588 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:11:02,591 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:11:02,592 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:11:02,593 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:11:02,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:11:02,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:11:02,596 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:11:02,597 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:11:02,598 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:11:02,599 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:11:02,600 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:11:02,602 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:11:02,604 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:11:02,606 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:11:02,607 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:11:02,609 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:11:02,612 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:11:02,612 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:11:02,612 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:11:02,613 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:11:02,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:11:02,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:11:02,616 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:11:02,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:11:02,618 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:11:02,619 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:11:02,619 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:11:02,619 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:11:02,621 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:11:02,622 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:11:02,622 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-01-01 20:11:02,640 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:11:02,642 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:11:02,644 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:11:02,645 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:11:02,645 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:11:02,646 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:11:02,646 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 20:11:02,646 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:11:02,646 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:11:02,646 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 20:11:02,648 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:11:02,648 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 20:11:02,648 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 20:11:02,648 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:11:02,648 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 20:11:02,648 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:11:02,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:11:02,649 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:11:02,649 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:11:02,649 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:11:02,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:11:02,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:11:02,651 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:11:02,651 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:11:02,651 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:11:02,651 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-01 20:11:02,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:11:02,701 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:11:02,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:11:02,706 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:11:02,707 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:11:02,708 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-01 20:11:02,768 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f774fbfc/026463515b2742c4b87cc24d02fa79e4/FLAG217745693 [2019-01-01 20:11:03,336 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:11:03,337 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2019-01-01 20:11:03,353 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f774fbfc/026463515b2742c4b87cc24d02fa79e4/FLAG217745693 [2019-01-01 20:11:03,610 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f774fbfc/026463515b2742c4b87cc24d02fa79e4 [2019-01-01 20:11:03,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:11:03,615 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 20:11:03,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:11:03,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:11:03,621 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:11:03,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:11:03" (1/1) ... [2019-01-01 20:11:03,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f79300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:03, skipping insertion in model container [2019-01-01 20:11:03,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:11:03" (1/1) ... [2019-01-01 20:11:03,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:11:03,692 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:11:04,028 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:11:04,048 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:11:04,202 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:11:04,262 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:11:04,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:04 WrapperNode [2019-01-01 20:11:04,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:11:04,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:11:04,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:11:04,264 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:11:04,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:04" (1/1) ... [2019-01-01 20:11:04,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:04" (1/1) ... [2019-01-01 20:11:04,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:04" (1/1) ... [2019-01-01 20:11:04,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:04" (1/1) ... [2019-01-01 20:11:04,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:04" (1/1) ... [2019-01-01 20:11:04,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:04" (1/1) ... [2019-01-01 20:11:04,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:04" (1/1) ... [2019-01-01 20:11:04,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:11:04,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:11:04,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:11:04,350 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:11:04,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:04" (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-01 20:11:04,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 20:11:04,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:11:04,427 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-01 20:11:04,428 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 20:11:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 20:11:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 20:11:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 20:11:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 20:11:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 20:11:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 20:11:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 20:11:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 20:11:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 20:11:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 20:11:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 20:11:04,431 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 20:11:04,431 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 20:11:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 20:11:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 20:11:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 20:11:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 20:11:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 20:11:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 20:11:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 20:11:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 20:11:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 20:11:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 20:11:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 20:11:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 20:11:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 20:11:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 20:11:04,436 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 20:11:04,436 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 20:11:04,436 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 20:11:04,436 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 20:11:04,436 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 20:11:04,436 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 20:11:04,436 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 20:11:04,437 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 20:11:04,437 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 20:11:04,437 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 20:11:04,437 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 20:11:04,437 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 20:11:04,437 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 20:11:04,437 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 20:11:04,438 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 20:11:04,439 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 20:11:04,439 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 20:11:04,440 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 20:11:04,440 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 20:11:04,440 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 20:11:04,440 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 20:11:04,440 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 20:11:04,440 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 20:11:04,440 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 20:11:04,442 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 20:11:04,442 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 20:11:04,442 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 20:11:04,442 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 20:11:04,442 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 20:11:04,442 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 20:11:04,442 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 20:11:04,443 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 20:11:04,443 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 20:11:04,443 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 20:11:04,443 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 20:11:04,443 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 20:11:04,443 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 20:11:04,443 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 20:11:04,444 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 20:11:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-01 20:11:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 20:11:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 20:11:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 20:11:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 20:11:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 20:11:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 20:11:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 20:11:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 20:11:04,446 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 20:11:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 20:11:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 20:11:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 20:11:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 20:11:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 20:11:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 20:11:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 20:11:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 20:11:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 20:11:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 20:11:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 20:11:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 20:11:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 20:11:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 20:11:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 20:11:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 20:11:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 20:11:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 20:11:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 20:11:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 20:11:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 20:11:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 20:11:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 20:11:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 20:11:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 20:11:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 20:11:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 20:11:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-01 20:11:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 20:11:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 20:11:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 20:11:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 20:11:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 20:11:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 20:11:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 20:11:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 20:11:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:11:05,382 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:11:05,382 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-01 20:11:05,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:11:05 BoogieIcfgContainer [2019-01-01 20:11:05,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:11:05,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:11:05,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:11:05,388 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:11:05,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:11:03" (1/3) ... [2019-01-01 20:11:05,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0f5597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:11:05, skipping insertion in model container [2019-01-01 20:11:05,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:04" (2/3) ... [2019-01-01 20:11:05,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0f5597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:11:05, skipping insertion in model container [2019-01-01 20:11:05,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:11:05" (3/3) ... [2019-01-01 20:11:05,392 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list_false-unreach-call_false-valid-memcleanup.i [2019-01-01 20:11:05,403 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:11:05,415 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-01-01 20:11:05,434 INFO L257 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-01-01 20:11:05,465 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:11:05,466 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:11:05,466 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 20:11:05,466 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:11:05,466 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:11:05,466 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:11:05,466 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:11:05,467 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:11:05,467 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:11:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-01-01 20:11:05,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 20:11:05,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:05,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:11:05,499 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr6REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 20:11:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:05,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1839855770, now seen corresponding path program 1 times [2019-01-01 20:11:05,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:05,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:05,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:05,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:05,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:05,664 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-01 20:11:05,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:05,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:11:05,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-01 20:11:05,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 20:11:05,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 20:11:05,689 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2019-01-01 20:11:05,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:05,711 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-01-01 20:11:05,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 20:11:05,713 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-01 20:11:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:05,723 INFO L225 Difference]: With dead ends: 80 [2019-01-01 20:11:05,723 INFO L226 Difference]: Without dead ends: 72 [2019-01-01 20:11:05,725 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-01 20:11:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-01 20:11:05,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-01 20:11:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-01 20:11:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-01-01 20:11:05,771 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 10 [2019-01-01 20:11:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:05,772 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-01-01 20:11:05,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-01 20:11:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-01-01 20:11:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 20:11:05,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:05,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:11:05,774 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr6REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 20:11:05,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:05,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1200918369, now seen corresponding path program 1 times [2019-01-01 20:11:05,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:05,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:05,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:05,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:05,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:05,903 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-01 20:11:05,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:05,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:11:05,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:11:05,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:11:05,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:11:05,906 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 4 states. [2019-01-01 20:11:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:06,419 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-01-01 20:11:06,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:11:06,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-01 20:11:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:06,423 INFO L225 Difference]: With dead ends: 93 [2019-01-01 20:11:06,423 INFO L226 Difference]: Without dead ends: 93 [2019-01-01 20:11:06,424 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-01 20:11:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-01 20:11:06,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2019-01-01 20:11:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-01 20:11:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-01-01 20:11:06,434 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 11 [2019-01-01 20:11:06,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:06,435 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-01-01 20:11:06,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:11:06,435 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-01-01 20:11:06,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 20:11:06,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:06,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:11:06,437 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr6REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 20:11:06,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:06,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1200918370, now seen corresponding path program 1 times [2019-01-01 20:11:06,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:06,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:06,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:06,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:06,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:06,592 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-01 20:11:06,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:06,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:11:06,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:11:06,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:11:06,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:11:06,594 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 4 states. [2019-01-01 20:11:07,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:07,162 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-01-01 20:11:07,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:11:07,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-01 20:11:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:07,165 INFO L225 Difference]: With dead ends: 99 [2019-01-01 20:11:07,166 INFO L226 Difference]: Without dead ends: 99 [2019-01-01 20:11:07,166 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-01 20:11:07,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-01 20:11:07,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2019-01-01 20:11:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-01 20:11:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-01-01 20:11:07,176 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 11 [2019-01-01 20:11:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:07,176 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-01-01 20:11:07,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:11:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-01-01 20:11:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 20:11:07,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:07,177 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-01 20:11:07,178 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr6REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 20:11:07,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:07,178 INFO L82 PathProgramCache]: Analyzing trace with hash 709394635, now seen corresponding path program 1 times [2019-01-01 20:11:07,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:07,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:07,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:07,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:07,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:07,266 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-01 20:11:07,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:07,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:11:07,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:11:07,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:11:07,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:11:07,268 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 4 states. [2019-01-01 20:11:07,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:07,412 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2019-01-01 20:11:07,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:11:07,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-01 20:11:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:07,415 INFO L225 Difference]: With dead ends: 95 [2019-01-01 20:11:07,415 INFO L226 Difference]: Without dead ends: 95 [2019-01-01 20:11:07,416 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-01 20:11:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-01 20:11:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2019-01-01 20:11:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-01 20:11:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-01-01 20:11:07,424 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 19 [2019-01-01 20:11:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:07,424 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-01-01 20:11:07,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:11:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-01-01 20:11:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 20:11:07,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:07,426 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-01 20:11:07,426 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr6REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 20:11:07,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:07,427 INFO L82 PathProgramCache]: Analyzing trace with hash 516443081, now seen corresponding path program 1 times [2019-01-01 20:11:07,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:07,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:07,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:07,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:07,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:07,523 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-01 20:11:07,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:07,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:11:07,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:11:07,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:11:07,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:11:07,525 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 5 states. [2019-01-01 20:11:07,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:07,736 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-01-01 20:11:07,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:11:07,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-01 20:11:07,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:07,739 INFO L225 Difference]: With dead ends: 99 [2019-01-01 20:11:07,739 INFO L226 Difference]: Without dead ends: 99 [2019-01-01 20:11:07,739 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-01 20:11:07,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-01 20:11:07,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2019-01-01 20:11:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-01 20:11:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2019-01-01 20:11:07,747 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 20 [2019-01-01 20:11:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:07,748 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2019-01-01 20:11:07,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:11:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2019-01-01 20:11:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 20:11:07,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:07,749 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-01 20:11:07,750 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr6REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 20:11:07,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:07,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1784715431, now seen corresponding path program 1 times [2019-01-01 20:11:07,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:07,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:07,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:07,818 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-01 20:11:07,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:07,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:11:07,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:11:07,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:11:07,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:11:07,819 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 3 states. [2019-01-01 20:11:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:07,858 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2019-01-01 20:11:07,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:11:07,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-01 20:11:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:07,864 INFO L225 Difference]: With dead ends: 142 [2019-01-01 20:11:07,864 INFO L226 Difference]: Without dead ends: 142 [2019-01-01 20:11:07,865 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-01 20:11:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-01 20:11:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 101. [2019-01-01 20:11:07,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-01 20:11:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2019-01-01 20:11:07,883 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 20 [2019-01-01 20:11:07,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:07,883 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2019-01-01 20:11:07,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:11:07,883 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2019-01-01 20:11:07,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 20:11:07,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:07,885 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-01 20:11:07,886 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr6REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 20:11:07,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:07,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1488890801, now seen corresponding path program 1 times [2019-01-01 20:11:07,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:07,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:07,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:07,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:07,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:08,015 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-01 20:11:08,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:08,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 20:11:08,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:11:08,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:11:08,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:11:08,017 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2019-01-01 20:11:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:08,463 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2019-01-01 20:11:08,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:11:08,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-01 20:11:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:08,466 INFO L225 Difference]: With dead ends: 141 [2019-01-01 20:11:08,466 INFO L226 Difference]: Without dead ends: 141 [2019-01-01 20:11:08,467 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-01 20:11:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-01 20:11:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 104. [2019-01-01 20:11:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 20:11:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2019-01-01 20:11:08,489 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 20 [2019-01-01 20:11:08,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:08,490 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2019-01-01 20:11:08,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:11:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2019-01-01 20:11:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 20:11:08,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:08,493 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-01 20:11:08,494 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr6REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 20:11:08,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:08,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1171550577, now seen corresponding path program 1 times [2019-01-01 20:11:08,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:08,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:08,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:08,613 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-01 20:11:08,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:08,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:11:08,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:11:08,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:11:08,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:11:08,618 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand 5 states. [2019-01-01 20:11:08,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:08,814 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2019-01-01 20:11:08,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:11:08,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-01 20:11:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:08,816 INFO L225 Difference]: With dead ends: 118 [2019-01-01 20:11:08,817 INFO L226 Difference]: Without dead ends: 114 [2019-01-01 20:11:08,817 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-01 20:11:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-01 20:11:08,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2019-01-01 20:11:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 20:11:08,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2019-01-01 20:11:08,829 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 21 [2019-01-01 20:11:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:08,830 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2019-01-01 20:11:08,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:11:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2019-01-01 20:11:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 20:11:08,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:08,833 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-01 20:11:08,833 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr6REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 20:11:08,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:08,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1170133520, now seen corresponding path program 1 times [2019-01-01 20:11:08,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:08,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:08,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:08,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:08,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:09,058 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-01 20:11:09,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:09,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 20:11:09,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:11:09,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:11:09,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:11:09,059 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand 7 states. [2019-01-01 20:11:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:09,370 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2019-01-01 20:11:09,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:11:09,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-01 20:11:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:09,373 INFO L225 Difference]: With dead ends: 120 [2019-01-01 20:11:09,373 INFO L226 Difference]: Without dead ends: 113 [2019-01-01 20:11:09,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:11:09,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-01 20:11:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2019-01-01 20:11:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 20:11:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2019-01-01 20:11:09,387 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 21 [2019-01-01 20:11:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:09,388 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2019-01-01 20:11:09,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:11:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2019-01-01 20:11:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 20:11:09,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:09,393 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-01 20:11:09,393 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr6REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 20:11:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:09,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1459924814, now seen corresponding path program 1 times [2019-01-01 20:11:09,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:09,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:09,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:09,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:09,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:09,624 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-01 20:11:09,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:09,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 20:11:09,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:11:09,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:11:09,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:11:09,626 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 6 states. [2019-01-01 20:11:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:09,836 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2019-01-01 20:11:09,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:11:09,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-01 20:11:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:09,838 INFO L225 Difference]: With dead ends: 105 [2019-01-01 20:11:09,838 INFO L226 Difference]: Without dead ends: 105 [2019-01-01 20:11:09,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:11:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-01 20:11:09,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2019-01-01 20:11:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 20:11:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2019-01-01 20:11:09,845 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 21 [2019-01-01 20:11:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:09,845 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2019-01-01 20:11:09,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:11:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2019-01-01 20:11:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 20:11:09,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:09,847 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-01 20:11:09,847 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr6REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 20:11:09,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:09,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1459924815, now seen corresponding path program 1 times [2019-01-01 20:11:09,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:09,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:09,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:09,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:09,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:09,971 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-01 20:11:09,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:09,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 20:11:09,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:11:09,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:11:09,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:11:09,973 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 6 states. [2019-01-01 20:11:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:10,277 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2019-01-01 20:11:10,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:11:10,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-01 20:11:10,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:10,280 INFO L225 Difference]: With dead ends: 96 [2019-01-01 20:11:10,280 INFO L226 Difference]: Without dead ends: 96 [2019-01-01 20:11:10,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:11:10,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-01 20:11:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2019-01-01 20:11:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-01 20:11:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2019-01-01 20:11:10,284 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 21 [2019-01-01 20:11:10,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:10,286 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2019-01-01 20:11:10,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:11:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2019-01-01 20:11:10,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 20:11:10,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:10,287 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-01 20:11:10,287 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr6REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 20:11:10,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:10,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1275124124, now seen corresponding path program 1 times [2019-01-01 20:11:10,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:10,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:10,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:10,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:10,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:10,739 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-01 20:11:10,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:11:10,739 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-01 20:11:10,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:10,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:11:10,896 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-01 20:11:10,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:10,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:10,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 20:11:11,256 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-01 20:11:11,262 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-01 20:11:11,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:11,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:11,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:11,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-01-01 20:11:11,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:11,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:11,372 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-01 20:11:11,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:11,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:11,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-01-01 20:11:11,581 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-01 20:11:11,588 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-01 20:11:11,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:11,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:11,616 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-01 20:11:11,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:11,624 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-01 20:11:11,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:11,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:11,646 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-01 20:11:11,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2019-01-01 20:11:11,753 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-01 20:11:11,758 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-01 20:11:11,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:11,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:11,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:11,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2019-01-01 20:11:11,827 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-01 20:11:11,830 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-01 20:11:11,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:11,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:11,847 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-01 20:11:11,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2019-01-01 20:11:12,004 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-01 20:11:12,010 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-01 20:11:12,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:12,020 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-01 20:11:12,021 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:12,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:12,031 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-01 20:11:12,031 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-01-01 20:11:12,066 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-01 20:11:12,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:11:12,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-01-01 20:11:12,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 20:11:12,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 20:11:12,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-01-01 20:11:12,093 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 22 states. [2019-01-01 20:11:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:14,469 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2019-01-01 20:11:14,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-01 20:11:14,469 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-01-01 20:11:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:14,471 INFO L225 Difference]: With dead ends: 194 [2019-01-01 20:11:14,471 INFO L226 Difference]: Without dead ends: 191 [2019-01-01 20:11:14,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=303, Invalid=1419, Unknown=0, NotChecked=0, Total=1722 [2019-01-01 20:11:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-01 20:11:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 102. [2019-01-01 20:11:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-01 20:11:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2019-01-01 20:11:14,477 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 30 [2019-01-01 20:11:14,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:14,478 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2019-01-01 20:11:14,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 20:11:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2019-01-01 20:11:14,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 20:11:14,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:14,480 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-01 20:11:14,480 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr6REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 20:11:14,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:14,480 INFO L82 PathProgramCache]: Analyzing trace with hash -956667332, now seen corresponding path program 1 times [2019-01-01 20:11:14,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:14,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:14,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:14,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:14,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:14,755 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-01 20:11:14,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:11:14,756 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-01 20:11:14,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:14,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:11:14,863 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-01 20:11:14,866 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-01 20:11:14,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:14,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:14,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:14,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-01-01 20:11:14,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:14,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:14,911 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-01 20:11:14,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:14,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:14,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-01-01 20:11:14,971 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-01 20:11:14,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:14,985 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-01 20:11:14,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:14,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:15,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01 20:11:15,014 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-01 20:11:15,014 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:15,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:15,027 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-01 20:11:15,028 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-01 20:11:15,102 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-01 20:11:15,108 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-01 20:11:15,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:15,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:15,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:15,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-01-01 20:11:15,171 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-01 20:11:15,175 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-01 20:11:15,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:15,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:15,188 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-01 20:11:15,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-01-01 20:11:15,247 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-01 20:11:15,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-01 20:11:15,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:15,256 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-01 20:11:15,257 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:15,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:15,272 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-01 20:11:15,273 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-01-01 20:11:15,293 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-01 20:11:15,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:11:15,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-01-01 20:11:15,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-01 20:11:15,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-01 20:11:15,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2019-01-01 20:11:15,314 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 23 states. [2019-01-01 20:11:16,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:16,291 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2019-01-01 20:11:16,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 20:11:16,292 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2019-01-01 20:11:16,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:16,294 INFO L225 Difference]: With dead ends: 175 [2019-01-01 20:11:16,294 INFO L226 Difference]: Without dead ends: 171 [2019-01-01 20:11:16,295 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-01 20:11:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-01 20:11:16,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 98. [2019-01-01 20:11:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-01 20:11:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-01-01 20:11:16,299 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 31 [2019-01-01 20:11:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:16,299 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-01-01 20:11:16,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-01 20:11:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-01-01 20:11:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-01 20:11:16,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:16,301 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-01 20:11:16,301 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr6REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 20:11:16,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:16,302 INFO L82 PathProgramCache]: Analyzing trace with hash -208880943, now seen corresponding path program 1 times [2019-01-01 20:11:16,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:16,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:16,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:16,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:16,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:17,086 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2019-01-01 20:11:17,292 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-01-01 20:11:17,436 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-01 20:11:17,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:11:17,436 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-01 20:11:17,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:17,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:11:17,567 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-01 20:11:17,570 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-01 20:11:17,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:17,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:17,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:17,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-01-01 20:11:17,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:17,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:17,680 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-01 20:11:17,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:17,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:17,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-01-01 20:11:17,851 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-01 20:11:17,871 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-01 20:11:17,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:17,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,120 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-01 20:11:18,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:18,145 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-01 20:11:18,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,167 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-01 20:11:18,167 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-01 20:11:18,214 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-01 20:11:18,218 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-01 20:11:18,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-01-01 20:11:18,340 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-01 20:11:18,344 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-01 20:11:18,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-01-01 20:11:18,427 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-01 20:11:18,429 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-01 20:11:18,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,453 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-01 20:11:18,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:18,458 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-01 20:11:18,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,474 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:31 [2019-01-01 20:11:18,509 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-01 20:11:18,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-01 20:11:18,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 20:11:18,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2019-01-01 20:11:18,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:18,631 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-01 20:11:18,659 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 20:11:18,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,805 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-01 20:11:18,806 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:18,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-01-01 20:11:18,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-01 20:11:18,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:18,914 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-01 20:11:18,914 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:18,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 20:11:18,975 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-01 20:11:18,975 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2019-01-01 20:11:19,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:19,255 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-01 20:11:19,299 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-01 20:11:19,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:19,308 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-01 20:11:19,308 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:19,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:19,334 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-01 20:11:19,337 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-01 20:11:19,337 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:19,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 20:11:19,359 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:19,365 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:19,374 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-01 20:11:19,374 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:53, output treesize:7 [2019-01-01 20:11:19,405 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-01 20:11:19,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:11:19,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-01-01 20:11:19,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-01 20:11:19,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-01 20:11:19,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2019-01-01 20:11:19,427 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 32 states. [2019-01-01 20:11:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:21,519 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-01-01 20:11:21,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-01 20:11:21,520 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-01-01 20:11:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:21,521 INFO L225 Difference]: With dead ends: 72 [2019-01-01 20:11:21,522 INFO L226 Difference]: Without dead ends: 66 [2019-01-01 20:11:21,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=514, Invalid=2908, Unknown=0, NotChecked=0, Total=3422 [2019-01-01 20:11:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-01 20:11:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2019-01-01 20:11:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-01 20:11:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-01-01 20:11:21,526 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 40 [2019-01-01 20:11:21,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:21,527 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-01-01 20:11:21,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-01 20:11:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-01-01 20:11:21,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 20:11:21,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:21,534 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-01 20:11:21,535 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr6REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 20:11:21,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:21,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2032100207, now seen corresponding path program 1 times [2019-01-01 20:11:21,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:21,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:21,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:21,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:21,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:21,872 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-01 20:11:21,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:11:21,873 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-01 20:11:21,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:21,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:11:22,055 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-01 20:11:22,058 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-01 20:11:22,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2019-01-01 20:11:22,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:22,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:22,093 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-01 20:11:22,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-01-01 20:11:22,132 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-01 20:11:22,137 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-01 20:11:22,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,181 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-01 20:11:22,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:22,187 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-01 20:11:22,187 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,205 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-01 20:11:22,205 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-01-01 20:11:22,238 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-01 20:11:22,246 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-01 20:11:22,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:17 [2019-01-01 20:11:22,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-01 20:11:22,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 20:11:22,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-01-01 20:11:22,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:22,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:22,467 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-01 20:11:22,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-01-01 20:11:22,509 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-01 20:11:22,517 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-01 20:11:22,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,551 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-01 20:11:22,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:22,561 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-01 20:11:22,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,580 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-01 20:11:22,580 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-01-01 20:11:22,634 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-01 20:11:22,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-01 20:11:22,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,677 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-01 20:11:22,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:23 [2019-01-01 20:11:22,798 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-01 20:11:22,803 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-01 20:11:22,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:22,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-01-01 20:11:22,971 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 20:11:22,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 20:11:23,017 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-01 20:11:23,017 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:34, output treesize:50 [2019-01-01 20:11:23,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-01-01 20:11:23,130 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-01 20:11:23,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 20:11:23,145 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-01 20:11:23,145 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:23,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 20:11:23,172 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-01 20:11:23,173 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2019-01-01 20:11:23,331 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-01 20:11:23,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:11:23,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-01-01 20:11:23,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-01 20:11:23,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-01 20:11:23,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1019, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 20:11:23,352 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 34 states. [2019-01-01 20:11:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:24,957 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-01-01 20:11:24,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-01 20:11:24,958 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2019-01-01 20:11:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:24,958 INFO L225 Difference]: With dead ends: 51 [2019-01-01 20:11:24,958 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:11:24,960 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-01 20:11:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:11:24,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:11:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:11:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:11:24,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-01-01 20:11:24,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:24,961 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:11:24,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-01 20:11:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:11:24,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:11:24,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:11:24 BoogieIcfgContainer [2019-01-01 20:11:24,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:11:24,968 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:11:24,968 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:11:24,969 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:11:24,969 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:11:05" (3/4) ... [2019-01-01 20:11:24,973 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:11:24,981 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 20:11:24,981 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-01 20:11:24,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 20:11:24,988 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-01 20:11:24,988 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 20:11:24,990 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 20:11:25,041 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:11:25,041 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:11:25,042 INFO L168 Benchmark]: Toolchain (without parser) took 21427.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.9 MB). Free memory was 942.0 MB in the beginning and 1.2 GB in the end (delta: -274.8 MB). Peak memory consumption was 79.1 MB. Max. memory is 11.5 GB. [2019-01-01 20:11:25,044 INFO L168 Benchmark]: CDTParser took 0.17 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-01 20:11:25,044 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -190.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:11:25,044 INFO L168 Benchmark]: Boogie Preprocessor took 84.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-01 20:11:25,046 INFO L168 Benchmark]: RCFGBuilder took 1033.79 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: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2019-01-01 20:11:25,047 INFO L168 Benchmark]: TraceAbstraction took 19583.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -161.5 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-01-01 20:11:25,047 INFO L168 Benchmark]: Witness Printer took 72.88 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: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-01-01 20:11:25,051 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.17 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 647.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -190.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1033.79 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: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19583.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -161.5 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * Witness Printer took 72.88 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: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 643]: 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: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 645]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 658]: 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: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 651]: 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: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: 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: 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 - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 82 locations, 29 error locations. SAFE Result, 19.5s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 10.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 749 SDtfs, 1746 SDslu, 2612 SDs, 0 SdLazy, 3182 SolverSat, 497 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 115 SyntacticMatches, 5 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2205 ImplicationChecksByTransitivity, 9.3s 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, 8.3s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 460 ConstructedInterpolants, 25 QuantifiedInterpolants, 134885 SizeOfPredicates, 65 NumberOfNonLiveVariables, 658 ConjunctsInSsa, 153 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 10/66 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...