./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety-realloc/array-realloc_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety-realloc/array-realloc_true-valid-memsafety.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 5ce6ab98ff3a344cbd8c93195b0f965c65d244bc ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 18:09:30,589 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:09:30,591 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:09:30,609 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:09:30,610 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:09:30,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:09:30,613 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:09:30,616 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:09:30,619 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:09:30,627 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:09:30,628 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:09:30,628 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:09:30,631 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:09:30,634 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:09:30,637 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:09:30,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:09:30,639 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:09:30,640 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:09:30,642 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:09:30,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:09:30,644 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:09:30,645 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:09:30,647 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:09:30,647 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:09:30,647 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:09:30,648 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:09:30,649 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:09:30,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:09:30,650 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:09:30,651 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:09:30,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:09:30,652 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:09:30,652 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:09:30,653 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:09:30,653 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:09:30,654 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:09:30,654 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 18:09:30,675 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:09:30,676 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:09:30,678 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:09:30,679 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:09:30,680 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:09:30,680 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:09:30,680 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:09:30,680 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:09:30,680 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:09:30,680 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:09:30,681 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:09:30,682 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:09:30,682 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:09:30,682 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:09:30,682 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:09:30,682 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:09:30,683 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:09:30,683 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:09:30,683 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:09:30,683 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:09:30,683 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:09:30,683 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:09:30,686 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:09:30,686 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:09:30,686 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:09:30,687 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 -> 5ce6ab98ff3a344cbd8c93195b0f965c65d244bc [2019-01-14 18:09:30,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:09:30,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:09:30,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:09:30,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:09:30,751 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:09:30,752 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety-realloc/array-realloc_true-valid-memsafety.i [2019-01-14 18:09:30,811 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a0dfea05/409c539500404d75ac90226fe8bcf919/FLAGc63d615fe [2019-01-14 18:09:31,269 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:09:31,270 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety-realloc/array-realloc_true-valid-memsafety.i [2019-01-14 18:09:31,286 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a0dfea05/409c539500404d75ac90226fe8bcf919/FLAGc63d615fe [2019-01-14 18:09:31,602 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a0dfea05/409c539500404d75ac90226fe8bcf919 [2019-01-14 18:09:31,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:09:31,607 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:09:31,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:09:31,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:09:31,613 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:09:31,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:09:31" (1/1) ... [2019-01-14 18:09:31,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54188bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:09:31, skipping insertion in model container [2019-01-14 18:09:31,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:09:31" (1/1) ... [2019-01-14 18:09:31,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:09:31,683 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:09:32,027 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:09:32,048 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:09:32,186 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:09:32,254 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:09:32,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:09:32 WrapperNode [2019-01-14 18:09:32,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:09:32,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:09:32,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:09:32,257 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:09:32,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:09:32" (1/1) ... [2019-01-14 18:09:32,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:09:32" (1/1) ... [2019-01-14 18:09:32,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:09:32" (1/1) ... [2019-01-14 18:09:32,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:09:32" (1/1) ... [2019-01-14 18:09:32,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:09:32" (1/1) ... [2019-01-14 18:09:32,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:09:32" (1/1) ... [2019-01-14 18:09:32,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:09:32" (1/1) ... [2019-01-14 18:09:32,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:09:32,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:09:32,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:09:32,337 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:09:32,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:09:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:09:32,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:09:32,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:09:32,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 18:09:32,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 18:09:32,389 INFO L138 BoogieDeclarations]: Found implementation of procedure expandArray [2019-01-14 18:09:32,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:09:32,390 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc [2019-01-14 18:09:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 18:09:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 18:09:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:09:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:09:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:09:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:09:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:09:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:09:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:09:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:09:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:09:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:09:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:09:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:09:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:09:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:09:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:09:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:09:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:09:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:09:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:09:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:09:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:09:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:09:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:09:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:09:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:09:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:09:32,394 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:09:32,395 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:09:32,395 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:09:32,395 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:09:32,395 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:09:32,395 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:09:32,396 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:09:32,396 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:09:32,397 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:09:32,397 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:09:32,397 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:09:32,397 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:09:32,398 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:09:32,398 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:09:32,398 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:09:32,398 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:09:32,398 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:09:32,398 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:09:32,398 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:09:32,399 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:09:32,399 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:09:32,399 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:09:32,399 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:09:32,399 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:09:32,399 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:09:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:09:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:09:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:09:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:09:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:09:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:09:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:09:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-14 18:09:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:09:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:09:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-14 18:09:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:09:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:09:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-14 18:09:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:09:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:09:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:09:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:09:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:09:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:09:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:09:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:09:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:09:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:09:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:09:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:09:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:09:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:09:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:09:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:09:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:09:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:09:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:09:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:09:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:09:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:09:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:09:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:09:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:09:32,411 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:09:32,411 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:09:32,411 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:09:32,412 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:09:32,412 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:09:32,412 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:09:32,412 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:09:32,412 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:09:32,412 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:09:32,412 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:09:32,412 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:09:32,413 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:09:32,414 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:09:32,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 18:09:32,414 INFO L130 BoogieDeclarations]: Found specification of procedure expandArray [2019-01-14 18:09:32,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc [2019-01-14 18:09:32,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 18:09:32,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 18:09:32,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 18:09:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:09:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 18:09:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:09:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 18:09:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:09:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:09:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:09:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 18:09:33,059 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:09:33,059 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-14 18:09:33,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:09:33 BoogieIcfgContainer [2019-01-14 18:09:33,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:09:33,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:09:33,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:09:33,066 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:09:33,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:09:31" (1/3) ... [2019-01-14 18:09:33,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1321f36d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:09:33, skipping insertion in model container [2019-01-14 18:09:33,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:09:32" (2/3) ... [2019-01-14 18:09:33,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1321f36d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:09:33, skipping insertion in model container [2019-01-14 18:09:33,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:09:33" (3/3) ... [2019-01-14 18:09:33,070 INFO L112 eAbstractionObserver]: Analyzing ICFG array-realloc_true-valid-memsafety.i [2019-01-14 18:09:33,080 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:09:33,089 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-01-14 18:09:33,106 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-01-14 18:09:33,133 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:09:33,133 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:09:33,133 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:09:33,134 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:09:33,135 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:09:33,135 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:09:33,135 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:09:33,136 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:09:33,136 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:09:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-01-14 18:09:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 18:09:33,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:33,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:33,162 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:09:33,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:33,168 INFO L82 PathProgramCache]: Analyzing trace with hash 529620371, now seen corresponding path program 1 times [2019-01-14 18:09:33,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:33,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:33,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:33,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:33,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:33,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:33,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:09:33,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:09:33,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:09:33,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:09:33,373 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-01-14 18:09:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:33,752 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-01-14 18:09:33,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:09:33,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 18:09:33,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:33,765 INFO L225 Difference]: With dead ends: 56 [2019-01-14 18:09:33,766 INFO L226 Difference]: Without dead ends: 52 [2019-01-14 18:09:33,768 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-14 18:09:33,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-14 18:09:33,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2019-01-14 18:09:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 18:09:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-01-14 18:09:33,810 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 8 [2019-01-14 18:09:33,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:33,811 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-01-14 18:09:33,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:09:33,811 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-01-14 18:09:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 18:09:33,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:33,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:33,812 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:09:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:33,813 INFO L82 PathProgramCache]: Analyzing trace with hash 529620385, now seen corresponding path program 1 times [2019-01-14 18:09:33,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:33,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:33,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:33,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:33,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:33,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:33,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:09:33,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:09:33,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:09:33,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:09:33,982 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 3 states. [2019-01-14 18:09:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:34,166 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-14 18:09:34,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:09:34,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 18:09:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:34,168 INFO L225 Difference]: With dead ends: 43 [2019-01-14 18:09:34,168 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 18:09:34,169 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-14 18:09:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 18:09:34,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-14 18:09:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 18:09:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-01-14 18:09:34,175 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 8 [2019-01-14 18:09:34,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:34,176 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-01-14 18:09:34,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:09:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-01-14 18:09:34,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 18:09:34,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:34,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:34,177 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:09:34,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:34,178 INFO L82 PathProgramCache]: Analyzing trace with hash 529620384, now seen corresponding path program 1 times [2019-01-14 18:09:34,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:34,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:34,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:34,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:34,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:34,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:34,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:09:34,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:09:34,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:09:34,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:09:34,249 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 3 states. [2019-01-14 18:09:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:34,373 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-01-14 18:09:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:09:34,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 18:09:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:34,375 INFO L225 Difference]: With dead ends: 42 [2019-01-14 18:09:34,375 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 18:09:34,376 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-14 18:09:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 18:09:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-14 18:09:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 18:09:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-01-14 18:09:34,382 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 8 [2019-01-14 18:09:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:34,383 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-01-14 18:09:34,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:09:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-01-14 18:09:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:09:34,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:34,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:34,384 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:09:34,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2135919539, now seen corresponding path program 1 times [2019-01-14 18:09:34,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:34,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:34,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:34,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:34,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:34,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:34,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:09:34,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:09:34,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:09:34,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:09:34,467 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 4 states. [2019-01-14 18:09:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:34,687 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-14 18:09:34,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:09:34,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 18:09:34,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:34,695 INFO L225 Difference]: With dead ends: 42 [2019-01-14 18:09:34,695 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 18:09:34,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:09:34,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 18:09:34,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-14 18:09:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 18:09:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-01-14 18:09:34,705 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 10 [2019-01-14 18:09:34,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:34,705 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-01-14 18:09:34,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:09:34,706 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-01-14 18:09:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 18:09:34,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:34,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:34,710 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:09:34,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:34,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1236436269, now seen corresponding path program 1 times [2019-01-14 18:09:34,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:34,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:34,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:34,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:34,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:34,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:34,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:09:34,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:09:34,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:09:34,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:09:34,929 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 5 states. [2019-01-14 18:09:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:35,107 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-01-14 18:09:35,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:09:35,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-14 18:09:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:35,109 INFO L225 Difference]: With dead ends: 53 [2019-01-14 18:09:35,109 INFO L226 Difference]: Without dead ends: 53 [2019-01-14 18:09:35,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:09:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-14 18:09:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-01-14 18:09:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-14 18:09:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-01-14 18:09:35,117 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 13 [2019-01-14 18:09:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:35,117 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-01-14 18:09:35,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:09:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-01-14 18:09:35,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 18:09:35,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:35,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:35,119 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:09:35,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:35,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1236436268, now seen corresponding path program 1 times [2019-01-14 18:09:35,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:35,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:35,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:35,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:35,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:35,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:35,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:35,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:09:35,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:09:35,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:09:35,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:09:35,250 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2019-01-14 18:09:35,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:35,400 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-01-14 18:09:35,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:09:35,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-14 18:09:35,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:35,402 INFO L225 Difference]: With dead ends: 49 [2019-01-14 18:09:35,402 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 18:09:35,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:09:35,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 18:09:35,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-01-14 18:09:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 18:09:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-01-14 18:09:35,409 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 13 [2019-01-14 18:09:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:35,409 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-01-14 18:09:35,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:09:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-01-14 18:09:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:09:35,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:35,411 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-14 18:09:35,411 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:09:35,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:35,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2119265845, now seen corresponding path program 1 times [2019-01-14 18:09:35,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:35,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:35,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:35,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:35,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:35,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:35,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:09:35,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:09:35,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:09:35,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:09:35,569 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 6 states. [2019-01-14 18:09:35,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:35,676 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-01-14 18:09:35,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:09:35,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-14 18:09:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:35,678 INFO L225 Difference]: With dead ends: 43 [2019-01-14 18:09:35,678 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 18:09:35,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:09:35,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 18:09:35,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-14 18:09:35,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 18:09:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-01-14 18:09:35,684 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 18 [2019-01-14 18:09:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:35,684 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-01-14 18:09:35,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:09:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-01-14 18:09:35,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 18:09:35,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:35,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:35,685 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:09:35,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:35,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2000066657, now seen corresponding path program 1 times [2019-01-14 18:09:35,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:35,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:35,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:35,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:35,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:35,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:35,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 18:09:35,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:09:35,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:09:35,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:09:35,788 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 5 states. [2019-01-14 18:09:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:35,897 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-14 18:09:35,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:09:35,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-14 18:09:35,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:35,899 INFO L225 Difference]: With dead ends: 43 [2019-01-14 18:09:35,899 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 18:09:35,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:09:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 18:09:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-01-14 18:09:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 18:09:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-01-14 18:09:35,904 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 20 [2019-01-14 18:09:35,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:35,905 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-01-14 18:09:35,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:09:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-01-14 18:09:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 18:09:35,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:35,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:35,906 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:09:35,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:35,907 INFO L82 PathProgramCache]: Analyzing trace with hash 2000066658, now seen corresponding path program 1 times [2019-01-14 18:09:35,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:35,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:35,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:35,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:35,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:36,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:36,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 18:09:36,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 18:09:36,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 18:09:36,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:09:36,070 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 9 states. [2019-01-14 18:09:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:36,269 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-14 18:09:36,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 18:09:36,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-01-14 18:09:36,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:36,271 INFO L225 Difference]: With dead ends: 46 [2019-01-14 18:09:36,271 INFO L226 Difference]: Without dead ends: 46 [2019-01-14 18:09:36,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-14 18:09:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-14 18:09:36,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-01-14 18:09:36,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 18:09:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-01-14 18:09:36,277 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2019-01-14 18:09:36,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:36,277 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-01-14 18:09:36,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 18:09:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-01-14 18:09:36,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 18:09:36,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:36,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:36,279 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:09:36,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:36,280 INFO L82 PathProgramCache]: Analyzing trace with hash 2028695809, now seen corresponding path program 1 times [2019-01-14 18:09:36,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:36,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:36,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:36,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:36,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:36,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:36,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:09:36,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:09:36,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:09:36,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:09:36,609 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 7 states. [2019-01-14 18:09:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:36,733 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-01-14 18:09:36,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:09:36,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-01-14 18:09:36,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:36,736 INFO L225 Difference]: With dead ends: 44 [2019-01-14 18:09:36,736 INFO L226 Difference]: Without dead ends: 44 [2019-01-14 18:09:36,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:09:36,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-14 18:09:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-14 18:09:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 18:09:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-01-14 18:09:36,742 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 20 [2019-01-14 18:09:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:36,744 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-01-14 18:09:36,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:09:36,744 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-01-14 18:09:36,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 18:09:36,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:36,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:36,745 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:09:36,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:36,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939367, now seen corresponding path program 1 times [2019-01-14 18:09:36,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:36,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:36,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:36,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:36,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:36,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:36,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 18:09:36,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 18:09:36,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 18:09:36,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:09:36,971 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 9 states. [2019-01-14 18:09:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:37,335 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-01-14 18:09:37,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:09:37,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-01-14 18:09:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:37,338 INFO L225 Difference]: With dead ends: 51 [2019-01-14 18:09:37,338 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 18:09:37,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-14 18:09:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 18:09:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-01-14 18:09:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 18:09:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-01-14 18:09:37,345 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 21 [2019-01-14 18:09:37,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:37,346 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-01-14 18:09:37,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 18:09:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-01-14 18:09:37,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 18:09:37,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:37,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:37,349 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:09:37,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:37,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939366, now seen corresponding path program 1 times [2019-01-14 18:09:37,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:37,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:37,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:37,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:37,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:37,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:37,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:09:37,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:09:37,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:09:37,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:09:37,622 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2019-01-14 18:09:37,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:37,874 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-14 18:09:37,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:09:37,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-01-14 18:09:37,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:37,876 INFO L225 Difference]: With dead ends: 45 [2019-01-14 18:09:37,877 INFO L226 Difference]: Without dead ends: 45 [2019-01-14 18:09:37,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:09:37,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-14 18:09:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-14 18:09:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 18:09:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-01-14 18:09:37,887 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 21 [2019-01-14 18:09:37,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:37,887 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-01-14 18:09:37,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:09:37,887 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-01-14 18:09:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 18:09:37,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:37,888 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-14 18:09:37,889 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:09:37,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:37,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1895188378, now seen corresponding path program 1 times [2019-01-14 18:09:37,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:37,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:37,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:37,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:37,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:09:38,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:09:38,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:09:38,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:09:38,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:09:38,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:09:38,119 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-01-14 18:09:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:38,159 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-01-14 18:09:38,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:09:38,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-14 18:09:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:38,161 INFO L225 Difference]: With dead ends: 45 [2019-01-14 18:09:38,161 INFO L226 Difference]: Without dead ends: 45 [2019-01-14 18:09:38,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:09:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-14 18:09:38,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-14 18:09:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 18:09:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-01-14 18:09:38,169 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 23 [2019-01-14 18:09:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:38,169 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-01-14 18:09:38,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:09:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-01-14 18:09:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 18:09:38,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:38,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:38,172 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:09:38,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:38,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1554357335, now seen corresponding path program 1 times [2019-01-14 18:09:38,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:38,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:38,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:38,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:38,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:38,370 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-14 18:09:38,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:09:38,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:09:38,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:38,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:09:38,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:09:38,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:38,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:38,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-01-14 18:09:39,037 WARN L860 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_realloc_ptr.base| Int) (|#Ultimate.C_realloc_#res.base| Int)) (and (< |c_#StackHeapBarrier| |#Ultimate.C_realloc_#res.base|) (= |c_#valid| (store (store |c_old(#valid)| |#Ultimate.C_realloc_ptr.base| 0) |#Ultimate.C_realloc_#res.base| 1)))) is different from true [2019-01-14 18:09:40,432 WARN L181 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 18:09:41,416 WARN L181 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 18:09:41,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:09:41,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:09:41,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-14 18:09:41,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:09:41,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2019-01-14 18:09:41,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:09:41,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:09:41,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-14 18:09:41,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:38 [2019-01-14 18:09:41,667 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-14 18:09:41,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:09:41,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9] total 12 [2019-01-14 18:09:41,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 18:09:41,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 18:09:41,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=4, NotChecked=20, Total=156 [2019-01-14 18:09:41,693 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 13 states. [2019-01-14 18:09:47,788 WARN L181 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 18:09:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:09:58,979 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-01-14 18:09:58,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 18:09:58,981 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-01-14 18:09:58,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:09:58,982 INFO L225 Difference]: With dead ends: 58 [2019-01-14 18:09:58,982 INFO L226 Difference]: Without dead ends: 58 [2019-01-14 18:09:58,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=59, Invalid=206, Unknown=11, NotChecked=30, Total=306 [2019-01-14 18:09:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-14 18:09:58,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2019-01-14 18:09:58,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 18:09:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-01-14 18:09:58,988 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 27 [2019-01-14 18:09:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:09:58,988 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-01-14 18:09:58,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 18:09:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-01-14 18:09:58,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 18:09:58,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:09:58,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:09:58,990 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:09:58,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:09:58,990 INFO L82 PathProgramCache]: Analyzing trace with hash 940437124, now seen corresponding path program 1 times [2019-01-14 18:09:58,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:09:58,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:09:58,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:58,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:58,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:09:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:59,580 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-14 18:09:59,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:09:59,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:09:59,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:09:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:09:59,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:09:59,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:09:59,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 18:09:59,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:59,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:59,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:59,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-14 18:09:59,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 18:09:59,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 18:09:59,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:09:59,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:59,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:09:59,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 18:09:59,733 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-14 18:09:59,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:09:59,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2019-01-14 18:09:59,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 18:09:59,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 18:09:59,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:09:59,763 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 11 states. [2019-01-14 18:10:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:10:00,117 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-01-14 18:10:00,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 18:10:00,118 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-01-14 18:10:00,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:10:00,119 INFO L225 Difference]: With dead ends: 43 [2019-01-14 18:10:00,119 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 18:10:00,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-01-14 18:10:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 18:10:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-14 18:10:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 18:10:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-01-14 18:10:00,123 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 28 [2019-01-14 18:10:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:10:00,123 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-01-14 18:10:00,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 18:10:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-01-14 18:10:00,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 18:10:00,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:10:00,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:10:00,127 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:10:00,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:10:00,127 INFO L82 PathProgramCache]: Analyzing trace with hash -911220169, now seen corresponding path program 1 times [2019-01-14 18:10:00,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:10:00,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:10:00,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:00,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:10:00,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:10:00,917 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-14 18:10:00,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:10:00,917 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:10:00,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:10:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:10:00,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:10:01,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:10:01,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 18:10:01,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:01,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:01,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:01,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-01-14 18:10:01,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-14 18:10:01,089 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-14 18:10:01,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:01,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:01,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:01,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-01-14 18:10:01,096 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-14 18:10:01,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:10:01,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2019-01-14 18:10:01,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 18:10:01,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 18:10:01,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:10:01,116 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 11 states. [2019-01-14 18:10:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:10:01,355 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-14 18:10:01,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 18:10:01,356 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-01-14 18:10:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:10:01,358 INFO L225 Difference]: With dead ends: 42 [2019-01-14 18:10:01,358 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 18:10:01,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-01-14 18:10:01,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 18:10:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-14 18:10:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 18:10:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-01-14 18:10:01,363 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 29 [2019-01-14 18:10:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:10:01,363 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-01-14 18:10:01,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 18:10:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-01-14 18:10:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 18:10:01,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:10:01,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:10:01,368 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:10:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:10:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1816945894, now seen corresponding path program 1 times [2019-01-14 18:10:01,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:10:01,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:10:01,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:01,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:10:01,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:10:01,522 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-14 18:10:01,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:10:01,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:10:01,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:10:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:10:01,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:10:01,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:10:01,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 18:10:01,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:01,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:01,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:01,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-01-14 18:10:01,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-14 18:10:01,736 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 13 treesize of output 5 [2019-01-14 18:10:01,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:01,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:01,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:01,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-01-14 18:10:01,741 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-14 18:10:01,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:10:01,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-01-14 18:10:01,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 18:10:01,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 18:10:01,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:10:01,762 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 11 states. [2019-01-14 18:10:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:10:02,105 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-01-14 18:10:02,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:10:02,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-01-14 18:10:02,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:10:02,107 INFO L225 Difference]: With dead ends: 41 [2019-01-14 18:10:02,107 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 18:10:02,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-01-14 18:10:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 18:10:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-14 18:10:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 18:10:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-01-14 18:10:02,111 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 30 [2019-01-14 18:10:02,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:10:02,111 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-01-14 18:10:02,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 18:10:02,111 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-01-14 18:10:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 18:10:02,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:10:02,114 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:10:02,114 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:10:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:10:02,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1392750719, now seen corresponding path program 1 times [2019-01-14 18:10:02,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:10:02,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:10:02,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:02,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:10:02,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:10:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 18:10:02,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:10:02,392 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-14 18:10:02,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:10:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:10:02,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:10:02,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:10:02,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 18:10:02,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:02,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:02,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:02,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-01-14 18:10:02,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-01-14 18:10:02,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2019-01-14 18:10:02,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:02,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:02,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:02,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-01-14 18:10:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 18:10:02,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:10:02,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 18:10:02,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 18:10:02,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 18:10:02,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:10:02,577 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 9 states. [2019-01-14 18:10:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:10:02,679 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-01-14 18:10:02,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:10:02,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-01-14 18:10:02,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:10:02,681 INFO L225 Difference]: With dead ends: 41 [2019-01-14 18:10:02,681 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 18:10:02,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-01-14 18:10:02,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 18:10:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-14 18:10:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 18:10:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-14 18:10:02,685 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 31 [2019-01-14 18:10:02,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:10:02,685 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-14 18:10:02,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 18:10:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-14 18:10:02,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 18:10:02,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:10:02,688 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:10:02,689 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:10:02,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:10:02,690 INFO L82 PathProgramCache]: Analyzing trace with hash -2014712896, now seen corresponding path program 1 times [2019-01-14 18:10:02,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:10:02,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:10:02,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:02,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:10:02,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:10:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:10:02,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:10:02,947 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-14 18:10:02,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:10:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:10:03,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:10:03,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:10:03,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 18:10:03,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:03,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:03,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:03,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-01-14 18:10:03,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-14 18:10:03,139 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 13 treesize of output 5 [2019-01-14 18:10:03,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:03,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:03,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:03,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2019-01-14 18:10:03,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 18:10:03,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:03,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:03,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-14 18:10:03,701 WARN L860 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_realloc_#res.base| Int)) (and (< |c_#StackHeapBarrier| |#Ultimate.C_realloc_#res.base|) (= |c_#valid| (store (store |c_old(#valid)| |c_#Ultimate.C_realloc_ptr.base| 0) |#Ultimate.C_realloc_#res.base| 1)))) is different from true [2019-01-14 18:10:03,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:10:03,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:10:03,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-14 18:10:03,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:10:03,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2019-01-14 18:10:03,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:10:03,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:10:03,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-14 18:10:03,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:43 [2019-01-14 18:10:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-01-14 18:10:03,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:10:03,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2019-01-14 18:10:03,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-14 18:10:03,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-14 18:10:03,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=261, Unknown=1, NotChecked=32, Total=342 [2019-01-14 18:10:03,874 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 19 states. [2019-01-14 18:10:04,476 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-14 18:10:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:10:04,975 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-01-14 18:10:04,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 18:10:04,976 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-01-14 18:10:04,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:10:04,977 INFO L225 Difference]: With dead ends: 44 [2019-01-14 18:10:04,977 INFO L226 Difference]: Without dead ends: 44 [2019-01-14 18:10:04,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=714, Unknown=1, NotChecked=56, Total=930 [2019-01-14 18:10:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-14 18:10:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2019-01-14 18:10:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 18:10:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-14 18:10:04,981 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 31 [2019-01-14 18:10:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:10:04,982 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-14 18:10:04,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-14 18:10:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-14 18:10:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 18:10:04,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:10:04,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:10:04,983 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:10:04,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:10:04,983 INFO L82 PathProgramCache]: Analyzing trace with hash 490747930, now seen corresponding path program 1 times [2019-01-14 18:10:04,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:10:04,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:10:04,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:04,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:10:04,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:10:05,575 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-14 18:10:05,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:10:05,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:10:05,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:10:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:10:05,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:10:05,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 18:10:05,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2019-01-14 18:10:05,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:05,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-14 18:10:05,724 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-14 18:10:05,725 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:05,731 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:05,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:05,736 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-01-14 18:10:05,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:10:05,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 18:10:05,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:05,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:05,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:05,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:41 [2019-01-14 18:10:05,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2019-01-14 18:10:05,969 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2019-01-14 18:10:05,970 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:10:06,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:10:06,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:10:06,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:62 [2019-01-14 18:10:06,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2019-01-14 18:10:06,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2019-01-14 18:10:06,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:06,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:06,128 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-14 18:10:06,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:47 [2019-01-14 18:10:10,713 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-14 18:10:10,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:10:10,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2019-01-14 18:10:10,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 18:10:10,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 18:10:10,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=396, Unknown=3, NotChecked=0, Total=462 [2019-01-14 18:10:10,733 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 22 states. [2019-01-14 18:10:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:10:11,537 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-01-14 18:10:11,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 18:10:11,538 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-01-14 18:10:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:10:11,539 INFO L225 Difference]: With dead ends: 50 [2019-01-14 18:10:11,539 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 18:10:11,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=102, Invalid=597, Unknown=3, NotChecked=0, Total=702 [2019-01-14 18:10:11,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 18:10:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-01-14 18:10:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 18:10:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-14 18:10:11,543 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 31 [2019-01-14 18:10:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:10:11,543 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-14 18:10:11,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 18:10:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-14 18:10:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 18:10:11,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:10:11,545 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:10:11,551 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION]=== [2019-01-14 18:10:11,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:10:11,551 INFO L82 PathProgramCache]: Analyzing trace with hash -419622911, now seen corresponding path program 2 times [2019-01-14 18:10:11,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:10:11,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:10:11,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:11,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:10:11,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:10:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:10:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 18:10:12,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:10:12,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:10:12,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 18:10:12,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 18:10:12,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:10:12,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:10:12,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2019-01-14 18:10:12,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:12,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-01-14 18:10:12,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-01-14 18:10:12,247 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:12,248 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:12,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:12,260 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7 [2019-01-14 18:10:12,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:10:12,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 18:10:12,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:12,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:12,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:12,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:45 [2019-01-14 18:10:12,513 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2019-01-14 18:10:12,516 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 35 treesize of output 26 [2019-01-14 18:10:12,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:12,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:12,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:12,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:37 [2019-01-14 18:10:12,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 18:10:12,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 18:10:12,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:12,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:12,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:12,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:39 [2019-01-14 18:10:12,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2019-01-14 18:10:12,812 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2019-01-14 18:10:12,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:10:12,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:10:12,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:10:12,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:51 [2019-01-14 18:10:13,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2019-01-14 18:10:13,024 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 27 treesize of output 18 [2019-01-14 18:10:13,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:10:13,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:13,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:10:13,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:26 [2019-01-14 18:10:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 18:10:13,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:10:13,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2019-01-14 18:10:13,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-14 18:10:13,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-14 18:10:13,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=525, Unknown=1, NotChecked=0, Total=600 [2019-01-14 18:10:13,858 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 25 states. [2019-01-14 18:10:16,373 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-01-14 18:10:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:10:18,682 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-01-14 18:10:18,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 18:10:18,683 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2019-01-14 18:10:18,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:10:18,683 INFO L225 Difference]: With dead ends: 38 [2019-01-14 18:10:18,684 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 18:10:18,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=138, Invalid=853, Unknown=1, NotChecked=0, Total=992 [2019-01-14 18:10:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 18:10:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 18:10:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 18:10:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 18:10:18,685 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-01-14 18:10:18,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:10:18,685 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 18:10:18,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-14 18:10:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 18:10:18,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 18:10:18,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:10:18 BoogieIcfgContainer [2019-01-14 18:10:18,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:10:18,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:10:18,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:10:18,691 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:10:18,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:09:33" (3/4) ... [2019-01-14 18:10:18,695 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 18:10:18,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 18:10:18,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_realloc [2019-01-14 18:10:18,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 18:10:18,703 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 18:10:18,703 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure expandArray [2019-01-14 18:10:18,703 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 18:10:18,708 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-01-14 18:10:18,708 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-14 18:10:18,708 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 18:10:18,709 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 18:10:18,757 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 18:10:18,758 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:10:18,759 INFO L168 Benchmark]: Toolchain (without parser) took 47152.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.3 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -226.6 MB). Peak memory consumption was 82.7 MB. Max. memory is 11.5 GB. [2019-01-14 18:10:18,760 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:10:18,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-01-14 18:10:18,761 INFO L168 Benchmark]: Boogie Preprocessor took 80.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:10:18,761 INFO L168 Benchmark]: RCFGBuilder took 723.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. [2019-01-14 18:10:18,762 INFO L168 Benchmark]: TraceAbstraction took 45628.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -130.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. [2019-01-14 18:10:18,762 INFO L168 Benchmark]: Witness Printer took 67.52 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2019-01-14 18:10:18,768 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 646.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 723.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45628.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -130.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. * Witness Printer took 67.52 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 581]: 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: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 562]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 562]: 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 - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 53 locations, 14 error locations. SAFE Result, 45.5s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 27.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 666 SDtfs, 520 SDslu, 2122 SDs, 0 SdLazy, 2259 SolverSat, 136 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 20.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 223 SyntacticMatches, 18 SemanticMatches, 214 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 20.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=6, 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, 48 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 699 NumberOfCodeBlocks, 699 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 670 ConstructedInterpolants, 25 QuantifiedInterpolants, 172042 SizeOfPredicates, 58 NumberOfNonLiveVariables, 1861 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 29 InterpolantComputations, 13 PerfectInterpolantSequences, 35/74 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...