./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3d056a1f Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/list-properties/alternating_list-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c54128245d3ab9ad313da188c7be33f66027c6a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-3d056a1 [2019-11-22 14:30:43,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 14:30:43,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 14:30:43,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 14:30:43,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 14:30:43,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 14:30:43,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 14:30:43,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 14:30:43,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 14:30:43,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 14:30:43,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 14:30:43,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 14:30:43,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 14:30:43,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 14:30:43,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 14:30:43,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 14:30:43,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 14:30:43,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 14:30:43,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 14:30:43,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 14:30:43,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 14:30:43,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 14:30:43,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 14:30:43,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 14:30:43,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 14:30:43,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 14:30:43,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 14:30:43,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 14:30:43,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 14:30:43,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 14:30:43,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 14:30:43,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 14:30:43,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 14:30:43,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 14:30:43,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 14:30:43,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 14:30:43,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 14:30:43,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 14:30:43,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 14:30:43,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 14:30:43,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 14:30:43,136 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-22 14:30:43,170 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 14:30:43,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 14:30:43,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 14:30:43,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 14:30:43,172 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 14:30:43,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 14:30:43,175 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 14:30:43,175 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 14:30:43,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 14:30:43,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 14:30:43,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 14:30:43,176 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 14:30:43,176 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 14:30:43,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 14:30:43,176 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 14:30:43,176 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 14:30:43,177 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 14:30:43,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 14:30:43,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 14:30:43,178 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 14:30:43,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 14:30:43,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:30:43,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 14:30:43,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 14:30:43,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 14:30:43,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 14:30:43,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2019-11-22 14:30:43,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 14:30:43,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 14:30:43,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 14:30:43,505 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 14:30:43,506 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 14:30:43,506 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-22 14:30:43,559 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441ba2585/f8759004c8b24eab9a7829491e8502de/FLAGc0e347c1a [2019-11-22 14:30:44,059 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 14:30:44,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-22 14:30:44,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441ba2585/f8759004c8b24eab9a7829491e8502de/FLAGc0e347c1a [2019-11-22 14:30:44,335 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441ba2585/f8759004c8b24eab9a7829491e8502de [2019-11-22 14:30:44,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 14:30:44,340 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 14:30:44,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 14:30:44,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 14:30:44,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 14:30:44,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:30:44" (1/1) ... [2019-11-22 14:30:44,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50af909a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:44, skipping insertion in model container [2019-11-22 14:30:44,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:30:44" (1/1) ... [2019-11-22 14:30:44,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 14:30:44,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 14:30:44,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:30:44,799 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 14:30:44,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:30:44,908 INFO L208 MainTranslator]: Completed translation [2019-11-22 14:30:44,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:44 WrapperNode [2019-11-22 14:30:44,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 14:30:44,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 14:30:44,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 14:30:44,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 14:30:44,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:44" (1/1) ... [2019-11-22 14:30:44,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:44" (1/1) ... [2019-11-22 14:30:44,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:44" (1/1) ... [2019-11-22 14:30:44,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:44" (1/1) ... [2019-11-22 14:30:44,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:44" (1/1) ... [2019-11-22 14:30:44,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:44" (1/1) ... [2019-11-22 14:30:44,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:44" (1/1) ... [2019-11-22 14:30:44,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 14:30:44,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 14:30:44,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 14:30:44,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 14:30:44,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:44" (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-11-22 14:30:45,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 14:30:45,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 14:30:45,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 14:30:45,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 14:30:45,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-22 14:30:45,032 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-22 14:30:45,032 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-22 14:30:45,032 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-22 14:30:45,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 14:30:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 14:30:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 14:30:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 14:30:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 14:30:45,034 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 14:30:45,034 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 14:30:45,034 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 14:30:45,034 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 14:30:45,034 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 14:30:45,035 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 14:30:45,035 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 14:30:45,035 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 14:30:45,035 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 14:30:45,036 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 14:30:45,036 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 14:30:45,036 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 14:30:45,036 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 14:30:45,037 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 14:30:45,037 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 14:30:45,037 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 14:30:45,037 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-22 14:30:45,037 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-22 14:30:45,038 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-22 14:30:45,038 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 14:30:45,038 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 14:30:45,038 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 14:30:45,038 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 14:30:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 14:30:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 14:30:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 14:30:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 14:30:45,040 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 14:30:45,040 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 14:30:45,040 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 14:30:45,040 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 14:30:45,040 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 14:30:45,041 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 14:30:45,041 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 14:30:45,041 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 14:30:45,041 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 14:30:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 14:30:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 14:30:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 14:30:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 14:30:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 14:30:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 14:30:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 14:30:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 14:30:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 14:30:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 14:30:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 14:30:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 14:30:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 14:30:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 14:30:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 14:30:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 14:30:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 14:30:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 14:30:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 14:30:45,046 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 14:30:45,046 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 14:30:45,046 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 14:30:45,046 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 14:30:45,046 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 14:30:45,047 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 14:30:45,047 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 14:30:45,047 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 14:30:45,047 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 14:30:45,047 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 14:30:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 14:30:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 14:30:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 14:30:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 14:30:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 14:30:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 14:30:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 14:30:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 14:30:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 14:30:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 14:30:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 14:30:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 14:30:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 14:30:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 14:30:45,050 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 14:30:45,051 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 14:30:45,051 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 14:30:45,051 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 14:30:45,051 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 14:30:45,051 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 14:30:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 14:30:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 14:30:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 14:30:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 14:30:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 14:30:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 14:30:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 14:30:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 14:30:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 14:30:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 14:30:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 14:30:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 14:30:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 14:30:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 14:30:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 14:30:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 14:30:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 14:30:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 14:30:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 14:30:45,055 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 14:30:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-22 14:30:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 14:30:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 14:30:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 14:30:45,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 14:30:45,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 14:30:45,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 14:30:45,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 14:30:45,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 14:30:45,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 14:30:45,409 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-22 14:30:45,691 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 14:30:45,693 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-22 14:30:45,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:30:45 BoogieIcfgContainer [2019-11-22 14:30:45,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 14:30:45,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 14:30:45,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 14:30:45,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 14:30:45,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:30:44" (1/3) ... [2019-11-22 14:30:45,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d72323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:30:45, skipping insertion in model container [2019-11-22 14:30:45,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:44" (2/3) ... [2019-11-22 14:30:45,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d72323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:30:45, skipping insertion in model container [2019-11-22 14:30:45,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:30:45" (3/3) ... [2019-11-22 14:30:45,707 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2019-11-22 14:30:45,717 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 14:30:45,732 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-22 14:30:45,745 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-22 14:30:45,766 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 14:30:45,768 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 14:30:45,768 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 14:30:45,769 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 14:30:45,769 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 14:30:45,769 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 14:30:45,769 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 14:30:45,770 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 14:30:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-22 14:30:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 14:30:45,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:45,798 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:45,799 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:30:45,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:45,803 INFO L82 PathProgramCache]: Analyzing trace with hash 63975510, now seen corresponding path program 1 times [2019-11-22 14:30:45,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:45,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351512201] [2019-11-22 14:30:45,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:45,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351512201] [2019-11-22 14:30:45,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:45,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 14:30:45,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66564925] [2019-11-22 14:30:45,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 14:30:45,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:45,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 14:30:45,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:30:45,990 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2019-11-22 14:30:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:46,207 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-11-22 14:30:46,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:30:46,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-22 14:30:46,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:46,219 INFO L225 Difference]: With dead ends: 80 [2019-11-22 14:30:46,219 INFO L226 Difference]: Without dead ends: 72 [2019-11-22 14:30:46,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-22 14:30:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-22 14:30:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-22 14:30:46,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-22 14:30:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-11-22 14:30:46,268 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 10 [2019-11-22 14:30:46,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:46,269 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-11-22 14:30:46,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 14:30:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-11-22 14:30:46,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 14:30:46,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:46,270 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:46,271 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:30:46,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:46,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1983205163, now seen corresponding path program 1 times [2019-11-22 14:30:46,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:46,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473150332] [2019-11-22 14:30:46,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:46,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473150332] [2019-11-22 14:30:46,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:46,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 14:30:46,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924062885] [2019-11-22 14:30:46,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:30:46,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:46,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:30:46,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:30:46,409 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 5 states. [2019-11-22 14:30:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:46,691 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-11-22 14:30:46,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 14:30:46,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-22 14:30:46,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:46,694 INFO L225 Difference]: With dead ends: 93 [2019-11-22 14:30:46,694 INFO L226 Difference]: Without dead ends: 93 [2019-11-22 14:30:46,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:30:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-22 14:30:46,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2019-11-22 14:30:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-22 14:30:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-11-22 14:30:46,721 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 11 [2019-11-22 14:30:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:46,722 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-11-22 14:30:46,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:30:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-11-22 14:30:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 14:30:46,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:46,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:46,724 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:30:46,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:46,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1983205164, now seen corresponding path program 1 times [2019-11-22 14:30:46,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:46,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994110686] [2019-11-22 14:30:46,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:46,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994110686] [2019-11-22 14:30:46,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:46,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 14:30:46,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580622656] [2019-11-22 14:30:46,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:30:46,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:46,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:30:46,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:30:46,839 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 5 states. [2019-11-22 14:30:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:47,098 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-22 14:30:47,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:30:47,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-22 14:30:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:47,100 INFO L225 Difference]: With dead ends: 99 [2019-11-22 14:30:47,100 INFO L226 Difference]: Without dead ends: 99 [2019-11-22 14:30:47,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:30:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-22 14:30:47,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2019-11-22 14:30:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-22 14:30:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-11-22 14:30:47,110 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 11 [2019-11-22 14:30:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:47,110 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-11-22 14:30:47,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:30:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-11-22 14:30:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 14:30:47,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:47,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:47,112 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:30:47,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:47,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2096806293, now seen corresponding path program 1 times [2019-11-22 14:30:47,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:47,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289734655] [2019-11-22 14:30:47,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:47,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:47,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289734655] [2019-11-22 14:30:47,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:47,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 14:30:47,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26522361] [2019-11-22 14:30:47,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:30:47,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:47,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:30:47,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:30:47,238 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 5 states. [2019-11-22 14:30:47,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:47,432 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2019-11-22 14:30:47,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:30:47,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-22 14:30:47,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:47,434 INFO L225 Difference]: With dead ends: 95 [2019-11-22 14:30:47,434 INFO L226 Difference]: Without dead ends: 95 [2019-11-22 14:30:47,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:30:47,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-22 14:30:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2019-11-22 14:30:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-22 14:30:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-11-22 14:30:47,442 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 19 [2019-11-22 14:30:47,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:47,443 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-11-22 14:30:47,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:30:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-11-22 14:30:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 14:30:47,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:47,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:47,444 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:30:47,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:47,445 INFO L82 PathProgramCache]: Analyzing trace with hash 576531525, now seen corresponding path program 1 times [2019-11-22 14:30:47,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:47,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883710066] [2019-11-22 14:30:47,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:47,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883710066] [2019-11-22 14:30:47,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:47,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 14:30:47,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666484737] [2019-11-22 14:30:47,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:30:47,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:47,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:30:47,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:30:47,554 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 6 states. [2019-11-22 14:30:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:47,752 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-22 14:30:47,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 14:30:47,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-22 14:30:47,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:47,754 INFO L225 Difference]: With dead ends: 99 [2019-11-22 14:30:47,754 INFO L226 Difference]: Without dead ends: 99 [2019-11-22 14:30:47,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:30:47,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-22 14:30:47,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2019-11-22 14:30:47,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-22 14:30:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2019-11-22 14:30:47,763 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 20 [2019-11-22 14:30:47,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:47,763 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2019-11-22 14:30:47,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:30:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2019-11-22 14:30:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 14:30:47,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:47,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:47,766 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:30:47,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:47,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1548979245, now seen corresponding path program 1 times [2019-11-22 14:30:47,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:47,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251025182] [2019-11-22 14:30:47,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:47,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251025182] [2019-11-22 14:30:47,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:47,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 14:30:47,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427266724] [2019-11-22 14:30:47,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:30:47,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:47,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:30:47,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:30:47,834 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 7 states. [2019-11-22 14:30:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:48,112 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2019-11-22 14:30:48,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 14:30:48,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-22 14:30:48,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:48,114 INFO L225 Difference]: With dead ends: 132 [2019-11-22 14:30:48,115 INFO L226 Difference]: Without dead ends: 132 [2019-11-22 14:30:48,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:30:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-22 14:30:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2019-11-22 14:30:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-22 14:30:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2019-11-22 14:30:48,124 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 20 [2019-11-22 14:30:48,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:48,124 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2019-11-22 14:30:48,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:30:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2019-11-22 14:30:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:30:48,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:48,126 INFO L410 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-11-22 14:30:48,127 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:30:48,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:48,127 INFO L82 PathProgramCache]: Analyzing trace with hash 691191193, now seen corresponding path program 1 times [2019-11-22 14:30:48,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:48,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878659450] [2019-11-22 14:30:48,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:48,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878659450] [2019-11-22 14:30:48,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:48,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 14:30:48,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281003453] [2019-11-22 14:30:48,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:30:48,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:48,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:30:48,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:30:48,251 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 6 states. [2019-11-22 14:30:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:48,484 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-22 14:30:48,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 14:30:48,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-22 14:30:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:48,486 INFO L225 Difference]: With dead ends: 109 [2019-11-22 14:30:48,487 INFO L226 Difference]: Without dead ends: 105 [2019-11-22 14:30:48,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:30:48,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-22 14:30:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2019-11-22 14:30:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-22 14:30:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2019-11-22 14:30:48,494 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 21 [2019-11-22 14:30:48,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:48,494 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2019-11-22 14:30:48,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:30:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2019-11-22 14:30:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:30:48,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:48,496 INFO L410 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-11-22 14:30:48,496 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:30:48,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:48,496 INFO L82 PathProgramCache]: Analyzing trace with hash 692608250, now seen corresponding path program 1 times [2019-11-22 14:30:48,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:48,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432155667] [2019-11-22 14:30:48,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:48,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432155667] [2019-11-22 14:30:48,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:48,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 14:30:48,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418280600] [2019-11-22 14:30:48,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:30:48,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:48,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:30:48,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:30:48,582 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 8 states. [2019-11-22 14:30:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:48,892 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-11-22 14:30:48,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:30:48,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-22 14:30:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:48,893 INFO L225 Difference]: With dead ends: 111 [2019-11-22 14:30:48,893 INFO L226 Difference]: Without dead ends: 104 [2019-11-22 14:30:48,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-22 14:30:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-22 14:30:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2019-11-22 14:30:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-22 14:30:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-11-22 14:30:48,900 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 21 [2019-11-22 14:30:48,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:48,900 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-11-22 14:30:48,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:30:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-11-22 14:30:48,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:30:48,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:48,901 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:48,901 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:30:48,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:48,902 INFO L82 PathProgramCache]: Analyzing trace with hash -972300712, now seen corresponding path program 1 times [2019-11-22 14:30:48,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:48,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342354442] [2019-11-22 14:30:48,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:48,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:48,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342354442] [2019-11-22 14:30:48,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:48,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:30:48,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541943964] [2019-11-22 14:30:48,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:30:48,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:48,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:30:48,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:30:48,958 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 7 states. [2019-11-22 14:30:49,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:49,207 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-22 14:30:49,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 14:30:49,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-22 14:30:49,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:49,209 INFO L225 Difference]: With dead ends: 96 [2019-11-22 14:30:49,209 INFO L226 Difference]: Without dead ends: 96 [2019-11-22 14:30:49,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:30:49,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-22 14:30:49,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-11-22 14:30:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-22 14:30:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2019-11-22 14:30:49,214 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 21 [2019-11-22 14:30:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:49,215 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-11-22 14:30:49,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:30:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2019-11-22 14:30:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:30:49,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:49,216 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:49,216 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:30:49,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:49,216 INFO L82 PathProgramCache]: Analyzing trace with hash -972300711, now seen corresponding path program 1 times [2019-11-22 14:30:49,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:49,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940307806] [2019-11-22 14:30:49,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:49,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940307806] [2019-11-22 14:30:49,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:49,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:30:49,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655447258] [2019-11-22 14:30:49,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:30:49,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:49,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:30:49,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:30:49,300 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 7 states. [2019-11-22 14:30:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:49,601 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2019-11-22 14:30:49,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:30:49,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-22 14:30:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:49,602 INFO L225 Difference]: With dead ends: 87 [2019-11-22 14:30:49,603 INFO L226 Difference]: Without dead ends: 87 [2019-11-22 14:30:49,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-22 14:30:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-22 14:30:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2019-11-22 14:30:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-22 14:30:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-11-22 14:30:49,606 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 21 [2019-11-22 14:30:49,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:49,607 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-11-22 14:30:49,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:30:49,607 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-11-22 14:30:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-22 14:30:49,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:49,608 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:49,608 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:30:49,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:49,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1951842208, now seen corresponding path program 1 times [2019-11-22 14:30:49,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:49,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449720953] [2019-11-22 14:30:49,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:49,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449720953] [2019-11-22 14:30:49,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497735574] [2019-11-22 14:30:49,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:49,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-22 14:30:49,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:30:49,976 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 14:30:49,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:49,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:49,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:49,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:30:50,123 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:50,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-22 14:30:50,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:50,169 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-22 14:30:50,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:50,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-22 14:30:50,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-22 14:30:50,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:50,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:50,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:50,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:39 [2019-11-22 14:30:50,399 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:50,399 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 67 [2019-11-22 14:30:50,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:50,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:50,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:50,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-22 14:30:50,440 INFO L567 ElimStorePlain]: treesize reduction 71, result has 33.6 percent of original size [2019-11-22 14:30:50,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:30:50,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:36 [2019-11-22 14:30:50,619 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 14:30:50,620 INFO L377 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 31 treesize of output 13 [2019-11-22 14:30:50,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:50,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:50,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:30:50,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:15 [2019-11-22 14:30:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:50,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:30:50,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-22 14:30:50,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423172705] [2019-11-22 14:30:50,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-22 14:30:50,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:50,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-22 14:30:50,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2019-11-22 14:30:50,730 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 26 states. [2019-11-22 14:30:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:53,000 INFO L93 Difference]: Finished difference Result 217 states and 229 transitions. [2019-11-22 14:30:53,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-22 14:30:53,000 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 30 [2019-11-22 14:30:53,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:53,002 INFO L225 Difference]: With dead ends: 217 [2019-11-22 14:30:53,002 INFO L226 Difference]: Without dead ends: 214 [2019-11-22 14:30:53,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=467, Invalid=2395, Unknown=0, NotChecked=0, Total=2862 [2019-11-22 14:30:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-22 14:30:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 102. [2019-11-22 14:30:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-22 14:30:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2019-11-22 14:30:53,009 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 30 [2019-11-22 14:30:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:53,010 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2019-11-22 14:30:53,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-22 14:30:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2019-11-22 14:30:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-22 14:30:53,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:53,012 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:53,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:53,223 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:30:53,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash 295041158, now seen corresponding path program 1 times [2019-11-22 14:30:53,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:53,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7670788] [2019-11-22 14:30:53,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:53,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7670788] [2019-11-22 14:30:53,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173228505] [2019-11-22 14:30:53,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:53,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 14:30:53,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:30:53,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 14:30:53,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:53,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:53,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:53,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:30:53,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-22 14:30:53,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:53,644 INFO L567 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2019-11-22 14:30:53,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:53,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-11-22 14:30:53,694 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:53,695 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 14:30:53,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:53,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:53,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:53,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-22 14:30:53,738 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_16|], 2=[|v_#memory_int_16|]} [2019-11-22 14:30:53,743 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-22 14:30:53,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:53,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:53,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:30:53,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-22 14:30:53,776 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:53,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:53,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:53,788 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-11-22 14:30:53,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 14:30:53,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:53,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:53,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:53,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-11-22 14:30:53,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-22 14:30:53,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:53,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:53,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 14:30:53,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-11-22 14:30:53,945 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-22 14:30:53,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:53,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:53,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:53,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-22 14:30:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:53,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:30:53,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-11-22 14:30:53,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509609870] [2019-11-22 14:30:53,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-22 14:30:53,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:53,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-22 14:30:53,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2019-11-22 14:30:53,973 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 24 states. [2019-11-22 14:30:55,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:55,229 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2019-11-22 14:30:55,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-22 14:30:55,230 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2019-11-22 14:30:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:55,231 INFO L225 Difference]: With dead ends: 183 [2019-11-22 14:30:55,232 INFO L226 Difference]: Without dead ends: 179 [2019-11-22 14:30:55,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=1099, Unknown=0, NotChecked=0, Total=1332 [2019-11-22 14:30:55,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-22 14:30:55,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 98. [2019-11-22 14:30:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-22 14:30:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-11-22 14:30:55,237 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 31 [2019-11-22 14:30:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:55,238 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-11-22 14:30:55,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-22 14:30:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-11-22 14:30:55,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-22 14:30:55,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:55,239 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-22 14:30:55,442 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:55,443 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:30:55,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:55,444 INFO L82 PathProgramCache]: Analyzing trace with hash 384991059, now seen corresponding path program 2 times [2019-11-22 14:30:55,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:55,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973948426] [2019-11-22 14:30:55,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-22 14:30:55,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973948426] [2019-11-22 14:30:55,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:55,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 14:30:55,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663837343] [2019-11-22 14:30:55,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 14:30:55,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:55,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 14:30:55,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:30:55,493 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 4 states. [2019-11-22 14:30:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:55,591 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2019-11-22 14:30:55,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 14:30:55,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-22 14:30:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:55,593 INFO L225 Difference]: With dead ends: 131 [2019-11-22 14:30:55,593 INFO L226 Difference]: Without dead ends: 131 [2019-11-22 14:30:55,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:30:55,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-22 14:30:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 98. [2019-11-22 14:30:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-22 14:30:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2019-11-22 14:30:55,597 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 40 [2019-11-22 14:30:55,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:55,597 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2019-11-22 14:30:55,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 14:30:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2019-11-22 14:30:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-22 14:30:55,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:55,599 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:55,599 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:30:55,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:55,600 INFO L82 PathProgramCache]: Analyzing trace with hash -232317747, now seen corresponding path program 1 times [2019-11-22 14:30:55,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:55,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350655702] [2019-11-22 14:30:55,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:56,056 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:56,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350655702] [2019-11-22 14:30:56,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268295183] [2019-11-22 14:30:56,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:56,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-22 14:30:56,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:30:56,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 14:30:56,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:56,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:56,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:56,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:30:56,287 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:56,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 14:30:56,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:56,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:56,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:56,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-22 14:30:56,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-22 14:30:56,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:56,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:56,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:56,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2019-11-22 14:30:56,489 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-22 14:30:56,489 INFO L377 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 1 case distinctions, treesize of input 35 treesize of output 27 [2019-11-22 14:30:56,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:56,514 INFO L567 ElimStorePlain]: treesize reduction 10, result has 73.7 percent of original size [2019-11-22 14:30:56,515 INFO L496 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-11-22 14:30:56,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:28 [2019-11-22 14:30:56,554 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:56,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 14:30:56,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:56,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:56,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:30:56,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:33 [2019-11-22 14:30:56,631 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:56,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 60 [2019-11-22 14:30:56,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:56,671 INFO L567 ElimStorePlain]: treesize reduction 34, result has 54.7 percent of original size [2019-11-22 14:30:56,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:30:56,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:38 [2019-11-22 14:30:56,871 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:56,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 133 [2019-11-22 14:30:56,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:56,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:56,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:56,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:56,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:56,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:56,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:56,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:56,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:56,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:56,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:56,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:56,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:56,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:56,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:56,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:56,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:56,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:56,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-11-22 14:30:57,053 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 30 [2019-11-22 14:30:57,054 INFO L567 ElimStorePlain]: treesize reduction 1073, result has 6.6 percent of original size [2019-11-22 14:30:57,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:57,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 14:30:57,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:98, output treesize:77 [2019-11-22 14:30:57,225 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 14:30:57,226 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:57,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2019-11-22 14:30:57,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:57,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:57,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:57,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:5 [2019-11-22 14:30:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:57,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:30:57,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2019-11-22 14:30:57,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837481511] [2019-11-22 14:30:57,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-22 14:30:57,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:57,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-22 14:30:57,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2019-11-22 14:30:57,302 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 34 states. [2019-11-22 14:30:59,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:59,914 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-11-22 14:30:59,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-22 14:30:59,915 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-11-22 14:30:59,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:59,916 INFO L225 Difference]: With dead ends: 70 [2019-11-22 14:30:59,916 INFO L226 Difference]: Without dead ends: 67 [2019-11-22 14:30:59,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=524, Invalid=3136, Unknown=0, NotChecked=0, Total=3660 [2019-11-22 14:30:59,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-22 14:30:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 52. [2019-11-22 14:30:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-22 14:30:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-11-22 14:30:59,920 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 40 [2019-11-22 14:30:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:59,920 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-11-22 14:30:59,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-22 14:30:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-11-22 14:30:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-22 14:30:59,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:59,922 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:31:00,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:31:00,130 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:31:00,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:31:00,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1305559289, now seen corresponding path program 1 times [2019-11-22 14:31:00,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:31:00,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165482458] [2019-11-22 14:31:00,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:31:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:31:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:31:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:31:00,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165482458] [2019-11-22 14:31:00,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191070675] [2019-11-22 14:31:00,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:31:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:31:00,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-22 14:31:00,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:31:00,544 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 14:31:00,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:00,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:31:00,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-22 14:31:00,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,637 INFO L567 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2019-11-22 14:31:00,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-11-22 14:31:00,675 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:00,675 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 14:31:00,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:00,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-22 14:31:00,717 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_21|], 2=[|v_#memory_int_19|]} [2019-11-22 14:31:00,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-22 14:31:00,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:00,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:31:00,743 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-22 14:31:00,743 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:00,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,759 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-11-22 14:31:00,799 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 14:31:00,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:00,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2019-11-22 14:31:00,864 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-22 14:31:00,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:00,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-22 14:31:00,911 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:00,912 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 14:31:00,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:00,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-11-22 14:31:00,953 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_22|], 6=[|v_#memory_int_21|]} [2019-11-22 14:31:00,956 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 14:31:00,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:00,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:31:00,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-22 14:31:00,986 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:00,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:31:00,997 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-11-22 14:31:01,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 14:31:01,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:01,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:01,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 14:31:01,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2019-11-22 14:31:01,149 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:01,150 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2019-11-22 14:31:01,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:01,190 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-11-22 14:31:01,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:31:01,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 14:31:01,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:41 [2019-11-22 14:31:01,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:31:01,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:31:01,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-22 14:31:01,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:31:01,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:31:01,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:31:01,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-11-22 14:31:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:31:01,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:31:01,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2019-11-22 14:31:01,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359031956] [2019-11-22 14:31:01,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-22 14:31:01,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:31:01,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-22 14:31:01,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2019-11-22 14:31:01,348 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 34 states. [2019-11-22 14:31:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:31:02,432 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-11-22 14:31:02,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-22 14:31:02,433 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2019-11-22 14:31:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:31:02,434 INFO L225 Difference]: With dead ends: 46 [2019-11-22 14:31:02,434 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 14:31:02,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=424, Invalid=2438, Unknown=0, NotChecked=0, Total=2862 [2019-11-22 14:31:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 14:31:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 14:31:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 14:31:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 14:31:02,436 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-11-22 14:31:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:31:02,437 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 14:31:02,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-22 14:31:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 14:31:02,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 14:31:02,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:31:02,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:31:02 BoogieIcfgContainer [2019-11-22 14:31:02,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 14:31:02,647 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 14:31:02,647 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 14:31:02,647 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 14:31:02,648 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:30:45" (3/4) ... [2019-11-22 14:31:02,651 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 14:31:02,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 14:31:02,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-22 14:31:02,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-22 14:31:02,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-22 14:31:02,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-22 14:31:02,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-22 14:31:02,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 14:31:02,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-22 14:31:02,664 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-22 14:31:02,664 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-22 14:31:02,665 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 14:31:02,665 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 14:31:02,722 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 14:31:02,722 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 14:31:02,724 INFO L168 Benchmark]: Toolchain (without parser) took 18384.17 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 375.4 MB). Free memory was 957.7 MB in the beginning and 854.4 MB in the end (delta: 103.3 MB). Peak memory consumption was 478.7 MB. Max. memory is 11.5 GB. [2019-11-22 14:31:02,724 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:31:02,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 567.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-22 14:31:02,725 INFO L168 Benchmark]: Boogie Preprocessor took 57.64 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-11-22 14:31:02,725 INFO L168 Benchmark]: RCFGBuilder took 728.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2019-11-22 14:31:02,726 INFO L168 Benchmark]: TraceAbstraction took 16950.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.8 MB). Free memory was 1.1 GB in the beginning and 854.4 MB in the end (delta: 216.1 MB). Peak memory consumption was 439.0 MB. Max. memory is 11.5 GB. [2019-11-22 14:31:02,726 INFO L168 Benchmark]: Witness Printer took 75.20 ms. Allocated memory is still 1.4 GB. Free memory is still 854.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:31:02,729 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 567.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.64 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 728.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16950.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.8 MB). Free memory was 1.1 GB in the beginning and 854.4 MB in the end (delta: 216.1 MB). Peak memory consumption was 439.0 MB. Max. memory is 11.5 GB. * Witness Printer took 75.20 ms. Allocated memory is still 1.4 GB. Free memory is still 854.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 96 locations, 29 error locations. Result: SAFE, OverallTime: 16.8s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 708 SDtfs, 1723 SDslu, 2486 SDs, 0 SdLazy, 4520 SolverSat, 571 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2506 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 352 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 499 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 480 ConstructedInterpolants, 42 QuantifiedInterpolants, 163784 SizeOfPredicates, 62 NumberOfNonLiveVariables, 662 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 22/80 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...