./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/forester-heap/dll-rb-cnstr_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 79a0f3fe2cfdc34f95f5ad882c4d01fe846ad912 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/forester-heap/dll-rb-cnstr_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 79a0f3fe2cfdc34f95f5ad882c4d01fe846ad912 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:36:10,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:36:10,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:36:10,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:36:10,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:36:10,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:36:10,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:36:10,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:36:10,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:36:10,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:36:10,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:36:10,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:36:10,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:36:10,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:36:10,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:36:10,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:36:10,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:36:10,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:36:10,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:36:10,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:36:10,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:36:10,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:36:10,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:36:10,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:36:10,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:36:10,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:36:10,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:36:10,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:36:10,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:36:10,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:36:10,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:36:10,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:36:10,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:36:10,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:36:10,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:36:10,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:36:10,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:36:10,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:36:10,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:36:10,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:36:10,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:36:10,819 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 06:36:10,857 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:36:10,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:36:10,859 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:36:10,859 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:36:10,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:36:10,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:36:10,862 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:36:10,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:36:10,862 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:36:10,862 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:36:10,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:36:10,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:36:10,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:36:10,864 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:36:10,864 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:36:10,864 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:36:10,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:36:10,864 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:36:10,865 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:36:10,865 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:36:10,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:36:10,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:36:10,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:36:10,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:36:10,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:36:10,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:36:10,866 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 06:36:10,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 06:36:10,867 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:36:10,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 79a0f3fe2cfdc34f95f5ad882c4d01fe846ad912 [2021-08-27 06:36:11,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:36:11,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:36:11,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:36:11,226 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:36:11,233 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:36:11,234 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-08-27 06:36:11,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88eaedd11/d8555a723ffa48feb2345551066fc84a/FLAG4fed5d752 [2021-08-27 06:36:11,861 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:36:11,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-08-27 06:36:11,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88eaedd11/d8555a723ffa48feb2345551066fc84a/FLAG4fed5d752 [2021-08-27 06:36:12,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88eaedd11/d8555a723ffa48feb2345551066fc84a [2021-08-27 06:36:12,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:36:12,325 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:36:12,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:36:12,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:36:12,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:36:12,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:36:12" (1/1) ... [2021-08-27 06:36:12,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb2250b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:12, skipping insertion in model container [2021-08-27 06:36:12,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:36:12" (1/1) ... [2021-08-27 06:36:12,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:36:12,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:36:12,716 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-08-27 06:36:12,724 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-08-27 06:36:12,726 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-08-27 06:36:12,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:36:12,746 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:36:12,797 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-08-27 06:36:12,798 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-08-27 06:36:12,801 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-08-27 06:36:12,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:36:12,842 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:36:12,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:12 WrapperNode [2021-08-27 06:36:12,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:36:12,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:36:12,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:36:12,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:36:12,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:12" (1/1) ... [2021-08-27 06:36:12,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:12" (1/1) ... [2021-08-27 06:36:12,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:12" (1/1) ... [2021-08-27 06:36:12,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:12" (1/1) ... [2021-08-27 06:36:12,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:12" (1/1) ... [2021-08-27 06:36:12,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:12" (1/1) ... [2021-08-27 06:36:12,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:12" (1/1) ... [2021-08-27 06:36:12,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:36:12,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:36:12,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:36:12,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:36:12,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:12" (1/1) ... [2021-08-27 06:36:12,951 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:36:12,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:36:12,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 06:36:13,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 06:36:13,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:36:13,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:36:13,026 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:36:13,027 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:36:13,027 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:36:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:36:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:36:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:36:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:36:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:36:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:36:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:36:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:36:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:36:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:36:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:36:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:36:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:36:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:36:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:36:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:36:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:36:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:36:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:36:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:36:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:36:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:36:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:36:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:36:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:36:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:36:13,033 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:36:13,033 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:36:13,033 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:36:13,033 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:36:13,033 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:36:13,033 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:36:13,033 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:36:13,034 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:36:13,034 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:36:13,034 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:36:13,034 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:36:13,035 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:36:13,035 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:36:13,035 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:36:13,036 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:36:13,036 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:36:13,036 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:36:13,036 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:36:13,037 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:36:13,037 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:36:13,037 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:36:13,037 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:36:13,037 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:36:13,037 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:36:13,037 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:36:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:36:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:36:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:36:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:36:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:36:13,039 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:36:13,039 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:36:13,040 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:36:13,040 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:36:13,040 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:36:13,040 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:36:13,041 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:36:13,041 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:36:13,041 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:36:13,041 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:36:13,041 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:36:13,041 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:36:13,041 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:36:13,042 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:36:13,042 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:36:13,042 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:36:13,042 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:36:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:36:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:36:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:36:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:36:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:36:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:36:13,043 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:36:13,044 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:36:13,044 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:36:13,044 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:36:13,044 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:36:13,044 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:36:13,044 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:36:13,045 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:36:13,045 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:36:13,045 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:36:13,045 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:36:13,045 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:36:13,045 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:36:13,045 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:36:13,046 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:36:13,046 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:36:13,046 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:36:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:36:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:36:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:36:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:36:13,065 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:36:13,065 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:36:13,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:36:13,065 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:36:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:36:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:36:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:36:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:36:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:36:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:36:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:36:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 06:36:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:36:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 06:36:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:36:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:36:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 06:36:13,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:36:14,000 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:36:14,003 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-08-27 06:36:14,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:36:14 BoogieIcfgContainer [2021-08-27 06:36:14,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:36:14,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:36:14,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:36:14,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:36:14,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:36:12" (1/3) ... [2021-08-27 06:36:14,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbaf29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:36:14, skipping insertion in model container [2021-08-27 06:36:14,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:12" (2/3) ... [2021-08-27 06:36:14,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbaf29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:36:14, skipping insertion in model container [2021-08-27 06:36:14,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:36:14" (3/3) ... [2021-08-27 06:36:14,017 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2021-08-27 06:36:14,021 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:36:14,022 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-08-27 06:36:14,056 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:36:14,062 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 06:36:14,062 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-08-27 06:36:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 73 states have (on average 2.136986301369863) internal successors, (156), 138 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:36:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:36:14,083 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:14,083 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:14,084 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:14,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:14,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1707240052, now seen corresponding path program 1 times [2021-08-27 06:36:14,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:14,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500474888] [2021-08-27 06:36:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:14,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:14,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:14,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:14,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500474888] [2021-08-27 06:36:14,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500474888] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:14,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:14,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:36:14,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956112941] [2021-08-27 06:36:14,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:36:14,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:14,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:36:14,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:14,312 INFO L87 Difference]: Start difference. First operand has 143 states, 73 states have (on average 2.136986301369863) internal successors, (156), 138 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:14,798 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2021-08-27 06:36:14,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:36:14,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:36:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:14,807 INFO L225 Difference]: With dead ends: 143 [2021-08-27 06:36:14,807 INFO L226 Difference]: Without dead ends: 139 [2021-08-27 06:36:14,809 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-08-27 06:36:14,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2021-08-27 06:36:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 74 states have (on average 1.8783783783783783) internal successors, (139), 131 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2021-08-27 06:36:14,844 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 7 [2021-08-27 06:36:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:14,844 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2021-08-27 06:36:14,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2021-08-27 06:36:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:36:14,845 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:14,845 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:14,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 06:36:14,846 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:14,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:14,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1707240051, now seen corresponding path program 1 times [2021-08-27 06:36:14,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:14,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246256735] [2021-08-27 06:36:14,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:14,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:14,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:14,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:14,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246256735] [2021-08-27 06:36:14,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246256735] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:14,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:14,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:36:14,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993176927] [2021-08-27 06:36:14,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:36:14,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:14,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:36:14,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:14,934 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:15,283 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2021-08-27 06:36:15,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:36:15,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:36:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:15,285 INFO L225 Difference]: With dead ends: 152 [2021-08-27 06:36:15,285 INFO L226 Difference]: Without dead ends: 152 [2021-08-27 06:36:15,286 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-08-27 06:36:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2021-08-27 06:36:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 81 states have (on average 1.7654320987654322) internal successors, (143), 135 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2021-08-27 06:36:15,295 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 7 [2021-08-27 06:36:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:15,295 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2021-08-27 06:36:15,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2021-08-27 06:36:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 06:36:15,296 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:15,296 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:15,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 06:36:15,296 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr7REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:15,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:15,297 INFO L82 PathProgramCache]: Analyzing trace with hash 152402486, now seen corresponding path program 1 times [2021-08-27 06:36:15,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:15,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26148904] [2021-08-27 06:36:15,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:15,297 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:15,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:15,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:15,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26148904] [2021-08-27 06:36:15,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26148904] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:15,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:15,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:36:15,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948764795] [2021-08-27 06:36:15,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:36:15,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:15,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:36:15,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:36:15,428 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:15,882 INFO L93 Difference]: Finished difference Result 192 states and 202 transitions. [2021-08-27 06:36:15,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:36:15,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-27 06:36:15,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:15,884 INFO L225 Difference]: With dead ends: 192 [2021-08-27 06:36:15,884 INFO L226 Difference]: Without dead ends: 192 [2021-08-27 06:36:15,884 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:36:15,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-08-27 06:36:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 154. [2021-08-27 06:36:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 97 states have (on average 1.7628865979381443) internal successors, (171), 150 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 174 transitions. [2021-08-27 06:36:15,892 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 174 transitions. Word has length 13 [2021-08-27 06:36:15,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:15,893 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 174 transitions. [2021-08-27 06:36:15,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 174 transitions. [2021-08-27 06:36:15,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 06:36:15,894 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:15,894 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:15,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 06:36:15,894 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr6REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:15,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:15,894 INFO L82 PathProgramCache]: Analyzing trace with hash 152402485, now seen corresponding path program 1 times [2021-08-27 06:36:15,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:15,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575641947] [2021-08-27 06:36:15,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:15,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:15,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:15,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:15,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575641947] [2021-08-27 06:36:15,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575641947] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:15,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:15,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:36:15,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805747063] [2021-08-27 06:36:15,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:36:15,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:15,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:36:15,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:36:15,984 INFO L87 Difference]: Start difference. First operand 154 states and 174 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:16,283 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2021-08-27 06:36:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:36:16,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-27 06:36:16,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:16,284 INFO L225 Difference]: With dead ends: 156 [2021-08-27 06:36:16,284 INFO L226 Difference]: Without dead ends: 156 [2021-08-27 06:36:16,285 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:36:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-27 06:36:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 142. [2021-08-27 06:36:16,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 98 states have (on average 1.5612244897959184) internal successors, (153), 138 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2021-08-27 06:36:16,296 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 13 [2021-08-27 06:36:16,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:16,296 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2021-08-27 06:36:16,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:16,296 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2021-08-27 06:36:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:36:16,297 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:16,297 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:16,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 06:36:16,297 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr32ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:16,297 INFO L82 PathProgramCache]: Analyzing trace with hash 429896239, now seen corresponding path program 1 times [2021-08-27 06:36:16,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:16,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97166933] [2021-08-27 06:36:16,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:16,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:16,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:16,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97166933] [2021-08-27 06:36:16,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97166933] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:16,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:16,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:36:16,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674154673] [2021-08-27 06:36:16,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:36:16,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:16,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:36:16,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:36:16,403 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:16,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:16,695 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2021-08-27 06:36:16,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:36:16,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 06:36:16,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:16,696 INFO L225 Difference]: With dead ends: 158 [2021-08-27 06:36:16,697 INFO L226 Difference]: Without dead ends: 158 [2021-08-27 06:36:16,697 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:36:16,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-27 06:36:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 140. [2021-08-27 06:36:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 97 states have (on average 1.5360824742268042) internal successors, (149), 136 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2021-08-27 06:36:16,703 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 15 [2021-08-27 06:36:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:16,703 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2021-08-27 06:36:16,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2021-08-27 06:36:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:36:16,704 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:16,705 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:16,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 06:36:16,705 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:16,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:16,706 INFO L82 PathProgramCache]: Analyzing trace with hash 442001777, now seen corresponding path program 1 times [2021-08-27 06:36:16,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:16,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212409299] [2021-08-27 06:36:16,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:16,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:16,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:16,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:16,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212409299] [2021-08-27 06:36:16,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212409299] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:16,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:16,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:36:16,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043942724] [2021-08-27 06:36:16,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:36:16,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:16,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:36:16,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:36:16,796 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:17,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:17,117 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2021-08-27 06:36:17,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:36:17,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 06:36:17,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:17,119 INFO L225 Difference]: With dead ends: 139 [2021-08-27 06:36:17,119 INFO L226 Difference]: Without dead ends: 139 [2021-08-27 06:36:17,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 73.5ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:36:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-08-27 06:36:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-08-27 06:36:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 97 states have (on average 1.5154639175257731) internal successors, (147), 135 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2021-08-27 06:36:17,125 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 16 [2021-08-27 06:36:17,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:17,125 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2021-08-27 06:36:17,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2021-08-27 06:36:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:36:17,126 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:17,126 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:17,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 06:36:17,127 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:17,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:17,127 INFO L82 PathProgramCache]: Analyzing trace with hash 442001778, now seen corresponding path program 1 times [2021-08-27 06:36:17,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:17,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041802636] [2021-08-27 06:36:17,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:17,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:17,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:17,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:17,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041802636] [2021-08-27 06:36:17,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041802636] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:17,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:17,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:36:17,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561041965] [2021-08-27 06:36:17,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:36:17,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:17,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:36:17,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:36:17,235 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:17,535 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2021-08-27 06:36:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:36:17,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 06:36:17,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:17,536 INFO L225 Difference]: With dead ends: 138 [2021-08-27 06:36:17,536 INFO L226 Difference]: Without dead ends: 138 [2021-08-27 06:36:17,537 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 68.1ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:36:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-08-27 06:36:17,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-08-27 06:36:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 97 states have (on average 1.4948453608247423) internal successors, (145), 134 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2021-08-27 06:36:17,540 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 16 [2021-08-27 06:36:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:17,541 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2021-08-27 06:36:17,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2021-08-27 06:36:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 06:36:17,541 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:17,541 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:17,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 06:36:17,542 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr35ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:17,542 INFO L82 PathProgramCache]: Analyzing trace with hash -549611590, now seen corresponding path program 1 times [2021-08-27 06:36:17,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:17,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289994437] [2021-08-27 06:36:17,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:17,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:17,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:17,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289994437] [2021-08-27 06:36:17,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289994437] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:17,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:17,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 06:36:17,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539113220] [2021-08-27 06:36:17,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:36:17,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:17,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:36:17,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:36:17,644 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:18,019 INFO L93 Difference]: Finished difference Result 198 states and 213 transitions. [2021-08-27 06:36:18,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:36:18,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-08-27 06:36:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:18,020 INFO L225 Difference]: With dead ends: 198 [2021-08-27 06:36:18,020 INFO L226 Difference]: Without dead ends: 198 [2021-08-27 06:36:18,021 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 81.1ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:36:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-08-27 06:36:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 143. [2021-08-27 06:36:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 139 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2021-08-27 06:36:18,025 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 18 [2021-08-27 06:36:18,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:18,025 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2021-08-27 06:36:18,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2021-08-27 06:36:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:36:18,026 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:18,026 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:18,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 06:36:18,027 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:18,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:18,027 INFO L82 PathProgramCache]: Analyzing trace with hash -63373389, now seen corresponding path program 1 times [2021-08-27 06:36:18,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:18,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750804751] [2021-08-27 06:36:18,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:18,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:18,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:18,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:18,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750804751] [2021-08-27 06:36:18,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750804751] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:18,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:18,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:36:18,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331167948] [2021-08-27 06:36:18,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:36:18,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:18,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:36:18,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:36:18,208 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:18,715 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2021-08-27 06:36:18,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:36:18,715 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 06:36:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:18,716 INFO L225 Difference]: With dead ends: 143 [2021-08-27 06:36:18,716 INFO L226 Difference]: Without dead ends: 143 [2021-08-27 06:36:18,717 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 202.2ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-08-27 06:36:18,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-08-27 06:36:18,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2021-08-27 06:36:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 102 states have (on average 1.4607843137254901) internal successors, (149), 138 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2021-08-27 06:36:18,720 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 20 [2021-08-27 06:36:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:18,720 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2021-08-27 06:36:18,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2021-08-27 06:36:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:36:18,721 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:18,721 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:18,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 06:36:18,721 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr15REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:18,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:18,722 INFO L82 PathProgramCache]: Analyzing trace with hash -63373388, now seen corresponding path program 1 times [2021-08-27 06:36:18,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:18,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583521030] [2021-08-27 06:36:18,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:18,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:18,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:36:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:18,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:36:18,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583521030] [2021-08-27 06:36:18,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583521030] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:18,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:18,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 06:36:18,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631714785] [2021-08-27 06:36:18,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:36:18,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:36:18,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:36:18,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:36:18,948 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:19,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:19,803 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2021-08-27 06:36:19,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 06:36:19,804 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 06:36:19,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:19,805 INFO L225 Difference]: With dead ends: 147 [2021-08-27 06:36:19,805 INFO L226 Difference]: Without dead ends: 147 [2021-08-27 06:36:19,806 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 447.4ms TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-08-27 06:36:19,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-08-27 06:36:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 138. [2021-08-27 06:36:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 134 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2021-08-27 06:36:19,809 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 20 [2021-08-27 06:36:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:19,810 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2021-08-27 06:36:19,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:19,810 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2021-08-27 06:36:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:36:19,811 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:19,811 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:19,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 06:36:19,811 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:19,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:19,812 INFO L82 PathProgramCache]: Analyzing trace with hash -195087453, now seen corresponding path program 1 times [2021-08-27 06:36:19,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:36:19,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082972280] [2021-08-27 06:36:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:19,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:36:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:36:19,823 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 06:36:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:36:19,853 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 06:36:19,854 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 06:36:19,855 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:36:19,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 06:36:19,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 06:36:19,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 06:36:19,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 06:36:19,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 06:36:19,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 06:36:19,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 06:36:19,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 06:36:19,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 06:36:19,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 06:36:19,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 06:36:19,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 06:36:19,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 06:36:19,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 06:36:19,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 06:36:19,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 06:36:19,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 06:36:19,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 06:36:19,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 06:36:19,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 06:36:19,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 06:36:19,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 06:36:19,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 06:36:19,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 06:36:19,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 06:36:19,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 06:36:19,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 06:36:19,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 06:36:19,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 06:36:19,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 06:36:19,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 06:36:19,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 06:36:19,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:36:19,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 06:36:19,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 06:36:19,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:36:19,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-08-27 06:36:19,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 06:36:19,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 06:36:19,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 06:36:19,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-08-27 06:36:19,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-08-27 06:36:19,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-08-27 06:36:19,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-08-27 06:36:19,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45REQUIRES_VIOLATION [2021-08-27 06:36:19,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-08-27 06:36:19,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-08-27 06:36:19,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48REQUIRES_VIOLATION [2021-08-27 06:36:19,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-08-27 06:36:19,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-08-27 06:36:19,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:19,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:19,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:19,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54REQUIRES_VIOLATION [2021-08-27 06:36:19,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-08-27 06:36:19,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:19,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:19,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:19,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION [2021-08-27 06:36:19,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-08-27 06:36:19,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:19,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:19,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:19,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:36:19,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 06:36:19,872 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:36:19,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:36:19 BoogieIcfgContainer [2021-08-27 06:36:19,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:36:19,893 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:36:19,893 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:36:19,893 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:36:19,893 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:36:14" (3/4) ... [2021-08-27 06:36:19,896 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:36:19,896 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:36:19,897 INFO L168 Benchmark]: Toolchain (without parser) took 7572.12 ms. Allocated memory was 50.3 MB in the beginning and 136.3 MB in the end (delta: 86.0 MB). Free memory was 25.6 MB in the beginning and 45.6 MB in the end (delta: -20.0 MB). Peak memory consumption was 65.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:19,898 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 50.3 MB. Free memory was 32.2 MB in the beginning and 32.1 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:36:19,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 515.51 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 25.4 MB in the beginning and 37.4 MB in the end (delta: -11.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:19,898 INFO L168 Benchmark]: Boogie Preprocessor took 97.34 ms. Allocated memory is still 60.8 MB. Free memory was 37.4 MB in the beginning and 34.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:19,899 INFO L168 Benchmark]: RCFGBuilder took 1063.23 ms. Allocated memory is still 60.8 MB. Free memory was 34.3 MB in the beginning and 22.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:19,899 INFO L168 Benchmark]: TraceAbstraction took 5881.68 ms. Allocated memory was 60.8 MB in the beginning and 136.3 MB in the end (delta: 75.5 MB). Free memory was 40.6 MB in the beginning and 46.7 MB in the end (delta: -6.1 MB). Peak memory consumption was 68.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:19,899 INFO L168 Benchmark]: Witness Printer took 3.41 ms. Allocated memory is still 136.3 MB. Free memory was 46.7 MB in the beginning and 45.6 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:36:19,901 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 50.3 MB. Free memory was 32.2 MB in the beginning and 32.1 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 515.51 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 25.4 MB in the beginning and 37.4 MB in the end (delta: -11.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 97.34 ms. Allocated memory is still 60.8 MB. Free memory was 37.4 MB in the beginning and 34.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1063.23 ms. Allocated memory is still 60.8 MB. Free memory was 34.3 MB in the beginning and 22.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5881.68 ms. Allocated memory was 60.8 MB in the beginning and 136.3 MB in the end (delta: 75.5 MB). Free memory was 40.6 MB in the beginning and 46.7 MB in the end (delta: -6.1 MB). Peak memory consumption was 68.6 MB. Max. memory is 16.1 GB. * Witness Printer took 3.41 ms. Allocated memory is still 136.3 MB. Free memory was 46.7 MB in the beginning and 45.6 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1051]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1051. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) VAL [list={-1:0}] [L1007] list->prev = ((void*)0) VAL [list={-1:0}] [L1008] list->colour = BLACK VAL [list={-1:0}] [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list VAL [end={-1:0}, list={-1:0}] [L1040] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1041] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}] [L1045] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next VAL [end={-1:0}, end->next={0:0}, list={-1:0}] [L1051] COND TRUE !(end->next) [L1051] reach_error() VAL [end={-1:0}, list={-1:0}] - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 146 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 5816.4ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 14.7ms, AutomataDifference: 4288.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 767 SDtfs, 1265 SDslu, 1106 SDs, 0 SdLazy, 3165 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2631.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1074.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=3, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 75.5ms AutomataMinimizationTime, 10 MinimizatonAttempts, 152 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 21.5ms SsaConstructionTime, 112.9ms SatisfiabilityAnalysisTime, 1060.6ms InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 06:36:19,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:36:21,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:36:21,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:36:21,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:36:21,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:36:21,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:36:21,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:36:21,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:36:21,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:36:21,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:36:21,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:36:21,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:36:21,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:36:21,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:36:21,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:36:21,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:36:21,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:36:21,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:36:21,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:36:21,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:36:21,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:36:21,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:36:21,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:36:21,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:36:21,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:36:21,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:36:21,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:36:21,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:36:21,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:36:21,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:36:21,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:36:21,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:36:21,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:36:21,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:36:21,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:36:21,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:36:21,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:36:21,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:36:21,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:36:21,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:36:21,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:36:21,958 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 06:36:21,992 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:36:21,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:36:21,994 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:36:21,994 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:36:21,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:36:21,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:36:21,996 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:36:21,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:36:21,996 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:36:21,997 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:36:21,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:36:21,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:36:21,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:36:21,998 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:36:21,998 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:36:21,998 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:36:21,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:36:21,998 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:36:21,998 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 06:36:21,998 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 06:36:21,999 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:36:21,999 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:36:21,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:36:21,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:36:21,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:36:21,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:36:21,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:36:22,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:36:22,000 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 06:36:22,000 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 06:36:22,000 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:36:22,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 06:36:22,001 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 79a0f3fe2cfdc34f95f5ad882c4d01fe846ad912 [2021-08-27 06:36:22,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:36:22,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:36:22,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:36:22,331 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:36:22,332 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:36:22,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-08-27 06:36:22,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fdafcccb/ce64533e5cee4c75bfbd3af7da49036e/FLAG919fddc12 [2021-08-27 06:36:22,888 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:36:22,888 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-08-27 06:36:22,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fdafcccb/ce64533e5cee4c75bfbd3af7da49036e/FLAG919fddc12 [2021-08-27 06:36:22,911 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fdafcccb/ce64533e5cee4c75bfbd3af7da49036e [2021-08-27 06:36:22,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:36:22,914 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:36:22,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:36:22,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:36:22,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:36:22,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:36:22" (1/1) ... [2021-08-27 06:36:22,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1932ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:22, skipping insertion in model container [2021-08-27 06:36:22,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:36:22" (1/1) ... [2021-08-27 06:36:22,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:36:22,971 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:36:23,278 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-08-27 06:36:23,283 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-08-27 06:36:23,286 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-08-27 06:36:23,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:36:23,314 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:36:23,365 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-08-27 06:36:23,367 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-08-27 06:36:23,370 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-08-27 06:36:23,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:36:23,409 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:36:23,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:23 WrapperNode [2021-08-27 06:36:23,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:36:23,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:36:23,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:36:23,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:36:23,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:23" (1/1) ... [2021-08-27 06:36:23,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:23" (1/1) ... [2021-08-27 06:36:23,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:23" (1/1) ... [2021-08-27 06:36:23,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:23" (1/1) ... [2021-08-27 06:36:23,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:23" (1/1) ... [2021-08-27 06:36:23,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:23" (1/1) ... [2021-08-27 06:36:23,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:23" (1/1) ... [2021-08-27 06:36:23,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:36:23,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:36:23,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:36:23,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:36:23,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:23" (1/1) ... [2021-08-27 06:36:23,527 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:36:23,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:36:23,550 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 06:36:23,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 06:36:23,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:36:23,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:36:23,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:36:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:36:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:36:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:36:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:36:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:36:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:36:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:36:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:36:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:36:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:36:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:36:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:36:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:36:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:36:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:36:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:36:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:36:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:36:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:36:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:36:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:36:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:36:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:36:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:36:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:36:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:36:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:36:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:36:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:36:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:36:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:36:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:36:23,604 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:36:23,604 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:36:23,604 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:36:23,604 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:36:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:36:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:36:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:36:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:36:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:36:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:36:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:36:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:36:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:36:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:36:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:36:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:36:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:36:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:36:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:36:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:36:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:36:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:36:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:36:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:36:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:36:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:36:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:36:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:36:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:36:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:36:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:36:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:36:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:36:23,611 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:36:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:36:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:36:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:36:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:36:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:36:23,612 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:36:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:36:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:36:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:36:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:36:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:36:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:36:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:36:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:36:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:36:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:36:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:36:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:36:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:36:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:36:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:36:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:36:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:36:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:36:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:36:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:36:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:36:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:36:23,616 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:36:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:36:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:36:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:36:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:36:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:36:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:36:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:36:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:36:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:36:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:36:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:36:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:36:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:36:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:36:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:36:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:36:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:36:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:36:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:36:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 06:36:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:36:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 06:36:23,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:36:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:36:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 06:36:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:36:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:36:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 06:36:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 06:36:24,706 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:36:24,706 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-08-27 06:36:24,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:36:24 BoogieIcfgContainer [2021-08-27 06:36:24,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:36:24,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:36:24,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:36:24,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:36:24,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:36:22" (1/3) ... [2021-08-27 06:36:24,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407449de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:36:24, skipping insertion in model container [2021-08-27 06:36:24,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:36:23" (2/3) ... [2021-08-27 06:36:24,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407449de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:36:24, skipping insertion in model container [2021-08-27 06:36:24,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:36:24" (3/3) ... [2021-08-27 06:36:24,716 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2021-08-27 06:36:24,721 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:36:24,721 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-08-27 06:36:24,761 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:36:24,767 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 06:36:24,767 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-08-27 06:36:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 71 states have (on average 2.1690140845070425) internal successors, (154), 136 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:36:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:36:24,788 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:24,789 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:24,789 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:24,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:24,801 INFO L82 PathProgramCache]: Analyzing trace with hash -486261088, now seen corresponding path program 1 times [2021-08-27 06:36:24,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:24,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326880094] [2021-08-27 06:36:24,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:24,811 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:24,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:24,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:36:24,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-27 06:36:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:24,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:36:24,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:25,115 INFO L388 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 [2021-08-27 06:36:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:25,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:25,193 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:36:25,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326880094] [2021-08-27 06:36:25,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326880094] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:25,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:25,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 06:36:25,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557969170] [2021-08-27 06:36:25,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:36:25,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:36:25,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:36:25,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:36:25,213 INFO L87 Difference]: Start difference. First operand has 141 states, 71 states have (on average 2.1690140845070425) internal successors, (154), 136 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:25,490 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2021-08-27 06:36:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:36:25,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:36:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:25,499 INFO L225 Difference]: With dead ends: 141 [2021-08-27 06:36:25,499 INFO L226 Difference]: Without dead ends: 137 [2021-08-27 06:36:25,501 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:36:25,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-08-27 06:36:25,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2021-08-27 06:36:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.9027777777777777) internal successors, (137), 129 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2021-08-27 06:36:25,557 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 7 [2021-08-27 06:36:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:25,558 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2021-08-27 06:36:25,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2021-08-27 06:36:25,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:36:25,558 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:25,559 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:25,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-27 06:36:25,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:36:25,768 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:25,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:25,769 INFO L82 PathProgramCache]: Analyzing trace with hash -486261087, now seen corresponding path program 1 times [2021-08-27 06:36:25,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:25,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924172112] [2021-08-27 06:36:25,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:25,770 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:25,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:25,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:36:25,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-27 06:36:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:25,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:36:25,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:25,960 INFO L388 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 [2021-08-27 06:36:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:25,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:26,054 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:36:26,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924172112] [2021-08-27 06:36:26,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924172112] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:26,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:26,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 06:36:26,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210716737] [2021-08-27 06:36:26,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:36:26,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:36:26,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:36:26,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:26,058 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:26,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:26,448 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2021-08-27 06:36:26,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:36:26,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:36:26,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:26,450 INFO L225 Difference]: With dead ends: 150 [2021-08-27 06:36:26,450 INFO L226 Difference]: Without dead ends: 150 [2021-08-27 06:36:26,451 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:26,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-08-27 06:36:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2021-08-27 06:36:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 79 states have (on average 1.7848101265822784) internal successors, (141), 133 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2021-08-27 06:36:26,458 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 7 [2021-08-27 06:36:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:26,459 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2021-08-27 06:36:26,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2021-08-27 06:36:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 06:36:26,459 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:26,459 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:26,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-08-27 06:36:26,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:36:26,671 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr6REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:26,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:26,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1027877289, now seen corresponding path program 1 times [2021-08-27 06:36:26,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:26,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138398214] [2021-08-27 06:36:26,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:26,673 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:26,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:26,674 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:36:26,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-27 06:36:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:26,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:36:26,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:26,863 INFO L388 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 [2021-08-27 06:36:26,937 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 06:36:26,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2021-08-27 06:36:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:26,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:27,048 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:36:27,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138398214] [2021-08-27 06:36:27,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138398214] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:27,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:27,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 06:36:27,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923152904] [2021-08-27 06:36:27,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:36:27,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:36:27,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:36:27,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:27,057 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:27,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:27,466 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2021-08-27 06:36:27,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:36:27,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 06:36:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:27,470 INFO L225 Difference]: With dead ends: 142 [2021-08-27 06:36:27,470 INFO L226 Difference]: Without dead ends: 142 [2021-08-27 06:36:27,470 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:36:27,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-08-27 06:36:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 127. [2021-08-27 06:36:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 123 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2021-08-27 06:36:27,482 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 12 [2021-08-27 06:36:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:27,482 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2021-08-27 06:36:27,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2021-08-27 06:36:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 06:36:27,483 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:27,483 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:27,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-27 06:36:27,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:36:27,684 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr7REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:27,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1027877290, now seen corresponding path program 1 times [2021-08-27 06:36:27,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:27,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552195209] [2021-08-27 06:36:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:27,686 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:27,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:27,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:36:27,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-27 06:36:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:27,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 06:36:27,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:27,887 INFO L388 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 [2021-08-27 06:36:27,893 INFO L388 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 [2021-08-27 06:36:28,011 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:36:28,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-08-27 06:36:28,025 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:36:28,025 INFO L388 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 29 treesize of output 29 [2021-08-27 06:36:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:28,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:30,871 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:36:30,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552195209] [2021-08-27 06:36:30,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552195209] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:30,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:30,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-08-27 06:36:30,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218967290] [2021-08-27 06:36:30,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:36:30,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:36:30,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:36:30,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-08-27 06:36:30,874 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:52,897 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2021-08-27 06:36:52,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:36:52,898 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 06:36:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:52,899 INFO L225 Difference]: With dead ends: 177 [2021-08-27 06:36:52,899 INFO L226 Difference]: Without dead ends: 177 [2021-08-27 06:36:52,900 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 17974.4ms TimeCoverageRelationStatistics Valid=68, Invalid=112, Unknown=2, NotChecked=0, Total=182 [2021-08-27 06:36:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-08-27 06:36:52,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 122. [2021-08-27 06:36:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 118 states have internal predecessors, (129), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2021-08-27 06:36:52,907 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 12 [2021-08-27 06:36:52,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:52,907 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2021-08-27 06:36:52,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2021-08-27 06:36:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-27 06:36:52,908 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:52,908 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:52,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-27 06:36:53,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:36:53,113 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr32ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:53,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash -52407454, now seen corresponding path program 1 times [2021-08-27 06:36:53,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:53,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188713269] [2021-08-27 06:36:53,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:53,114 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:53,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:53,116 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:36:53,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-27 06:36:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:53,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:36:53,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:53,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:53,445 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:36:53,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188713269] [2021-08-27 06:36:53,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188713269] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:53,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:53,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:36:53,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523676685] [2021-08-27 06:36:53,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:36:53,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:36:53,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:36:53,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:36:53,447 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:53,833 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2021-08-27 06:36:53,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:36:53,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-08-27 06:36:53,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:53,835 INFO L225 Difference]: With dead ends: 148 [2021-08-27 06:36:53,835 INFO L226 Difference]: Without dead ends: 148 [2021-08-27 06:36:53,835 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:36:53,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-08-27 06:36:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 120. [2021-08-27 06:36:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 116 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2021-08-27 06:36:53,841 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 14 [2021-08-27 06:36:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:53,841 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2021-08-27 06:36:53,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2021-08-27 06:36:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:36:53,842 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:53,842 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:53,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-27 06:36:54,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:36:54,050 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:54,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:54,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1624480014, now seen corresponding path program 1 times [2021-08-27 06:36:54,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:54,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422348276] [2021-08-27 06:36:54,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:54,051 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:54,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:54,052 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:36:54,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-27 06:36:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:54,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:36:54,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:54,290 INFO L388 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 [2021-08-27 06:36:54,316 INFO L388 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 20 treesize of output 16 [2021-08-27 06:36:54,368 INFO L388 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 21 treesize of output 13 [2021-08-27 06:36:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:54,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:54,488 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:36:54,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422348276] [2021-08-27 06:36:54,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422348276] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:54,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:54,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:36:54,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865187919] [2021-08-27 06:36:54,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:36:54,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:36:54,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:36:54,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:36:54,491 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:55,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:55,074 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2021-08-27 06:36:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:36:55,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 06:36:55,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:55,076 INFO L225 Difference]: With dead ends: 119 [2021-08-27 06:36:55,076 INFO L226 Difference]: Without dead ends: 119 [2021-08-27 06:36:55,076 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 111.1ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:36:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-08-27 06:36:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-08-27 06:36:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 115 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2021-08-27 06:36:55,081 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 15 [2021-08-27 06:36:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:55,081 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2021-08-27 06:36:55,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2021-08-27 06:36:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:36:55,082 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:55,082 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:55,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-08-27 06:36:55,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:36:55,291 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:55,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1624480013, now seen corresponding path program 1 times [2021-08-27 06:36:55,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:55,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300316587] [2021-08-27 06:36:55,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:55,292 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:55,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:55,293 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:36:55,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-27 06:36:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:55,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 06:36:55,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:55,512 INFO L388 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 [2021-08-27 06:36:55,568 INFO L388 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 17 treesize of output 13 [2021-08-27 06:36:55,581 INFO L388 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 [2021-08-27 06:36:55,640 INFO L388 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 31 treesize of output 23 [2021-08-27 06:36:55,646 INFO L388 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 12 [2021-08-27 06:36:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:55,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:55,973 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:36:55,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300316587] [2021-08-27 06:36:55,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300316587] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:55,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:55,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-08-27 06:36:55,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904446494] [2021-08-27 06:36:55,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:36:55,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:36:55,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:36:55,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:36:55,976 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:57,433 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2021-08-27 06:36:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:36:57,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 06:36:57,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:57,435 INFO L225 Difference]: With dead ends: 118 [2021-08-27 06:36:57,435 INFO L226 Difference]: Without dead ends: 118 [2021-08-27 06:36:57,436 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 353.7ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:36:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-08-27 06:36:57,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-08-27 06:36:57,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 114 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2021-08-27 06:36:57,441 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 15 [2021-08-27 06:36:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:57,441 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2021-08-27 06:36:57,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2021-08-27 06:36:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 06:36:57,442 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:57,442 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:57,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-27 06:36:57,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:36:57,649 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr35ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:57,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:57,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2101662523, now seen corresponding path program 1 times [2021-08-27 06:36:57,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:57,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642463445] [2021-08-27 06:36:57,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:57,650 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:57,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:57,653 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:36:57,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-27 06:36:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:57,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 06:36:57,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:57,865 INFO L388 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 13 treesize of output 9 [2021-08-27 06:36:57,952 INFO L388 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 19 treesize of output 7 [2021-08-27 06:36:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:57,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:58,054 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:36:58,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642463445] [2021-08-27 06:36:58,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642463445] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:36:58,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:58,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 06:36:58,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079935407] [2021-08-27 06:36:58,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:36:58,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:36:58,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:36:58,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:36:58,057 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:58,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:58,689 INFO L93 Difference]: Finished difference Result 179 states and 193 transitions. [2021-08-27 06:36:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:36:58,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 06:36:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:58,694 INFO L225 Difference]: With dead ends: 179 [2021-08-27 06:36:58,694 INFO L226 Difference]: Without dead ends: 179 [2021-08-27 06:36:58,694 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 82.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:36:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-08-27 06:36:58,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 124. [2021-08-27 06:36:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 120 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2021-08-27 06:36:58,700 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 17 [2021-08-27 06:36:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:58,700 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2021-08-27 06:36:58,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2021-08-27 06:36:58,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 06:36:58,701 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:58,701 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:58,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-27 06:36:58,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:36:58,913 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:36:58,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:58,913 INFO L82 PathProgramCache]: Analyzing trace with hash -739626508, now seen corresponding path program 1 times [2021-08-27 06:36:58,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:58,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796466602] [2021-08-27 06:36:58,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:58,914 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:58,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:58,915 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:36:58,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-27 06:36:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:59,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 06:36:59,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:59,156 INFO L388 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 [2021-08-27 06:36:59,260 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:36:59,260 INFO L388 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 25 treesize of output 32 [2021-08-27 06:36:59,338 INFO L388 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 24 treesize of output 20 [2021-08-27 06:36:59,584 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:36:59,585 INFO L388 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 43 treesize of output 33 [2021-08-27 06:36:59,773 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:36:59,774 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 43 [2021-08-27 06:36:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:59,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:04,232 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:04,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796466602] [2021-08-27 06:37:04,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796466602] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:04,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:04,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2021-08-27 06:37:04,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129365083] [2021-08-27 06:37:04,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:37:04,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:04,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:37:04,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=136, Unknown=1, NotChecked=0, Total=182 [2021-08-27 06:37:04,234 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:07,191 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2021-08-27 06:37:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 06:37:07,192 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 06:37:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:07,192 INFO L225 Difference]: With dead ends: 145 [2021-08-27 06:37:07,192 INFO L226 Difference]: Without dead ends: 145 [2021-08-27 06:37:07,193 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 4997.8ms TimeCoverageRelationStatistics Valid=142, Invalid=363, Unknown=1, NotChecked=0, Total=506 [2021-08-27 06:37:07,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-08-27 06:37:07,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 123. [2021-08-27 06:37:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 119 states have internal predecessors, (129), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2021-08-27 06:37:07,197 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 19 [2021-08-27 06:37:07,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:07,198 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2021-08-27 06:37:07,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:07,198 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2021-08-27 06:37:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 06:37:07,198 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:07,199 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:07,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:07,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:37:07,410 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr15REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:37:07,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:07,410 INFO L82 PathProgramCache]: Analyzing trace with hash -739626507, now seen corresponding path program 1 times [2021-08-27 06:37:07,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:07,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839952849] [2021-08-27 06:37:07,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:07,411 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:07,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:07,412 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:37:07,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-27 06:37:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:37:07,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 06:37:07,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:37:07,668 INFO L388 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 [2021-08-27 06:37:07,742 INFO L388 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 [2021-08-27 06:37:07,775 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:37:07,776 INFO L388 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 20 treesize of output 20 [2021-08-27 06:37:07,840 INFO L388 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 21 treesize of output 17 [2021-08-27 06:37:07,862 INFO L388 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 [2021-08-27 06:37:08,070 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:37:08,071 INFO L388 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 67 treesize of output 49 [2021-08-27 06:37:08,109 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:37:08,110 INFO L388 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 59 treesize of output 54 [2021-08-27 06:37:08,277 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:37:08,277 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 42 [2021-08-27 06:37:08,286 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:37:08,287 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2021-08-27 06:37:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:08,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:37:17,728 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset))) (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) (bvadd |main_#t~mem6.offset| (_ bv4 32)) c_main_~end~0.offset))) c_main_~end~0.base) c_main_~end~0.offset))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset)) (.cse3 (bvadd |main_#t~mem6.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 c_main_~end~0.offset)) c_main_~end~0.base) c_main_~end~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 c_main_~end~0.base)) c_main_~end~0.base) c_main_~end~0.offset)))))) is different from false [2021-08-27 06:37:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:37:18,470 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:18,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839952849] [2021-08-27 06:37:18,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839952849] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:37:18,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:37:18,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2021-08-27 06:37:18,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384649319] [2021-08-27 06:37:18,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 06:37:18,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:18,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 06:37:18,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=174, Unknown=1, NotChecked=26, Total=240 [2021-08-27 06:37:18,472 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:24,443 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_main_~end~0.offset)) (.cse5 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset))) (and (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) c_main_~end~0.offset)) (forall ((|main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse0 (bvadd |main_#t~mem6.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base|) .cse0 c_main_~end~0.offset)) c_main_~end~0.base) c_main_~end~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem6.base|) .cse0 c_main_~end~0.base)) c_main_~end~0.base) c_main_~end~0.offset))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| c_main_~end~0.base)))))) (_ bv1 1))) (bvule .cse1 (select |c_#length| c_main_~end~0.base)) (= |c_main_#t~mem7.offset| (_ bv0 32)) (forall ((|main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base|) (bvadd |main_#t~mem6.offset| (_ bv4 32)) c_main_~end~0.offset)) c_main_~end~0.base) c_main_~end~0.offset))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (bvule c_main_~end~0.offset .cse1) (= (select |c_#length| |c_main_#t~mem7.base|) (_ bv12 32)) (exists ((|main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset)) (.cse4 (bvadd |main_#t~mem6.offset| (_ bv4 32)))) (and (= c_main_~end~0.base (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) c_main_~end~0.offset)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| c_main_~list~0.base)) (_ bv1 1))) (= (select |c_#length| .cse5) (_ bv12 32)) (not (= .cse5 c_main_~end~0.base)))) is different from false [2021-08-27 06:37:39,696 WARN L207 SmtUtils]: Spent 10.22 s on a formula simplification. DAG size of input: 67 DAG size of output: 31 [2021-08-27 06:37:50,574 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset))) (and (= (_ bv0 32) c_main_~end~0.offset) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) c_main_~end~0.offset)) (forall ((|main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse0 (bvadd |main_#t~mem6.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base|) .cse0 c_main_~end~0.offset)) c_main_~end~0.base) c_main_~end~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem6.base|) .cse0 c_main_~end~0.base)) c_main_~end~0.base) c_main_~end~0.offset))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| c_main_~end~0.base)))))) (_ bv1 1))) (= (_ bv12 32) (select |c_#length| c_main_~end~0.base)) (= |c_main_#t~mem7.offset| (_ bv0 32)) (forall ((|main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base|) (bvadd |main_#t~mem6.offset| (_ bv4 32)) c_main_~end~0.offset)) c_main_~end~0.base) c_main_~end~0.offset))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))) (= (select |c_#length| |c_main_#t~mem7.base|) (_ bv12 32)) (exists ((|main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset)) (.cse3 (bvadd |main_#t~mem6.offset| (_ bv4 32)))) (and (= c_main_~end~0.base (select (select |c_#memory_$Pointer$.base| .cse2) .cse3)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) c_main_~end~0.offset)))) (= (select |c_#length| .cse4) (_ bv12 32)) (not (= .cse4 c_main_~end~0.base)))) is different from false [2021-08-27 06:37:59,072 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_main_~end~0.offset)) (.cse5 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset))) (and (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) c_main_~end~0.offset)) (forall ((|main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse0 (bvadd |main_#t~mem6.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base|) .cse0 c_main_~end~0.offset)) c_main_~end~0.base) c_main_~end~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem6.base|) .cse0 c_main_~end~0.base)) c_main_~end~0.base) c_main_~end~0.offset))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| c_main_~end~0.base)))))) (_ bv1 1))) (bvule .cse1 (select |c_#length| c_main_~end~0.base)) (= |c_main_#t~mem7.offset| (_ bv0 32)) (forall ((|main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base|) (bvadd |main_#t~mem6.offset| (_ bv4 32)) c_main_~end~0.offset)) c_main_~end~0.base) c_main_~end~0.offset))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (bvule c_main_~end~0.offset .cse1) (= (select |c_#length| |c_main_#t~mem7.base|) (_ bv12 32)) (exists ((|main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_main_~end~0.base) c_main_~end~0.offset)) (.cse4 (bvadd |main_#t~mem6.offset| (_ bv4 32)))) (and (= c_main_~end~0.base (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) c_main_~end~0.offset)))) (= (select |c_#length| .cse5) (_ bv12 32)) (not (= .cse5 c_main_~end~0.base)))) is different from false [2021-08-27 06:37:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:37:59,365 INFO L93 Difference]: Finished difference Result 182 states and 195 transitions. [2021-08-27 06:37:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-27 06:37:59,366 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 06:37:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:37:59,367 INFO L225 Difference]: With dead ends: 182 [2021-08-27 06:37:59,367 INFO L226 Difference]: Without dead ends: 182 [2021-08-27 06:37:59,368 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 47936.9ms TimeCoverageRelationStatistics Valid=308, Invalid=1105, Unknown=9, NotChecked=300, Total=1722 [2021-08-27 06:37:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-08-27 06:37:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 120. [2021-08-27 06:37:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.4) internal successors, (126), 116 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2021-08-27 06:37:59,371 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 19 [2021-08-27 06:37:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:37:59,371 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2021-08-27 06:37:59,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:37:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2021-08-27 06:37:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:37:59,372 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:37:59,373 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:37:59,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-27 06:37:59,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:37:59,581 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 60 more)] === [2021-08-27 06:37:59,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:37:59,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1944702492, now seen corresponding path program 1 times [2021-08-27 06:37:59,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:37:59,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589353286] [2021-08-27 06:37:59,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:37:59,582 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:37:59,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:37:59,583 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:37:59,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-27 06:37:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:37:59,849 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 06:37:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:37:59,942 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-27 06:37:59,942 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 06:37:59,943 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:37:59,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 06:37:59,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 06:37:59,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 06:37:59,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 06:37:59,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 06:37:59,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 06:37:59,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 06:37:59,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 06:37:59,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 06:37:59,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 06:37:59,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 06:37:59,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 06:37:59,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 06:37:59,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 06:37:59,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 06:37:59,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 06:37:59,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 06:37:59,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 06:37:59,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 06:37:59,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 06:37:59,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 06:37:59,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 06:37:59,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 06:37:59,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 06:37:59,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 06:37:59,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 06:37:59,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 06:37:59,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 06:37:59,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 06:37:59,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 06:37:59,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 06:37:59,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 06:37:59,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:37:59,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 06:37:59,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 06:37:59,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:37:59,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-08-27 06:37:59,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 06:37:59,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 06:37:59,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 06:37:59,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-08-27 06:37:59,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-08-27 06:37:59,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-08-27 06:37:59,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-08-27 06:37:59,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45REQUIRES_VIOLATION [2021-08-27 06:37:59,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-08-27 06:37:59,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-08-27 06:37:59,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48REQUIRES_VIOLATION [2021-08-27 06:37:59,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-08-27 06:37:59,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-08-27 06:37:59,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:37:59,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:37:59,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:37:59,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54REQUIRES_VIOLATION [2021-08-27 06:37:59,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-08-27 06:37:59,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:37:59,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:37:59,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:37:59,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION [2021-08-27 06:37:59,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-08-27 06:37:59,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:37:59,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:37:59,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:37:59,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:37:59,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-27 06:38:00,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:00,158 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:38:00,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:38:00 BoogieIcfgContainer [2021-08-27 06:38:00,185 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:38:00,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:38:00,186 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:38:00,186 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:38:00,187 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:36:24" (3/4) ... [2021-08-27 06:38:00,191 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:38:00,191 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:38:00,192 INFO L168 Benchmark]: Toolchain (without parser) took 97277.30 ms. Allocated memory was 58.7 MB in the beginning and 104.9 MB in the end (delta: 46.1 MB). Free memory was 35.9 MB in the beginning and 66.3 MB in the end (delta: -30.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 16.1 GB. [2021-08-27 06:38:00,192 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 58.7 MB. Free memory was 40.5 MB in the beginning and 40.5 MB in the end (delta: 42.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:38:00,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 494.46 ms. Allocated memory is still 58.7 MB. Free memory was 35.8 MB in the beginning and 37.8 MB in the end (delta: -2.0 MB). Peak memory consumption was 19.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:38:00,193 INFO L168 Benchmark]: Boogie Preprocessor took 103.41 ms. Allocated memory is still 58.7 MB. Free memory was 37.8 MB in the beginning and 34.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 06:38:00,196 INFO L168 Benchmark]: RCFGBuilder took 1193.74 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 34.4 MB in the beginning and 44.1 MB in the end (delta: -9.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. [2021-08-27 06:38:00,197 INFO L168 Benchmark]: TraceAbstraction took 95474.69 ms. Allocated memory was 71.3 MB in the beginning and 104.9 MB in the end (delta: 33.6 MB). Free memory was 43.7 MB in the beginning and 66.3 MB in the end (delta: -22.7 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. [2021-08-27 06:38:00,197 INFO L168 Benchmark]: Witness Printer took 4.95 ms. Allocated memory is still 104.9 MB. Free memory is still 66.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:38:00,198 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 58.7 MB. Free memory was 40.5 MB in the beginning and 40.5 MB in the end (delta: 42.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 494.46 ms. Allocated memory is still 58.7 MB. Free memory was 35.8 MB in the beginning and 37.8 MB in the end (delta: -2.0 MB). Peak memory consumption was 19.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 103.41 ms. Allocated memory is still 58.7 MB. Free memory was 37.8 MB in the beginning and 34.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1193.74 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 34.4 MB in the beginning and 44.1 MB in the end (delta: -9.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 95474.69 ms. Allocated memory was 71.3 MB in the beginning and 104.9 MB in the end (delta: 33.6 MB). Free memory was 43.7 MB in the beginning and 66.3 MB in the end (delta: -22.7 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. * Witness Printer took 4.95 ms. Allocated memory is still 104.9 MB. Free memory is still 66.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1051]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1051. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) VAL [list={1:0}] [L1007] list->prev = ((void*)0) VAL [list={1:0}] [L1008] list->colour = BLACK VAL [list={1:0}] [L1010] SLL* end = list; VAL [end={1:0}, list={1:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list VAL [end={1:0}, list={1:0}] [L1040] COND FALSE !(!(((void*)0) != end)) VAL [end={1:0}, list={1:0}] [L1041] EXPR end->colour VAL [end={1:0}, end->colour=1, list={1:0}] [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end VAL [end={1:0}, list={1:0}] [L1045] EXPR end->colour VAL [end={1:0}, end->colour=1, list={1:0}] [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next VAL [end={1:0}, end->next={0:0}, list={1:0}] [L1051] COND TRUE !(end->next) [L1051] reach_error() VAL [end={1:0}, list={1:0}] - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 150 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 95396.7ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 15.5ms, AutomataDifference: 70067.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 744 SDtfs, 1410 SDslu, 1621 SDs, 0 SdLazy, 2707 SolverSat, 185 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 13649.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 205 SyntacticMatches, 9 SemanticMatches, 101 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 71571.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=0, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 98.2ms AutomataMinimizationTime, 10 MinimizatonAttempts, 254 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 130.5ms SsaConstructionTime, 373.4ms SatisfiabilityAnalysisTime, 20666.0ms InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 254 ConstructedInterpolants, 20 QuantifiedInterpolants, 2202 SizeOfPredicates, 45 NumberOfNonLiveVariables, 900 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 06:38:00,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...