./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcmp-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/openbsd_cstrcmp-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 cbb495583d601bf9f19d9da57531415381b22d5a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:13:19,593 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:13:19,595 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:13:19,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:13:19,608 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:13:19,610 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:13:19,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:13:19,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:13:19,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:13:19,617 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:13:19,618 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:13:19,618 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:13:19,619 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:13:19,620 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:13:19,622 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:13:19,623 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:13:19,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:13:19,626 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:13:19,629 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:13:19,631 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:13:19,632 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:13:19,634 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:13:19,637 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:13:19,638 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:13:19,638 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:13:19,639 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:13:19,641 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:13:19,642 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:13:19,643 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:13:19,644 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:13:19,644 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:13:19,646 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:13:19,646 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:13:19,646 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:13:19,647 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:13:19,649 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:13:19,649 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:13:19,678 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:13:19,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:13:19,685 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:13:19,685 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:13:19,685 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:13:19,686 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:13:19,686 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:13:19,687 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:13:19,687 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:13:19,687 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:13:19,687 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:13:19,687 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:13:19,687 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:13:19,688 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:13:19,690 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:13:19,690 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:13:19,690 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:13:19,690 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:13:19,691 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:13:19,691 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:13:19,691 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:13:19,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:13:19,691 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:13:19,691 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:13:19,692 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:13:19,692 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:13:19,692 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 -> cbb495583d601bf9f19d9da57531415381b22d5a [2019-01-01 17:13:19,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:13:19,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:13:19,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:13:19,792 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:13:19,792 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:13:19,793 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:19,856 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74b9310ef/6e8871382c6a40dda61e8e500bc77d55/FLAG562af3054 [2019-01-01 17:13:20,393 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:13:20,397 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:20,414 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74b9310ef/6e8871382c6a40dda61e8e500bc77d55/FLAG562af3054 [2019-01-01 17:13:20,642 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74b9310ef/6e8871382c6a40dda61e8e500bc77d55 [2019-01-01 17:13:20,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:13:20,648 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:13:20,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:13:20,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:13:20,659 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:13:20,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:13:20" (1/1) ... [2019-01-01 17:13:20,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1702cd6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:20, skipping insertion in model container [2019-01-01 17:13:20,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:13:20" (1/1) ... [2019-01-01 17:13:20,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:13:20,721 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:13:21,100 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:13:21,117 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:13:21,177 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:13:21,244 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:13:21,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:21 WrapperNode [2019-01-01 17:13:21,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:13:21,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:13:21,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:13:21,246 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:13:21,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:21" (1/1) ... [2019-01-01 17:13:21,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:21" (1/1) ... [2019-01-01 17:13:21,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:21" (1/1) ... [2019-01-01 17:13:21,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:21" (1/1) ... [2019-01-01 17:13:21,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:21" (1/1) ... [2019-01-01 17:13:21,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:21" (1/1) ... [2019-01-01 17:13:21,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:21" (1/1) ... [2019-01-01 17:13:21,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:13:21,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:13:21,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:13:21,389 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:13:21,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:21" (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:13:21,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:13:21,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:13:21,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:13:21,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:13:21,449 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcmp [2019-01-01 17:13:21,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:13:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:13:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:13:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:13:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:13:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:13:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:13:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:13:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:13:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:13:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:13:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:13:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:13:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:13:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:13:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:13:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:13:21,452 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:13:21,452 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:13:21,452 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:13:21,452 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:13:21,452 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:13:21,452 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:13:21,453 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:13:21,453 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:13:21,453 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:13:21,453 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:13:21,453 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:13:21,454 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:13:21,454 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:13:21,454 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:13:21,454 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:13:21,454 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:13:21,454 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:13:21,455 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:13:21,455 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:13:21,455 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:13:21,455 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:13:21,455 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:13:21,455 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:13:21,455 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:13:21,456 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:13:21,456 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:13:21,456 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:13:21,456 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:13:21,456 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:13:21,456 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:13:21,456 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:13:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:13:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:13:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:13:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:13:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:13:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:13:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:13:21,461 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:13:21,461 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:13:21,461 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:13:21,462 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:13:21,462 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:13:21,462 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:13:21,462 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:13:21,462 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:13:21,462 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:13:21,462 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:13:21,463 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:13:21,463 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:13:21,463 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:13:21,464 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:13:21,464 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:13:21,464 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:13:21,464 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:13:21,464 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:13:21,464 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:13:21,464 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:13:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:13:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:13:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:13:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:13:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:13:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:13:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:13:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:13:21,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:13:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:13:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:13:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:13:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:13:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:13:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:13:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:13:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:13:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:13:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:13:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:13:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:13:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:13:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:13:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:13:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:13:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:13:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:13:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:13:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:13:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcmp [2019-01-01 17:13:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:13:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:13:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:13:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:13:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:13:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:13:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:13:22,188 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:13:22,188 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-01 17:13:22,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:22 BoogieIcfgContainer [2019-01-01 17:13:22,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:13:22,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:13:22,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:13:22,194 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:13:22,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:13:20" (1/3) ... [2019-01-01 17:13:22,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35da4945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:13:22, skipping insertion in model container [2019-01-01 17:13:22,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:13:21" (2/3) ... [2019-01-01 17:13:22,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35da4945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:13:22, skipping insertion in model container [2019-01-01 17:13:22,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:22" (3/3) ... [2019-01-01 17:13:22,198 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-01 17:13:22,208 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:13:22,218 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-01 17:13:22,235 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-01 17:13:22,262 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:13:22,263 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:13:22,263 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:13:22,263 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:13:22,264 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:13:22,264 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:13:22,264 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:13:22,264 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:13:22,264 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:13:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-01-01 17:13:22,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:22,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:22,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:22,295 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:22,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:22,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1974220600, now seen corresponding path program 1 times [2019-01-01 17:13:22,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:22,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:22,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:22,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:22,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:22,527 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:13:22,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:22,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:13:22,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:13:22,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:13:22,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:22,548 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-01-01 17:13:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:22,675 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-01-01 17:13:22,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:13:22,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:13:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:22,691 INFO L225 Difference]: With dead ends: 44 [2019-01-01 17:13:22,691 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 17:13:22,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:22,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 17:13:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-01 17:13:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 17:13:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-01-01 17:13:22,738 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 10 [2019-01-01 17:13:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:22,738 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-01-01 17:13:22,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:13:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-01-01 17:13:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:13:22,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:22,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:22,740 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:22,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:22,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1974220599, now seen corresponding path program 1 times [2019-01-01 17:13:22,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:22,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:22,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:22,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:22,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:22,920 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:13:22,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:22,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:22,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:22,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:22,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:22,923 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2019-01-01 17:13:22,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:22,985 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-01 17:13:22,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:22,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-01 17:13:22,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:22,987 INFO L225 Difference]: With dead ends: 40 [2019-01-01 17:13:22,987 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 17:13:22,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:22,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 17:13:22,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-01 17:13:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 17:13:22,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-01-01 17:13:22,996 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 10 [2019-01-01 17:13:22,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:22,997 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-01-01 17:13:22,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:22,997 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-01-01 17:13:22,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:13:22,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:22,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:22,998 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:22,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:23,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1071296429, now seen corresponding path program 1 times [2019-01-01 17:13:23,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:23,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:23,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:23,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:23,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:23,089 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:13:23,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:23,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:13:23,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:13:23,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:13:23,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:23,091 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 3 states. [2019-01-01 17:13:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:23,165 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-01-01 17:13:23,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:13:23,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-01 17:13:23,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:23,167 INFO L225 Difference]: With dead ends: 39 [2019-01-01 17:13:23,167 INFO L226 Difference]: Without dead ends: 39 [2019-01-01 17:13:23,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:13:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-01 17:13:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-01 17:13:23,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 17:13:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-01 17:13:23,173 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 11 [2019-01-01 17:13:23,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:23,173 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-01 17:13:23,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:13:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-01 17:13:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 17:13:23,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:23,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:23,174 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:23,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:23,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1071296428, now seen corresponding path program 1 times [2019-01-01 17:13:23,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:23,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:23,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:23,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:23,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:23,300 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:13:23,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:23,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:23,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:23,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:23,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:23,302 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-01-01 17:13:23,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:23,376 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-01-01 17:13:23,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:23,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-01 17:13:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:23,378 INFO L225 Difference]: With dead ends: 38 [2019-01-01 17:13:23,379 INFO L226 Difference]: Without dead ends: 38 [2019-01-01 17:13:23,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-01 17:13:23,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-01 17:13:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 17:13:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-01-01 17:13:23,384 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 11 [2019-01-01 17:13:23,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:23,385 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-01-01 17:13:23,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-01-01 17:13:23,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 17:13:23,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:23,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:23,386 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:23,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:23,387 INFO L82 PathProgramCache]: Analyzing trace with hash 910096825, now seen corresponding path program 1 times [2019-01-01 17:13:23,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:23,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:23,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:23,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:23,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:23,454 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:13:23,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:23,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:13:23,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:13:23,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:13:23,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:13:23,456 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2019-01-01 17:13:23,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:23,897 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-01-01 17:13:23,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:13:23,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-01 17:13:23,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:23,899 INFO L225 Difference]: With dead ends: 36 [2019-01-01 17:13:23,899 INFO L226 Difference]: Without dead ends: 36 [2019-01-01 17:13:23,899 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:13:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-01 17:13:23,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-01 17:13:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 17:13:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-01-01 17:13:23,905 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 14 [2019-01-01 17:13:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:23,905 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-01-01 17:13:23,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:13:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-01-01 17:13:23,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 17:13:23,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:23,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:23,907 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:23,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:23,907 INFO L82 PathProgramCache]: Analyzing trace with hash 910096826, now seen corresponding path program 1 times [2019-01-01 17:13:23,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:23,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:23,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:23,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:23,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:24,086 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:13:24,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:24,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:13:24,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:13:24,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:13:24,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:13:24,089 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 7 states. [2019-01-01 17:13:24,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:24,303 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-01-01 17:13:24,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:13:24,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-01-01 17:13:24,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:24,307 INFO L225 Difference]: With dead ends: 50 [2019-01-01 17:13:24,307 INFO L226 Difference]: Without dead ends: 50 [2019-01-01 17:13:24,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:13:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-01 17:13:24,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2019-01-01 17:13:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 17:13:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-01-01 17:13:24,314 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 14 [2019-01-01 17:13:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:24,315 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-01 17:13:24,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:13:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-01-01 17:13:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:13:24,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:24,316 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:13:24,316 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:24,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:24,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1570280198, now seen corresponding path program 1 times [2019-01-01 17:13:24,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:24,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:24,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:24,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:24,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:24,404 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:13:24,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:24,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:13:24,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:13:24,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:13:24,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:13:24,406 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 6 states. [2019-01-01 17:13:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:24,591 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-01-01 17:13:24,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:13:24,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-01-01 17:13:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:24,593 INFO L225 Difference]: With dead ends: 40 [2019-01-01 17:13:24,593 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 17:13:24,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 17:13:24,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-01 17:13:24,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 17:13:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-01-01 17:13:24,598 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 16 [2019-01-01 17:13:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:24,599 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-01 17:13:24,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:13:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-01-01 17:13:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:13:24,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:24,600 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:13:24,600 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:24,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:24,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1570280197, now seen corresponding path program 1 times [2019-01-01 17:13:24,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:24,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:24,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:24,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:24,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:24,770 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:13:24,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:24,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:13:24,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:13:24,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:13:24,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:24,773 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 8 states. [2019-01-01 17:13:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:24,935 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-01-01 17:13:24,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:13:24,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-01 17:13:24,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:24,937 INFO L225 Difference]: With dead ends: 40 [2019-01-01 17:13:24,937 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 17:13:24,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:13:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 17:13:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-01 17:13:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 17:13:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-01 17:13:24,943 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 16 [2019-01-01 17:13:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:24,943 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-01 17:13:24,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:13:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-01 17:13:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:13:24,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:24,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:24,946 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:24,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1505749765, now seen corresponding path program 1 times [2019-01-01 17:13:24,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:24,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:24,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:24,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:24,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:25,031 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:13:25,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:25,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:13:25,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:13:25,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:13:25,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:13:25,033 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2019-01-01 17:13:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:25,160 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-01-01 17:13:25,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:13:25,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-01 17:13:25,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:25,162 INFO L225 Difference]: With dead ends: 39 [2019-01-01 17:13:25,163 INFO L226 Difference]: Without dead ends: 39 [2019-01-01 17:13:25,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:25,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-01 17:13:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-01 17:13:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 17:13:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-01 17:13:25,167 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-01-01 17:13:25,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:25,169 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-01 17:13:25,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:13:25,169 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-01-01 17:13:25,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 17:13:25,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:25,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:25,170 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:25,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:25,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1505749764, now seen corresponding path program 1 times [2019-01-01 17:13:25,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:25,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:25,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:25,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:25,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:25,490 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:13:25,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:25,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:13:25,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:13:25,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:13:25,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:13:25,493 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2019-01-01 17:13:25,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:25,606 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2019-01-01 17:13:25,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:13:25,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-01-01 17:13:25,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:25,610 INFO L225 Difference]: With dead ends: 48 [2019-01-01 17:13:25,610 INFO L226 Difference]: Without dead ends: 48 [2019-01-01 17:13:25,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:13:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-01 17:13:25,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2019-01-01 17:13:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 17:13:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-01 17:13:25,618 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 18 [2019-01-01 17:13:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:25,619 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-01 17:13:25,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:13:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-01 17:13:25,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:13:25,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:25,620 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:25,620 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:25,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:25,620 INFO L82 PathProgramCache]: Analyzing trace with hash 378404680, now seen corresponding path program 1 times [2019-01-01 17:13:25,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:25,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:25,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:25,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:25,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:25,799 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:13:25,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:25,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:13:25,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:13:25,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:13:25,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:13:25,801 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2019-01-01 17:13:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:26,038 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-01-01 17:13:26,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:13:26,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-01 17:13:26,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:26,041 INFO L225 Difference]: With dead ends: 39 [2019-01-01 17:13:26,041 INFO L226 Difference]: Without dead ends: 39 [2019-01-01 17:13:26,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:13:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-01 17:13:26,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-01 17:13:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 17:13:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-01 17:13:26,045 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 20 [2019-01-01 17:13:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:26,046 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-01 17:13:26,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:13:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-01-01 17:13:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:13:26,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:26,047 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:26,047 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:26,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:26,047 INFO L82 PathProgramCache]: Analyzing trace with hash 378404681, now seen corresponding path program 1 times [2019-01-01 17:13:26,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:26,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:26,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:26,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:26,321 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:13:26,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:26,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 17:13:26,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 17:13:26,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 17:13:26,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:13:26,323 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 10 states. [2019-01-01 17:13:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:26,553 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-01-01 17:13:26,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 17:13:26,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-01-01 17:13:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:26,555 INFO L225 Difference]: With dead ends: 47 [2019-01-01 17:13:26,555 INFO L226 Difference]: Without dead ends: 47 [2019-01-01 17:13:26,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:13:26,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-01 17:13:26,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-01-01 17:13:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 17:13:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-01-01 17:13:26,560 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2019-01-01 17:13:26,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:26,560 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-01-01 17:13:26,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 17:13:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-01-01 17:13:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:13:26,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:26,561 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:26,562 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:26,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:26,562 INFO L82 PathProgramCache]: Analyzing trace with hash 378454410, now seen corresponding path program 1 times [2019-01-01 17:13:26,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:26,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:26,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:26,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:26,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:26,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 17:13:26,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 17:13:26,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 17:13:26,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:13:26,822 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 12 states. [2019-01-01 17:13:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:27,124 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-01-01 17:13:27,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 17:13:27,125 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-01-01 17:13:27,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:27,126 INFO L225 Difference]: With dead ends: 61 [2019-01-01 17:13:27,127 INFO L226 Difference]: Without dead ends: 61 [2019-01-01 17:13:27,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-01-01 17:13:27,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-01 17:13:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-01-01 17:13:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-01 17:13:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2019-01-01 17:13:27,132 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 20 [2019-01-01 17:13:27,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:27,133 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2019-01-01 17:13:27,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 17:13:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2019-01-01 17:13:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:13:27,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:27,134 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:27,134 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:27,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:27,134 INFO L82 PathProgramCache]: Analyzing trace with hash -208351604, now seen corresponding path program 1 times [2019-01-01 17:13:27,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:27,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:27,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:27,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:27,524 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 12 [2019-01-01 17:13:27,592 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:27,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:27,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 17:13:27,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 17:13:27,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 17:13:27,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:13:27,593 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 9 states. [2019-01-01 17:13:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:27,866 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2019-01-01 17:13:27,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 17:13:27,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-01-01 17:13:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:27,869 INFO L225 Difference]: With dead ends: 100 [2019-01-01 17:13:27,869 INFO L226 Difference]: Without dead ends: 100 [2019-01-01 17:13:27,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-01 17:13:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-01 17:13:27,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 59. [2019-01-01 17:13:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-01 17:13:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2019-01-01 17:13:27,874 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 20 [2019-01-01 17:13:27,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:27,874 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2019-01-01 17:13:27,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 17:13:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2019-01-01 17:13:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 17:13:27,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:27,875 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:27,876 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:27,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:27,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1219468854, now seen corresponding path program 1 times [2019-01-01 17:13:27,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:27,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:27,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:27,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:28,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:28,284 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:13:28,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:28,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:28,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 17:13:28,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:28,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:28,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-01 17:13:28,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-01 17:13:28,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 17:13:28,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:28,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:28,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:28,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-01 17:13:28,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-01 17:13:28,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 17:13:28,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:28,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:28,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:28,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-01 17:13:29,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-01-01 17:13:29,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2019-01-01 17:13:29,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:29,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 17:13:29,086 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:29,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:29,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:29,113 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2019-01-01 17:13:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:29,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:29,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-01-01 17:13:29,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 17:13:29,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 17:13:29,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:13:29,251 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 17 states. [2019-01-01 17:13:29,457 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2019-01-01 17:13:30,169 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-01-01 17:13:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:30,511 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2019-01-01 17:13:30,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 17:13:30,512 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-01-01 17:13:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:30,513 INFO L225 Difference]: With dead ends: 77 [2019-01-01 17:13:30,514 INFO L226 Difference]: Without dead ends: 77 [2019-01-01 17:13:30,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2019-01-01 17:13:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-01 17:13:30,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2019-01-01 17:13:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-01 17:13:30,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2019-01-01 17:13:30,519 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 20 [2019-01-01 17:13:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:30,519 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2019-01-01 17:13:30,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 17:13:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2019-01-01 17:13:30,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 17:13:30,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:30,521 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:30,521 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:30,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:30,521 INFO L82 PathProgramCache]: Analyzing trace with hash 616501515, now seen corresponding path program 1 times [2019-01-01 17:13:30,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:30,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:30,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:30,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:30,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:30,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:30,914 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:30,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:30,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:30,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-01 17:13:30,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 17:13:30,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:30,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:30,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:30,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-01 17:13:31,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2019-01-01 17:13:31,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2019-01-01 17:13:31,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:31,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2019-01-01 17:13:31,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:31,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-01-01 17:13:31,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:31,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 17:13:31,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:31,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2019-01-01 17:13:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:31,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:31,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-01-01 17:13:31,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 17:13:31,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 17:13:31,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-01-01 17:13:31,787 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 22 states. [2019-01-01 17:13:35,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:35,698 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-01-01 17:13:35,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 17:13:35,700 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-01 17:13:35,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:35,702 INFO L225 Difference]: With dead ends: 65 [2019-01-01 17:13:35,702 INFO L226 Difference]: Without dead ends: 65 [2019-01-01 17:13:35,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=127, Invalid=863, Unknown=2, NotChecked=0, Total=992 [2019-01-01 17:13:35,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-01 17:13:35,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-01 17:13:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-01 17:13:35,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-01-01 17:13:35,707 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 22 [2019-01-01 17:13:35,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:35,708 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-01-01 17:13:35,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 17:13:35,708 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-01-01 17:13:35,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-01 17:13:35,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:35,711 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] [2019-01-01 17:13:35,711 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:35,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:35,713 INFO L82 PathProgramCache]: Analyzing trace with hash 246156161, now seen corresponding path program 1 times [2019-01-01 17:13:35,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:35,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:35,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:35,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:35,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:36,039 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2019-01-01 17:13:36,040 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:13:36,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:13:36,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:13:36,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:13:36,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:13:36,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:36,043 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 4 states. [2019-01-01 17:13:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:36,496 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-01-01 17:13:36,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:13:36,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-01-01 17:13:36,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:36,497 INFO L225 Difference]: With dead ends: 64 [2019-01-01 17:13:36,497 INFO L226 Difference]: Without dead ends: 38 [2019-01-01 17:13:36,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:13:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-01 17:13:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-01 17:13:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 17:13:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-01 17:13:36,501 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 23 [2019-01-01 17:13:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:36,502 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-01 17:13:36,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:13:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-01 17:13:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:13:36,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:36,505 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:36,505 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:36,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:36,506 INFO L82 PathProgramCache]: Analyzing trace with hash -247532276, now seen corresponding path program 1 times [2019-01-01 17:13:36,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:36,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:36,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:36,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:36,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:36,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:36,681 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:36,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:36,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:36,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:36,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2019-01-01 17:13:36,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 17:13:36,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 17:13:36,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:13:36,765 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 10 states. [2019-01-01 17:13:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:36,923 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-01 17:13:36,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 17:13:36,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-01-01 17:13:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:36,925 INFO L225 Difference]: With dead ends: 36 [2019-01-01 17:13:36,925 INFO L226 Difference]: Without dead ends: 36 [2019-01-01 17:13:36,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-01-01 17:13:36,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-01 17:13:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-01-01 17:13:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 17:13:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-01 17:13:36,929 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2019-01-01 17:13:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:36,929 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-01 17:13:36,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 17:13:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-01 17:13:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 17:13:36,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:36,933 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 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:36,933 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:36,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:36,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1655366823, now seen corresponding path program 1 times [2019-01-01 17:13:36,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:36,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:36,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:36,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:36,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:37,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:37,632 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:37,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:37,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:37,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:37,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 17:13:37,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2019-01-01 17:13:37,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 17:13:37,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 17:13:37,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-01-01 17:13:37,844 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 13 states. [2019-01-01 17:13:38,320 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 17:13:38,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:38,532 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-01 17:13:38,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 17:13:38,533 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-01-01 17:13:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:38,534 INFO L225 Difference]: With dead ends: 33 [2019-01-01 17:13:38,534 INFO L226 Difference]: Without dead ends: 30 [2019-01-01 17:13:38,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-01-01 17:13:38,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-01 17:13:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-01 17:13:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 17:13:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-01 17:13:38,538 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2019-01-01 17:13:38,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:38,538 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-01 17:13:38,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 17:13:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-01 17:13:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 17:13:38,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:38,539 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:38,539 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:38,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1655317094, now seen corresponding path program 2 times [2019-01-01 17:13:38,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:38,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:38,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:38,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:13:38,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:39,211 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2019-01-01 17:13:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:39,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:39,348 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:39,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:13:39,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:13:39,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:13:39,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:39,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 17:13:39,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 17:13:39,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:39,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:39,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 17:13:39,448 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:39,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:39,460 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-01 17:13:39,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 17:13:39,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-01 17:13:39,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:39,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:39,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:39,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-01 17:13:39,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-01 17:13:39,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-01 17:13:39,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:39,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:39,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:39,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2019-01-01 17:13:41,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2019-01-01 17:13:41,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2019-01-01 17:13:41,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:41,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2019-01-01 17:13:41,343 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:41,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:41,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:41,365 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2019-01-01 17:13:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:41,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:41,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2019-01-01 17:13:41,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-01 17:13:41,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-01 17:13:41,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=446, Unknown=1, NotChecked=0, Total=506 [2019-01-01 17:13:41,489 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-01-01 17:13:43,604 WARN L181 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-01-01 17:13:44,710 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-01-01 17:13:48,247 WARN L181 SmtUtils]: Spent 3.48 s on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-01-01 17:13:50,408 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-01-01 17:13:50,684 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-01-01 17:13:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:50,895 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-01 17:13:50,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 17:13:50,896 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-01-01 17:13:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:50,897 INFO L225 Difference]: With dead ends: 30 [2019-01-01 17:13:50,897 INFO L226 Difference]: Without dead ends: 30 [2019-01-01 17:13:50,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=157, Invalid=964, Unknown=1, NotChecked=0, Total=1122 [2019-01-01 17:13:50,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-01 17:13:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-01 17:13:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 17:13:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-01 17:13:50,900 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-01-01 17:13:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:50,900 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-01 17:13:50,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-01 17:13:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-01 17:13:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 17:13:50,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:13:50,902 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:13:50,902 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2019-01-01 17:13:50,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:13:50,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1621829413, now seen corresponding path program 2 times [2019-01-01 17:13:50,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:13:50,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:13:50,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:50,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 17:13:50,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:13:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:13:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:51,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:13:51,517 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 17:13:51,527 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 17:13:51,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 17:13:51,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 17:13:51,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:13:51,580 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 9 treesize of output 12 [2019-01-01 17:13:51,643 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 12 treesize of output 15 [2019-01-01 17:13:51,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:51,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:51,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:51,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:22 [2019-01-01 17:13:51,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 17:13:51,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-01 17:13:51,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:51,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:13:51,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:13:51,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-01-01 17:13:52,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2019-01-01 17:13:52,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2019-01-01 17:13:52,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:13:52,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2019-01-01 17:13:52,314 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:52,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2019-01-01 17:13:52,357 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-01 17:13:52,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 17:13:52,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:13:52,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2019-01-01 17:13:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:13:52,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:13:52,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-01-01 17:13:52,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-01 17:13:52,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-01 17:13:52,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2019-01-01 17:13:52,479 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2019-01-01 17:13:53,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:13:53,776 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-01 17:13:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 17:13:53,778 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2019-01-01 17:13:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:13:53,778 INFO L225 Difference]: With dead ends: 29 [2019-01-01 17:13:53,778 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 17:13:53,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=219, Invalid=1341, Unknown=0, NotChecked=0, Total=1560 [2019-01-01 17:13:53,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 17:13:53,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 17:13:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 17:13:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 17:13:53,780 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-01-01 17:13:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:13:53,780 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 17:13:53,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-01 17:13:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 17:13:53,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 17:13:53,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:13:53 BoogieIcfgContainer [2019-01-01 17:13:53,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:13:53,786 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:13:53,786 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:13:53,787 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:13:53,787 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:13:22" (3/4) ... [2019-01-01 17:13:53,791 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 17:13:53,797 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 17:13:53,797 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcmp [2019-01-01 17:13:53,797 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 17:13:53,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 17:13:53,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 17:13:53,803 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-01-01 17:13:53,803 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-01 17:13:53,803 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 17:13:53,854 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:13:53,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:13:53,856 INFO L168 Benchmark]: Toolchain (without parser) took 33208.72 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 301.5 MB). Free memory was 948.7 MB in the beginning and 984.9 MB in the end (delta: -36.2 MB). Peak memory consumption was 265.3 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:53,858 INFO L168 Benchmark]: CDTParser took 0.15 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:53,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 594.11 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 925.9 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:53,858 INFO L168 Benchmark]: Boogie Preprocessor took 143.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:53,859 INFO L168 Benchmark]: RCFGBuilder took 800.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:53,859 INFO L168 Benchmark]: TraceAbstraction took 31594.74 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 984.9 MB in the end (delta: 75.3 MB). Peak memory consumption was 259.8 MB. Max. memory is 11.5 GB. [2019-01-01 17:13:53,862 INFO L168 Benchmark]: Witness Printer took 68.59 ms. Allocated memory is still 1.3 GB. Free memory is still 984.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:13:53,866 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.15 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 594.11 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 925.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 143.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 800.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31594.74 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 984.9 MB in the end (delta: 75.3 MB). Peak memory consumption was 259.8 MB. Max. memory is 11.5 GB. * Witness Printer took 68.59 ms. Allocated memory is still 1.3 GB. Free memory is still 984.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 51 locations, 15 error locations. SAFE Result, 31.5s OverallTime, 21 OverallIterations, 3 TraceHistogramMax, 19.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 519 SDtfs, 813 SDslu, 1960 SDs, 0 SdLazy, 2214 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 377 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 22.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=15, 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, 21 MinimizatonAttempts, 82 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 533 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 506 ConstructedInterpolants, 42 QuantifiedInterpolants, 98348 SizeOfPredicates, 58 NumberOfNonLiveVariables, 917 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 20/68 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...