./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 986c31897144a5b76f321e97eaa1d3383cce25ed ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:12:53,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:12:53,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:12:53,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:12:53,592 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:12:53,593 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:12:53,595 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:12:53,597 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:12:53,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:12:53,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:12:53,601 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:12:53,602 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:12:53,603 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:12:53,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:12:53,608 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:12:53,609 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:12:53,610 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:12:53,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:12:53,622 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:12:53,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:12:53,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:12:53,631 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:12:53,636 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:12:53,639 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:12:53,640 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:12:53,641 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:12:53,641 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:12:53,642 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:12:53,643 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:12:53,644 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:12:53,644 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:12:53,645 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:12:53,645 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:12:53,646 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:12:53,646 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:12:53,648 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:12:53,648 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 17:12:53,664 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:12:53,664 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:12:53,665 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:12:53,665 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:12:53,665 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:12:53,666 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:12:53,666 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:12:53,667 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:12:53,667 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:12:53,667 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:12:53,667 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:12:53,667 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:12:53,667 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:12:53,668 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:12:53,668 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:12:53,668 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:12:53,668 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:12:53,668 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:12:53,668 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:12:53,670 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:12:53,670 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:12:53,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:12:53,671 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:12:53,671 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:12:53,671 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:12:53,671 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:12:53,671 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 986c31897144a5b76f321e97eaa1d3383cce25ed [2019-01-01 17:12:53,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:12:53,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:12:53,727 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:12:53,728 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:12:53,729 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:12:53,729 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:12:53,797 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5440a28/a934e21d842b43aca4082802da63389a/FLAGb98da528f [2019-01-01 17:12:54,277 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:12:54,278 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:12:54,293 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5440a28/a934e21d842b43aca4082802da63389a/FLAGb98da528f [2019-01-01 17:12:54,599 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5440a28/a934e21d842b43aca4082802da63389a [2019-01-01 17:12:54,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:12:54,607 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:12:54,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:12:54,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:12:54,614 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:12:54,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:12:54" (1/1) ... [2019-01-01 17:12:54,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312f8615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:54, skipping insertion in model container [2019-01-01 17:12:54,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:12:54" (1/1) ... [2019-01-01 17:12:54,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:12:54,690 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:12:55,050 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:12:55,067 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:12:55,132 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:12:55,190 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:12:55,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:55 WrapperNode [2019-01-01 17:12:55,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:12:55,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:12:55,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:12:55,193 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:12:55,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:55" (1/1) ... [2019-01-01 17:12:55,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:55" (1/1) ... [2019-01-01 17:12:55,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:55" (1/1) ... [2019-01-01 17:12:55,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:55" (1/1) ... [2019-01-01 17:12:55,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:55" (1/1) ... [2019-01-01 17:12:55,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:55" (1/1) ... [2019-01-01 17:12:55,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:55" (1/1) ... [2019-01-01 17:12:55,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:12:55,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:12:55,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:12:55,347 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:12:55,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:55" (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 17:12:55,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:12:55,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:12:55,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:12:55,411 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:12:55,411 INFO L138 BoogieDeclarations]: Found implementation of procedure diff [2019-01-01 17:12:55,411 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:12:55,411 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:12:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:12:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:12:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:12:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:12:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:12:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:12:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:12:55,414 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:12:55,414 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:12:55,414 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:12:55,414 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:12:55,414 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:12:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:12:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:12:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:12:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:12:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:12:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:12:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:12:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:12:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:12:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:12:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:12:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:12:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:12:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:12:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:12:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:12:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:12:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:12:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:12:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:12:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:12:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:12:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:12:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:12:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:12:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:12:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:12:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:12:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:12:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:12:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:12:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:12:55,423 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:12:55,423 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:12:55,423 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:12:55,423 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:12:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:12:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:12:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:12:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:12:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:12:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:12:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:12:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:12:55,426 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:12:55,426 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:12:55,426 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:12:55,426 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:12:55,426 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:12:55,427 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:12:55,427 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:12:55,428 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:12:55,428 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:12:55,428 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:12:55,428 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:12:55,428 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:12:55,428 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:12:55,428 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:12:55,428 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:12:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:12:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:12:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:12:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:12:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:12:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:12:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:12:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:12:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:12:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:12:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:12:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:12:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:12:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:12:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:12:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:12:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:12:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:12:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure diff [2019-01-01 17:12:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:12:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:12:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:12:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:12:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:12:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:12:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:12:56,154 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:12:56,155 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-01 17:12:56,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:12:56 BoogieIcfgContainer [2019-01-01 17:12:56,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:12:56,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:12:56,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:12:56,160 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:12:56,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:12:54" (1/3) ... [2019-01-01 17:12:56,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bd7592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:12:56, skipping insertion in model container [2019-01-01 17:12:56,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:12:55" (2/3) ... [2019-01-01 17:12:56,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bd7592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:12:56, skipping insertion in model container [2019-01-01 17:12:56,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:12:56" (3/3) ... [2019-01-01 17:12:56,165 INFO L112 eAbstractionObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:12:56,176 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:12:56,184 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-01 17:12:56,200 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-01 17:12:56,230 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:12:56,231 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:12:56,231 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:12:56,231 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:12:56,232 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:12:56,232 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:12:56,233 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:12:56,233 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:12:56,233 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:12:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-01-01 17:12:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 17:12:56,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:56,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:56,267 INFO L423 AbstractCegarLoop]: === Iteration 1 === [diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:12:56,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:56,274 INFO L82 PathProgramCache]: Analyzing trace with hash -179147167, now seen corresponding path program 1 times [2019-01-01 17:12:56,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:56,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:56,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:56,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:56,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:56,627 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 17:12:56,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:56,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:12:56,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:12:56,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:12:56,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:12:56,657 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 5 states. [2019-01-01 17:12:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:56,910 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-01 17:12:56,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:12:56,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-01 17:12:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:56,923 INFO L225 Difference]: With dead ends: 35 [2019-01-01 17:12:56,923 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 17:12:56,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:12:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 17:12:56,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-01 17:12:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 17:12:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-01-01 17:12:56,962 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 14 [2019-01-01 17:12:56,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:56,963 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-01-01 17:12:56,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:12:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-01-01 17:12:56,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 17:12:56,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:56,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:56,964 INFO L423 AbstractCegarLoop]: === Iteration 2 === [diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:12:56,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:56,965 INFO L82 PathProgramCache]: Analyzing trace with hash -179147166, now seen corresponding path program 1 times [2019-01-01 17:12:56,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:56,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:56,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:56,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:56,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:57,208 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 17:12:57,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:57,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:12:57,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:12:57,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:12:57,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:12:57,212 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2019-01-01 17:12:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:57,802 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-01-01 17:12:57,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:12:57,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-01 17:12:57,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:57,808 INFO L225 Difference]: With dead ends: 48 [2019-01-01 17:12:57,808 INFO L226 Difference]: Without dead ends: 48 [2019-01-01 17:12:57,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:12:57,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-01 17:12:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2019-01-01 17:12:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 17:12:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-01-01 17:12:57,817 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 14 [2019-01-01 17:12:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:57,818 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-01-01 17:12:57,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:12:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2019-01-01 17:12:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:12:57,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:57,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:57,820 INFO L423 AbstractCegarLoop]: === Iteration 3 === [diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:12:57,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:57,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1258594887, now seen corresponding path program 1 times [2019-01-01 17:12:57,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:57,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:57,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:57,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:57,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:57,922 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 17:12:57,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:57,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:12:57,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:12:57,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:12:57,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:12:57,924 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 5 states. [2019-01-01 17:12:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:58,019 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2019-01-01 17:12:58,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:12:58,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-01 17:12:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:58,022 INFO L225 Difference]: With dead ends: 38 [2019-01-01 17:12:58,022 INFO L226 Difference]: Without dead ends: 38 [2019-01-01 17:12:58,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:12:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-01 17:12:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-01 17:12:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 17:12:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2019-01-01 17:12:58,030 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 15 [2019-01-01 17:12:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:58,030 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-01-01 17:12:58,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:12:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2019-01-01 17:12:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:12:58,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:58,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:58,033 INFO L423 AbstractCegarLoop]: === Iteration 4 === [diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:12:58,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:58,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1258594886, now seen corresponding path program 1 times [2019-01-01 17:12:58,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:58,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:58,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:58,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:58,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:58,194 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 17:12:58,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:58,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:12:58,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:12:58,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:12:58,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:12:58,196 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 7 states. [2019-01-01 17:12:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:58,410 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2019-01-01 17:12:58,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:12:58,411 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-01-01 17:12:58,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:58,412 INFO L225 Difference]: With dead ends: 60 [2019-01-01 17:12:58,412 INFO L226 Difference]: Without dead ends: 60 [2019-01-01 17:12:58,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:12:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-01 17:12:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2019-01-01 17:12:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 17:12:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2019-01-01 17:12:58,420 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 15 [2019-01-01 17:12:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:58,420 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2019-01-01 17:12:58,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:12:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2019-01-01 17:12:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:12:58,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:58,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:58,422 INFO L423 AbstractCegarLoop]: === Iteration 5 === [diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:12:58,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:58,422 INFO L82 PathProgramCache]: Analyzing trace with hash -362541574, now seen corresponding path program 1 times [2019-01-01 17:12:58,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:58,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:58,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:58,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:58,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:58,681 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 17:12:58,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:58,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:12:58,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:12:58,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:12:58,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:12:58,683 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand 5 states. [2019-01-01 17:12:58,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:58,751 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2019-01-01 17:12:58,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:12:58,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-01 17:12:58,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:58,757 INFO L225 Difference]: With dead ends: 54 [2019-01-01 17:12:58,757 INFO L226 Difference]: Without dead ends: 52 [2019-01-01 17:12:58,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:12:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-01 17:12:58,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-01-01 17:12:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 17:12:58,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2019-01-01 17:12:58,764 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 16 [2019-01-01 17:12:58,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:58,765 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2019-01-01 17:12:58,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:12:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2019-01-01 17:12:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:12:58,766 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:58,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:58,766 INFO L423 AbstractCegarLoop]: === Iteration 6 === [diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:12:58,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:58,767 INFO L82 PathProgramCache]: Analyzing trace with hash -361778601, now seen corresponding path program 1 times [2019-01-01 17:12:58,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:58,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:58,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:58,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:58,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:58,832 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 17:12:58,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:58,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:12:58,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:12:58,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:12:58,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:12:58,836 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand 5 states. [2019-01-01 17:12:58,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:58,924 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2019-01-01 17:12:58,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:12:58,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-01 17:12:58,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:58,927 INFO L225 Difference]: With dead ends: 45 [2019-01-01 17:12:58,927 INFO L226 Difference]: Without dead ends: 45 [2019-01-01 17:12:58,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:12:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-01 17:12:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-01 17:12:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 17:12:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2019-01-01 17:12:58,933 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 16 [2019-01-01 17:12:58,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:58,934 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2019-01-01 17:12:58,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:12:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2019-01-01 17:12:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:12:58,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:58,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:58,936 INFO L423 AbstractCegarLoop]: === Iteration 7 === [diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:12:58,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:58,937 INFO L82 PathProgramCache]: Analyzing trace with hash -361778600, now seen corresponding path program 1 times [2019-01-01 17:12:58,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:58,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:58,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:58,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:58,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:59,020 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 17:12:59,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:12:59,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:12:59,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:12:59,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:12:59,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:12:59,021 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand 6 states. [2019-01-01 17:12:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:59,092 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2019-01-01 17:12:59,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:12:59,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-01-01 17:12:59,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:12:59,096 INFO L225 Difference]: With dead ends: 54 [2019-01-01 17:12:59,096 INFO L226 Difference]: Without dead ends: 54 [2019-01-01 17:12:59,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:12:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-01 17:12:59,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2019-01-01 17:12:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 17:12:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2019-01-01 17:12:59,103 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 16 [2019-01-01 17:12:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:12:59,103 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-01-01 17:12:59,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:12:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2019-01-01 17:12:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 17:12:59,104 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:12:59,104 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:12:59,105 INFO L423 AbstractCegarLoop]: === Iteration 8 === [diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:12:59,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:12:59,105 INFO L82 PathProgramCache]: Analyzing trace with hash -399235342, now seen corresponding path program 1 times [2019-01-01 17:12:59,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:12:59,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:12:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:59,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:12:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:59,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:12:59,412 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 17:12:59,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:12:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:12:59,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:12:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:12:59,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 17:12:59,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 12 [2019-01-01 17:12:59,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 17:12:59,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 17:12:59,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:12:59,614 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand 12 states. [2019-01-01 17:12:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:12:59,995 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2019-01-01 17:13:00,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:13:00,000 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-01-01 17:13:00,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:00,002 INFO L225 Difference]: With dead ends: 91 [2019-01-01 17:13:00,004 INFO L226 Difference]: Without dead ends: 91 [2019-01-01 17:13:00,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:13:00,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-01 17:13:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 73. [2019-01-01 17:13:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-01 17:13:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2019-01-01 17:13:00,023 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 97 transitions. Word has length 19 [2019-01-01 17:13:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:00,023 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 97 transitions. [2019-01-01 17:13:00,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 17:13:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2019-01-01 17:13:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 17:13:00,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:00,029 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:00,030 INFO L423 AbstractCegarLoop]: === Iteration 9 === [diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:00,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:00,030 INFO L82 PathProgramCache]: Analyzing trace with hash -141069904, now seen corresponding path program 1 times [2019-01-01 17:13:00,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:00,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:00,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:00,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:00,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:00,348 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 17:13:00,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:00,349 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 17:13:00,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:00,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:00,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:13:00,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 17:13:00,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:13:00,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:13:00,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 17:13:00,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:00,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:00,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-01 17:13:00,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-01 17:13:00,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2019-01-01 17:13:00,564 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:00,584 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:00,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:00,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:00,615 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-01-01 17:13:01,078 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 17:13:01,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:01,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-01-01 17:13:01,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 17:13:01,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 17:13:01,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:13:01,108 INFO L87 Difference]: Start difference. First operand 73 states and 97 transitions. Second operand 14 states. [2019-01-01 17:13:01,748 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-01 17:13:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:02,111 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2019-01-01 17:13:02,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:13:02,112 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-01-01 17:13:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:02,113 INFO L225 Difference]: With dead ends: 109 [2019-01-01 17:13:02,114 INFO L226 Difference]: Without dead ends: 109 [2019-01-01 17:13:02,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-01-01 17:13:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-01 17:13:02,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 64. [2019-01-01 17:13:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-01 17:13:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2019-01-01 17:13:02,121 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 19 [2019-01-01 17:13:02,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:02,121 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2019-01-01 17:13:02,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 17:13:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2019-01-01 17:13:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:13:02,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:02,123 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 17:13:02,123 INFO L423 AbstractCegarLoop]: === Iteration 10 === [diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:02,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:02,123 INFO L82 PathProgramCache]: Analyzing trace with hash 506716446, now seen corresponding path program 1 times [2019-01-01 17:13:02,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:02,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:02,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:02,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:02,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:02,266 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 17:13:02,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:02,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:13:02,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:02,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:02,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:02,269 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand 4 states. [2019-01-01 17:13:02,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:02,506 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2019-01-01 17:13:02,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:02,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-01-01 17:13:02,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:02,507 INFO L225 Difference]: With dead ends: 86 [2019-01-01 17:13:02,508 INFO L226 Difference]: Without dead ends: 86 [2019-01-01 17:13:02,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:02,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-01 17:13:02,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2019-01-01 17:13:02,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-01 17:13:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2019-01-01 17:13:02,522 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 20 [2019-01-01 17:13:02,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:02,527 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2019-01-01 17:13:02,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:02,528 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2019-01-01 17:13:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:13:02,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:02,528 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 17:13:02,529 INFO L423 AbstractCegarLoop]: === Iteration 11 === [diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:02,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:02,529 INFO L82 PathProgramCache]: Analyzing trace with hash 508563488, now seen corresponding path program 1 times [2019-01-01 17:13:02,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:02,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:02,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:02,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:02,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 17:13:02,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:02,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:13:02,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:13:02,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:13:02,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:13:02,970 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 6 states. [2019-01-01 17:13:03,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:03,073 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2019-01-01 17:13:03,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:13:03,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-01 17:13:03,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:03,075 INFO L225 Difference]: With dead ends: 98 [2019-01-01 17:13:03,076 INFO L226 Difference]: Without dead ends: 98 [2019-01-01 17:13:03,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:13:03,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-01 17:13:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2019-01-01 17:13:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-01 17:13:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 117 transitions. [2019-01-01 17:13:03,086 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 117 transitions. Word has length 20 [2019-01-01 17:13:03,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:03,086 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 117 transitions. [2019-01-01 17:13:03,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:13:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2019-01-01 17:13:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:13:03,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:03,089 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:03,089 INFO L423 AbstractCegarLoop]: === Iteration 12 === [diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:03,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:03,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1631778687, now seen corresponding path program 1 times [2019-01-01 17:13:03,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:03,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:03,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:03,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:03,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:03,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:03,225 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 17:13:03,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:03,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 17:13:03,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 17:13:03,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2019-01-01 17:13:03,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 17:13:03,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 17:13:03,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:13:03,451 INFO L87 Difference]: Start difference. First operand 90 states and 117 transitions. Second operand 11 states. [2019-01-01 17:13:03,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:03,596 INFO L93 Difference]: Finished difference Result 136 states and 168 transitions. [2019-01-01 17:13:03,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:13:03,597 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-01-01 17:13:03,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:03,598 INFO L225 Difference]: With dead ends: 136 [2019-01-01 17:13:03,598 INFO L226 Difference]: Without dead ends: 136 [2019-01-01 17:13:03,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-01 17:13:03,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-01 17:13:03,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2019-01-01 17:13:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-01 17:13:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 162 transitions. [2019-01-01 17:13:03,607 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 162 transitions. Word has length 22 [2019-01-01 17:13:03,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:03,607 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 162 transitions. [2019-01-01 17:13:03,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 17:13:03,607 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 162 transitions. [2019-01-01 17:13:03,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:13:03,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:03,608 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:03,609 INFO L423 AbstractCegarLoop]: === Iteration 13 === [diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:03,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:03,609 INFO L82 PathProgramCache]: Analyzing trace with hash 610710333, now seen corresponding path program 1 times [2019-01-01 17:13:03,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:03,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:03,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:03,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:03,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:03,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:03,907 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 17:13:03,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:03,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:04,051 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 17:13:04,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:13:04,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 17:13:04,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:13:04,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:13:04,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 17:13:04,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:04,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:04,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-01 17:13:04,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-01 17:13:04,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2019-01-01 17:13:04,190 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:04,202 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:04,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:04,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:04,228 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-01-01 17:13:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:04,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:04,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2019-01-01 17:13:04,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 17:13:04,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 17:13:04,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:13:04,722 INFO L87 Difference]: Start difference. First operand 129 states and 162 transitions. Second operand 15 states. [2019-01-01 17:13:05,376 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-01-01 17:13:05,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:05,444 INFO L93 Difference]: Finished difference Result 161 states and 192 transitions. [2019-01-01 17:13:05,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:13:05,445 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-01-01 17:13:05,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:05,448 INFO L225 Difference]: With dead ends: 161 [2019-01-01 17:13:05,448 INFO L226 Difference]: Without dead ends: 161 [2019-01-01 17:13:05,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-01-01 17:13:05,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-01 17:13:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2019-01-01 17:13:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-01 17:13:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2019-01-01 17:13:05,456 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 22 [2019-01-01 17:13:05,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:05,456 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2019-01-01 17:13:05,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 17:13:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2019-01-01 17:13:05,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:13:05,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:05,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:05,458 INFO L423 AbstractCegarLoop]: === Iteration 14 === [diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:05,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:05,458 INFO L82 PathProgramCache]: Analyzing trace with hash 475448279, now seen corresponding path program 1 times [2019-01-01 17:13:05,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:05,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:05,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:05,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:05,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:05,696 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 24 [2019-01-01 17:13:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 17:13:05,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:05,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:13:05,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:13:05,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:13:05,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:13:05,722 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand 6 states. [2019-01-01 17:13:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:05,866 INFO L93 Difference]: Finished difference Result 128 states and 152 transitions. [2019-01-01 17:13:05,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:13:05,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-01-01 17:13:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:05,868 INFO L225 Difference]: With dead ends: 128 [2019-01-01 17:13:05,868 INFO L226 Difference]: Without dead ends: 71 [2019-01-01 17:13:05,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-01 17:13:05,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2019-01-01 17:13:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-01 17:13:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2019-01-01 17:13:05,872 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 24 [2019-01-01 17:13:05,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:05,872 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-01-01 17:13:05,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:13:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2019-01-01 17:13:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 17:13:05,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:05,874 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:05,874 INFO L423 AbstractCegarLoop]: === Iteration 15 === [diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-01 17:13:05,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:05,874 INFO L82 PathProgramCache]: Analyzing trace with hash -979957108, now seen corresponding path program 1 times [2019-01-01 17:13:05,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:05,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:05,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:05,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:05,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 17:13:06,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:06,398 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:06,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:06,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:06,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-01 17:13:06,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 27 [2019-01-01 17:13:06,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 22 [2019-01-01 17:13:06,503 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:06,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 38 [2019-01-01 17:13:06,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2019-01-01 17:13:06,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 17:13:06,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 17:13:06,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-01-01 17:13:06,679 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:22, output treesize:62 [2019-01-01 17:13:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 17:13:06,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:06,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2019-01-01 17:13:06,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 17:13:06,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 17:13:06,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-01-01 17:13:06,948 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 16 states. [2019-01-01 17:13:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:07,923 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2019-01-01 17:13:07,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 17:13:07,924 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-01-01 17:13:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:07,924 INFO L225 Difference]: With dead ends: 100 [2019-01-01 17:13:07,926 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 17:13:07,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-01-01 17:13:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 17:13:07,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 17:13:07,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 17:13:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 17:13:07,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-01-01 17:13:07,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:07,927 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 17:13:07,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 17:13:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 17:13:07,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 17:13:07,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:13:07 BoogieIcfgContainer [2019-01-01 17:13:07,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:13:07,937 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:13:07,937 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:13:07,937 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:13:07,937 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:12:56" (3/4) ... [2019-01-01 17:13:07,941 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 17:13:07,948 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 17:13:07,948 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 17:13:07,949 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 17:13:07,949 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure diff [2019-01-01 17:13:07,949 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 17:13:07,954 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-01-01 17:13:07,954 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-01 17:13:07,954 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 17:13:08,008 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:13:08,008 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:13:08,009 INFO L168 Benchmark]: Toolchain (without parser) took 13403.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 275.3 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -259.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:08,010 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 17:13:08,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 582.24 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 924.5 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:08,011 INFO L168 Benchmark]: Boogie Preprocessor took 153.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -215.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:08,012 INFO L168 Benchmark]: RCFGBuilder took 809.19 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:08,013 INFO L168 Benchmark]: TraceAbstraction took 11779.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -120.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:08,013 INFO L168 Benchmark]: Witness Printer took 71.98 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:08,017 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 582.24 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 924.5 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 153.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -215.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 809.19 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11779.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -120.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. * Witness Printer took 71.98 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 9 error locations. SAFE Result, 11.7s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 420 SDtfs, 1032 SDslu, 1256 SDs, 0 SdLazy, 898 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 106 SyntacticMatches, 4 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=12, 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, 188 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 376 ConstructedInterpolants, 44 QuantifiedInterpolants, 74573 SizeOfPredicates, 40 NumberOfNonLiveVariables, 786 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 25/62 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...