./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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-1.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 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:30:28,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:30:28,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:30:28,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:30:28,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:30:28,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:30:28,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:30:28,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:30:28,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:30:28,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:30:28,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:30:28,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:30:28,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:30:28,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:30:28,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:30:28,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:30:28,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:30:28,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:30:28,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:30:28,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:30:28,261 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:30:28,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:30:28,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:30:28,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:30:28,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:30:28,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:30:28,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:30:28,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:30:28,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:30:28,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:30:28,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:30:28,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:30:28,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:30:28,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:30:28,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:30:28,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:30:28,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:30:28,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:30:28,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:30:28,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:30:28,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:30:28,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:30:28,288 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:30:28,318 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:30:28,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:30:28,319 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:30:28,319 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:30:28,320 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:30:28,320 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:30:28,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:30:28,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:30:28,321 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:30:28,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:30:28,321 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:30:28,321 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:30:28,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:30:28,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:30:28,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:30:28,325 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:30:28,326 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:30:28,326 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:30:28,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:30:28,326 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:30:28,326 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:30:28,326 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:30:28,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:30:28,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:30:28,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:30:28,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:30:28,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:30:28,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:30:28,327 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:30:28,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:30:28,328 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2022-07-21 17:30:28,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:30:28,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:30:28,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:30:28,605 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:30:28,606 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:30:28,607 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-1.i [2022-07-21 17:30:28,694 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf6e8ea7d/44381bddb779414a873f42917ec90525/FLAGb0bf20936 [2022-07-21 17:30:29,092 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:30:29,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2022-07-21 17:30:29,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf6e8ea7d/44381bddb779414a873f42917ec90525/FLAGb0bf20936 [2022-07-21 17:30:29,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf6e8ea7d/44381bddb779414a873f42917ec90525 [2022-07-21 17:30:29,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:30:29,474 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:30:29,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:30:29,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:30:29,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:30:29,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:30:29" (1/1) ... [2022-07-21 17:30:29,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5291ce45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:30:29, skipping insertion in model container [2022-07-21 17:30:29,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:30:29" (1/1) ... [2022-07-21 17:30:29,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:30:29,536 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:30:29,785 WARN L230 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-1.i[22569,22582] [2022-07-21 17:30:29,790 WARN L230 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-1.i[22645,22658] [2022-07-21 17:30:29,791 WARN L230 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-1.i[22715,22728] [2022-07-21 17:30:29,792 WARN L230 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-1.i[22822,22835] [2022-07-21 17:30:29,793 WARN L230 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-1.i[22894,22907] [2022-07-21 17:30:29,795 WARN L230 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-1.i[23045,23058] [2022-07-21 17:30:29,796 WARN L230 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-1.i[23119,23132] [2022-07-21 17:30:29,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:30:29,810 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:30:29,843 WARN L230 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-1.i[22569,22582] [2022-07-21 17:30:29,845 WARN L230 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-1.i[22645,22658] [2022-07-21 17:30:29,846 WARN L230 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-1.i[22715,22728] [2022-07-21 17:30:29,848 WARN L230 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-1.i[22822,22835] [2022-07-21 17:30:29,851 WARN L230 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-1.i[22894,22907] [2022-07-21 17:30:29,853 WARN L230 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-1.i[23045,23058] [2022-07-21 17:30:29,853 WARN L230 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-1.i[23119,23132] [2022-07-21 17:30:29,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:30:29,878 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:30:29,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:30:29 WrapperNode [2022-07-21 17:30:29,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:30:29,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:30:29,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:30:29,879 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:30:29,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:30:29" (1/1) ... [2022-07-21 17:30:29,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:30:29" (1/1) ... [2022-07-21 17:30:29,931 INFO L137 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 159 [2022-07-21 17:30:29,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:30:29,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:30:29,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:30:29,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:30:29,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:30:29" (1/1) ... [2022-07-21 17:30:29,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:30:29" (1/1) ... [2022-07-21 17:30:29,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:30:29" (1/1) ... [2022-07-21 17:30:29,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:30:29" (1/1) ... [2022-07-21 17:30:29,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:30:29" (1/1) ... [2022-07-21 17:30:29,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:30:29" (1/1) ... [2022-07-21 17:30:29,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:30:29" (1/1) ... [2022-07-21 17:30:29,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:30:29,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:30:29,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:30:29,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:30:29,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:30:29" (1/1) ... [2022-07-21 17:30:29,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:30:29,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:30:30,015 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) [2022-07-21 17:30:30,038 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 [2022-07-21 17:30:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 17:30:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 17:30:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:30:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:30:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:30:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:30:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:30:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 17:30:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:30:30,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:30:30,160 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:30:30,161 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:30:30,464 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:30:30,469 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:30:30,470 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-07-21 17:30:30,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:30:30 BoogieIcfgContainer [2022-07-21 17:30:30,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:30:30,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:30:30,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:30:30,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:30:30,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:30:29" (1/3) ... [2022-07-21 17:30:30,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f74a692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:30:30, skipping insertion in model container [2022-07-21 17:30:30,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:30:29" (2/3) ... [2022-07-21 17:30:30,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f74a692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:30:30, skipping insertion in model container [2022-07-21 17:30:30,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:30:30" (3/3) ... [2022-07-21 17:30:30,477 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2022-07-21 17:30:30,487 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:30:30,487 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2022-07-21 17:30:30,515 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:30:30,520 INFO L357 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, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6ef52a3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@436dc5b4 [2022-07-21 17:30:30,520 INFO L358 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2022-07-21 17:30:30,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 84 states have (on average 2.2023809523809526) internal successors, (185), 155 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:30,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:30:30,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:30,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:30:30,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:30,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:30,531 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-21 17:30:30,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:30,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762000967] [2022-07-21 17:30:30,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:30,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:30,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:30,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762000967] [2022-07-21 17:30:30,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762000967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:30,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:30,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:30:30,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788321777] [2022-07-21 17:30:30,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:30,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:30:30,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:30,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:30:30,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:30:30,695 INFO L87 Difference]: Start difference. First operand has 156 states, 84 states have (on average 2.2023809523809526) internal successors, (185), 155 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:30,829 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2022-07-21 17:30:30,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:30:30,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-21 17:30:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:30,836 INFO L225 Difference]: With dead ends: 157 [2022-07-21 17:30:30,836 INFO L226 Difference]: Without dead ends: 153 [2022-07-21 17:30:30,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:30:30,840 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:30,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 95 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:30:30,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-21 17:30:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2022-07-21 17:30:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 85 states have (on average 1.8352941176470587) internal successors, (156), 148 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2022-07-21 17:30:30,871 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 3 [2022-07-21 17:30:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:30,872 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2022-07-21 17:30:30,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2022-07-21 17:30:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:30:30,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:30,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:30:30,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 17:30:30,873 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:30,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:30,874 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-21 17:30:30,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:30,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461052238] [2022-07-21 17:30:30,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:30,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:30,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:30,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:30,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461052238] [2022-07-21 17:30:30,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461052238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:30,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:30,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:30:30,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205358400] [2022-07-21 17:30:30,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:30,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:30:30,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:30,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:30:30,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:30:30,905 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:30,994 INFO L93 Difference]: Finished difference Result 166 states and 172 transitions. [2022-07-21 17:30:30,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:30:30,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-21 17:30:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:30,995 INFO L225 Difference]: With dead ends: 166 [2022-07-21 17:30:30,996 INFO L226 Difference]: Without dead ends: 166 [2022-07-21 17:30:30,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:30:30,997 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 131 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:30,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 100 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:30:30,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-21 17:30:31,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 153. [2022-07-21 17:30:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 92 states have (on average 1.7391304347826086) internal successors, (160), 152 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2022-07-21 17:30:31,004 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 3 [2022-07-21 17:30:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:31,004 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2022-07-21 17:30:31,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2022-07-21 17:30:31,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 17:30:31,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:31,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:31,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 17:30:31,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:31,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:31,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2022-07-21 17:30:31,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:31,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064830336] [2022-07-21 17:30:31,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:31,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:31,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:31,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064830336] [2022-07-21 17:30:31,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064830336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:31,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:31,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:30:31,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261030738] [2022-07-21 17:30:31,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:31,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:30:31,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:31,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:30:31,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:30:31,058 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:31,171 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2022-07-21 17:30:31,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:30:31,172 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-21 17:30:31,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:31,173 INFO L225 Difference]: With dead ends: 154 [2022-07-21 17:30:31,173 INFO L226 Difference]: Without dead ends: 154 [2022-07-21 17:30:31,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:30:31,174 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 214 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:31,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 77 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:30:31,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-21 17:30:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2022-07-21 17:30:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 94 states have (on average 1.5851063829787233) internal successors, (149), 139 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2022-07-21 17:30:31,179 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 9 [2022-07-21 17:30:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:31,180 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2022-07-21 17:30:31,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2022-07-21 17:30:31,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 17:30:31,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:31,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:31,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 17:30:31,181 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:31,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:31,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2022-07-21 17:30:31,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:31,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638252713] [2022-07-21 17:30:31,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:31,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:31,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:31,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638252713] [2022-07-21 17:30:31,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638252713] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:31,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:31,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:30:31,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980868882] [2022-07-21 17:30:31,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:31,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:30:31,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:31,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:30:31,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:30:31,273 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:31,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:31,494 INFO L93 Difference]: Finished difference Result 179 states and 189 transitions. [2022-07-21 17:30:31,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:30:31,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-21 17:30:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:31,495 INFO L225 Difference]: With dead ends: 179 [2022-07-21 17:30:31,495 INFO L226 Difference]: Without dead ends: 179 [2022-07-21 17:30:31,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:30:31,496 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 321 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:31,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 140 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:30:31,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-21 17:30:31,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2022-07-21 17:30:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 105 states have (on average 1.542857142857143) internal successors, (162), 149 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2022-07-21 17:30:31,501 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 9 [2022-07-21 17:30:31,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:31,502 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2022-07-21 17:30:31,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2022-07-21 17:30:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:30:31,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:31,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:31,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 17:30:31,503 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash 233166301, now seen corresponding path program 1 times [2022-07-21 17:30:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:31,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354522738] [2022-07-21 17:30:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:31,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:31,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:31,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354522738] [2022-07-21 17:30:31,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354522738] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:31,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:31,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:30:31,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725113739] [2022-07-21 17:30:31,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:31,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:30:31,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:31,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:30:31,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:30:31,544 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:31,656 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2022-07-21 17:30:31,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:30:31,657 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 17:30:31,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:31,658 INFO L225 Difference]: With dead ends: 164 [2022-07-21 17:30:31,658 INFO L226 Difference]: Without dead ends: 164 [2022-07-21 17:30:31,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:30:31,658 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 149 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:31,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 175 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:30:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-21 17:30:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2022-07-21 17:30:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 104 states have (on average 1.5192307692307692) internal successors, (158), 147 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2022-07-21 17:30:31,662 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 11 [2022-07-21 17:30:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:31,662 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2022-07-21 17:30:31,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2022-07-21 17:30:31,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 17:30:31,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:31,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:31,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 17:30:31,667 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:31,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:31,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-07-21 17:30:31,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:31,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206086133] [2022-07-21 17:30:31,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:31,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:31,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:31,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206086133] [2022-07-21 17:30:31,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206086133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:31,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:31,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:30:31,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641248572] [2022-07-21 17:30:31,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:31,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:30:31,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:31,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:30:31,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:30:31,735 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:31,874 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2022-07-21 17:30:31,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:30:31,875 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-21 17:30:31,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:31,875 INFO L225 Difference]: With dead ends: 147 [2022-07-21 17:30:31,876 INFO L226 Difference]: Without dead ends: 147 [2022-07-21 17:30:31,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:30:31,876 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 6 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:31,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 323 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:30:31,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-21 17:30:31,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2022-07-21 17:30:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 104 states have (on average 1.5) internal successors, (156), 146 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:31,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2022-07-21 17:30:31,887 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 12 [2022-07-21 17:30:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:31,887 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2022-07-21 17:30:31,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:31,888 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2022-07-21 17:30:31,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 17:30:31,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:31,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:31,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 17:30:31,888 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:31,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-07-21 17:30:31,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:31,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752144053] [2022-07-21 17:30:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:31,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:31,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:31,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752144053] [2022-07-21 17:30:31,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752144053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:31,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:31,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:30:31,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255335114] [2022-07-21 17:30:31,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:31,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:30:31,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:31,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:30:31,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:30:31,924 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:32,018 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-07-21 17:30:32,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:30:32,020 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-21 17:30:32,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:32,021 INFO L225 Difference]: With dead ends: 146 [2022-07-21 17:30:32,021 INFO L226 Difference]: Without dead ends: 146 [2022-07-21 17:30:32,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:30:32,021 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 7 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:32,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 338 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:30:32,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-21 17:30:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-07-21 17:30:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 104 states have (on average 1.4807692307692308) internal successors, (154), 145 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2022-07-21 17:30:32,024 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 12 [2022-07-21 17:30:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:32,024 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2022-07-21 17:30:32,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2022-07-21 17:30:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 17:30:32,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:32,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:32,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 17:30:32,025 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:32,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:32,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1299214142, now seen corresponding path program 1 times [2022-07-21 17:30:32,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:32,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16729837] [2022-07-21 17:30:32,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:32,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:32,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:32,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:32,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16729837] [2022-07-21 17:30:32,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16729837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:32,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:32,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:30:32,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061623895] [2022-07-21 17:30:32,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:32,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:30:32,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:32,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:30:32,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:30:32,072 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:32,266 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2022-07-21 17:30:32,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:30:32,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-21 17:30:32,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:32,268 INFO L225 Difference]: With dead ends: 200 [2022-07-21 17:30:32,268 INFO L226 Difference]: Without dead ends: 200 [2022-07-21 17:30:32,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:30:32,268 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 197 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:32,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 314 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:30:32,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-21 17:30:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 151. [2022-07-21 17:30:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 150 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2022-07-21 17:30:32,271 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 14 [2022-07-21 17:30:32,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:32,272 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2022-07-21 17:30:32,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:32,272 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2022-07-21 17:30:32,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 17:30:32,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:32,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:32,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 17:30:32,273 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:32,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:32,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-07-21 17:30:32,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:32,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846199427] [2022-07-21 17:30:32,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:32,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:32,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:32,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:32,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846199427] [2022-07-21 17:30:32,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846199427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:32,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:32,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:30:32,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494615971] [2022-07-21 17:30:32,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:32,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:30:32,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:32,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:30:32,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:30:32,346 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:32,629 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-07-21 17:30:32,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:30:32,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 17:30:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:32,630 INFO L225 Difference]: With dead ends: 150 [2022-07-21 17:30:32,630 INFO L226 Difference]: Without dead ends: 150 [2022-07-21 17:30:32,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:30:32,631 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 187 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:32,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 221 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:30:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-21 17:30:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-07-21 17:30:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 149 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2022-07-21 17:30:32,634 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 16 [2022-07-21 17:30:32,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:32,634 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2022-07-21 17:30:32,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-07-21 17:30:32,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 17:30:32,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:32,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:32,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 17:30:32,635 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:32,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-07-21 17:30:32,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:32,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687270981] [2022-07-21 17:30:32,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:32,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:32,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:32,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687270981] [2022-07-21 17:30:32,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687270981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:32,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:32,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:30:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676779461] [2022-07-21 17:30:32,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:32,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:30:32,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:32,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:30:32,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:30:32,789 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:33,312 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2022-07-21 17:30:33,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 17:30:33,312 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 17:30:33,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:33,313 INFO L225 Difference]: With dead ends: 168 [2022-07-21 17:30:33,313 INFO L226 Difference]: Without dead ends: 168 [2022-07-21 17:30:33,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-07-21 17:30:33,314 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 233 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:33,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 355 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:30:33,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-21 17:30:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 154. [2022-07-21 17:30:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 153 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2022-07-21 17:30:33,318 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 16 [2022-07-21 17:30:33,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:33,318 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2022-07-21 17:30:33,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:33,318 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2022-07-21 17:30:33,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 17:30:33,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:33,319 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:33,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 17:30:33,319 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:33,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:33,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1997554901, now seen corresponding path program 1 times [2022-07-21 17:30:33,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:33,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999186483] [2022-07-21 17:30:33,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:33,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:33,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:33,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999186483] [2022-07-21 17:30:33,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999186483] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:30:33,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174032207] [2022-07-21 17:30:33,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:33,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:30:33,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:30:33,401 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:30:33,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 17:30:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:33,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-21 17:30:33,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:30:33,512 INFO L390 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 [2022-07-21 17:30:33,516 INFO L390 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 [2022-07-21 17:30:33,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:30:33,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:30:33,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:30:33,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:30:33,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:30:33,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:30:33,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:30:33,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:30:33,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:30:33,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:30:33,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:30:33,687 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:30:33,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-07-21 17:30:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:33,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:30:39,149 INFO L390 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 18 [2022-07-21 17:30:39,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:30:39,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:30:39,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-21 17:30:39,160 INFO L390 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 18 [2022-07-21 17:30:39,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:30:39,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:30:39,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:30:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:39,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174032207] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:30:39,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:30:39,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 14 [2022-07-21 17:30:39,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955926953] [2022-07-21 17:30:39,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:30:39,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 17:30:39,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:39,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 17:30:39,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=142, Unknown=4, NotChecked=0, Total=182 [2022-07-21 17:30:39,179 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:39,456 INFO L93 Difference]: Finished difference Result 205 states and 221 transitions. [2022-07-21 17:30:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:30:39,457 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-21 17:30:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:39,457 INFO L225 Difference]: With dead ends: 205 [2022-07-21 17:30:39,458 INFO L226 Difference]: Without dead ends: 205 [2022-07-21 17:30:39,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=96, Invalid=280, Unknown=4, NotChecked=0, Total=380 [2022-07-21 17:30:39,458 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 343 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:39,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 579 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 331 Invalid, 0 Unknown, 110 Unchecked, 0.2s Time] [2022-07-21 17:30:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-21 17:30:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 161. [2022-07-21 17:30:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 126 states have (on average 1.380952380952381) internal successors, (174), 160 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2022-07-21 17:30:39,461 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 21 [2022-07-21 17:30:39,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:39,461 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2022-07-21 17:30:39,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:39,461 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2022-07-21 17:30:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 17:30:39,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:39,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:39,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 17:30:39,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-21 17:30:39,662 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:39,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:39,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2039573154, now seen corresponding path program 1 times [2022-07-21 17:30:39,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:39,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200308242] [2022-07-21 17:30:39,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:39,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:39,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200308242] [2022-07-21 17:30:39,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200308242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:39,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:39,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:30:39,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994581532] [2022-07-21 17:30:39,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:39,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:30:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:39,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:30:39,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:30:39,716 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:39,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:39,838 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2022-07-21 17:30:39,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:30:39,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-21 17:30:39,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:39,839 INFO L225 Difference]: With dead ends: 165 [2022-07-21 17:30:39,839 INFO L226 Difference]: Without dead ends: 165 [2022-07-21 17:30:39,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:30:39,840 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 25 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:39,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 328 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:30:39,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-21 17:30:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2022-07-21 17:30:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 125 states have (on average 1.368) internal successors, (171), 159 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2022-07-21 17:30:39,842 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 21 [2022-07-21 17:30:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:39,843 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2022-07-21 17:30:39,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2022-07-21 17:30:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:30:39,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:39,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:39,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 17:30:39,850 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:39,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:39,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1819127547, now seen corresponding path program 1 times [2022-07-21 17:30:39,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:39,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868384298] [2022-07-21 17:30:39,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:39,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:39,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:39,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:39,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868384298] [2022-07-21 17:30:39,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868384298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:39,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:39,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:30:39,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090936235] [2022-07-21 17:30:39,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:39,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:30:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:39,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:30:39,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:30:39,886 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:39,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:39,952 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2022-07-21 17:30:39,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:30:39,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-21 17:30:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:39,953 INFO L225 Difference]: With dead ends: 162 [2022-07-21 17:30:39,953 INFO L226 Difference]: Without dead ends: 162 [2022-07-21 17:30:39,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:30:39,957 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 20 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:39,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 279 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:30:39,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-21 17:30:39,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2022-07-21 17:30:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 124 states have (on average 1.3548387096774193) internal successors, (168), 157 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2022-07-21 17:30:39,960 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 22 [2022-07-21 17:30:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:39,960 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2022-07-21 17:30:39,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2022-07-21 17:30:39,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 17:30:39,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:39,962 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:30:39,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 17:30:39,962 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:39,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:39,962 INFO L85 PathProgramCache]: Analyzing trace with hash 391604008, now seen corresponding path program 1 times [2022-07-21 17:30:39,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:39,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721060411] [2022-07-21 17:30:39,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:39,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:40,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:40,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721060411] [2022-07-21 17:30:40,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721060411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:40,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:40,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:30:40,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626822381] [2022-07-21 17:30:40,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:40,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:30:40,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:40,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:30:40,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:30:40,019 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:40,112 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2022-07-21 17:30:40,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:30:40,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-21 17:30:40,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:40,113 INFO L225 Difference]: With dead ends: 157 [2022-07-21 17:30:40,113 INFO L226 Difference]: Without dead ends: 157 [2022-07-21 17:30:40,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:30:40,114 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 6 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:40,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 313 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:30:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-21 17:30:40,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-07-21 17:30:40,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 124 states have (on average 1.346774193548387) internal successors, (167), 156 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2022-07-21 17:30:40,118 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 24 [2022-07-21 17:30:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:40,118 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2022-07-21 17:30:40,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2022-07-21 17:30:40,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 17:30:40,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:40,119 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:30:40,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 17:30:40,120 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:40,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:40,120 INFO L85 PathProgramCache]: Analyzing trace with hash 391604009, now seen corresponding path program 1 times [2022-07-21 17:30:40,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:40,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375458294] [2022-07-21 17:30:40,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:40,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:40,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:40,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375458294] [2022-07-21 17:30:40,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375458294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:40,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:40,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:30:40,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040995266] [2022-07-21 17:30:40,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:40,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:30:40,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:40,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:30:40,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:30:40,188 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:40,299 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2022-07-21 17:30:40,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:30:40,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-21 17:30:40,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:40,300 INFO L225 Difference]: With dead ends: 156 [2022-07-21 17:30:40,300 INFO L226 Difference]: Without dead ends: 156 [2022-07-21 17:30:40,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:30:40,300 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:40,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 303 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:30:40,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-21 17:30:40,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-07-21 17:30:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 155 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2022-07-21 17:30:40,303 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 24 [2022-07-21 17:30:40,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:40,303 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2022-07-21 17:30:40,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,303 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2022-07-21 17:30:40,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:30:40,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:40,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:40,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 17:30:40,303 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:40,304 INFO L85 PathProgramCache]: Analyzing trace with hash -264588155, now seen corresponding path program 1 times [2022-07-21 17:30:40,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:40,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619412432] [2022-07-21 17:30:40,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:40,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:40,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:40,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619412432] [2022-07-21 17:30:40,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619412432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:40,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:40,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:30:40,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513686662] [2022-07-21 17:30:40,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:40,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:30:40,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:40,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:30:40,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:30:40,370 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:40,439 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2022-07-21 17:30:40,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:30:40,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-21 17:30:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:40,440 INFO L225 Difference]: With dead ends: 155 [2022-07-21 17:30:40,440 INFO L226 Difference]: Without dead ends: 155 [2022-07-21 17:30:40,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:30:40,441 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 15 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:40,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 255 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:30:40,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-21 17:30:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2022-07-21 17:30:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 123 states have (on average 1.3252032520325203) internal successors, (163), 153 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 163 transitions. [2022-07-21 17:30:40,443 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 163 transitions. Word has length 25 [2022-07-21 17:30:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:40,443 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 163 transitions. [2022-07-21 17:30:40,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 163 transitions. [2022-07-21 17:30:40,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 17:30:40,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:40,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:40,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 17:30:40,444 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:40,444 INFO L85 PathProgramCache]: Analyzing trace with hash 201988172, now seen corresponding path program 1 times [2022-07-21 17:30:40,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:40,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023849903] [2022-07-21 17:30:40,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:40,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:40,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:30:40,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:40,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023849903] [2022-07-21 17:30:40,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023849903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:40,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:40,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:30:40,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774156537] [2022-07-21 17:30:40,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:40,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:30:40,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:40,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:30:40,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:30:40,463 INFO L87 Difference]: Start difference. First operand 154 states and 163 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:40,488 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2022-07-21 17:30:40,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:30:40,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-21 17:30:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:40,489 INFO L225 Difference]: With dead ends: 156 [2022-07-21 17:30:40,489 INFO L226 Difference]: Without dead ends: 156 [2022-07-21 17:30:40,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:30:40,490 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 72 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:40,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 114 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:30:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-21 17:30:40,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-07-21 17:30:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 125 states have (on average 1.32) internal successors, (165), 155 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2022-07-21 17:30:40,492 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 27 [2022-07-21 17:30:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:40,492 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2022-07-21 17:30:40,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2022-07-21 17:30:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 17:30:40,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:40,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:40,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 17:30:40,493 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:40,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash -866016759, now seen corresponding path program 1 times [2022-07-21 17:30:40,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:40,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177113606] [2022-07-21 17:30:40,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:40,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:40,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177113606] [2022-07-21 17:30:40,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177113606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:40,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:40,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:30:40,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986111135] [2022-07-21 17:30:40,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:40,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:30:40,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:40,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:30:40,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:30:40,532 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:40,630 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2022-07-21 17:30:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:30:40,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-21 17:30:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:40,631 INFO L225 Difference]: With dead ends: 169 [2022-07-21 17:30:40,631 INFO L226 Difference]: Without dead ends: 169 [2022-07-21 17:30:40,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:30:40,631 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 163 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:40,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 172 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:30:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-21 17:30:40,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2022-07-21 17:30:40,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 153 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2022-07-21 17:30:40,633 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 27 [2022-07-21 17:30:40,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:40,634 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2022-07-21 17:30:40,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,634 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2022-07-21 17:30:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 17:30:40,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:40,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:40,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 17:30:40,634 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:40,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:40,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1099927530, now seen corresponding path program 1 times [2022-07-21 17:30:40,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:40,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214632960] [2022-07-21 17:30:40,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:40,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:40,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:40,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214632960] [2022-07-21 17:30:40,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214632960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:40,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:40,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:30:40,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488685541] [2022-07-21 17:30:40,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:40,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:30:40,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:40,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:30:40,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:30:40,702 INFO L87 Difference]: Start difference. First operand 154 states and 162 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:40,857 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2022-07-21 17:30:40,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:30:40,857 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-21 17:30:40,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:40,858 INFO L225 Difference]: With dead ends: 154 [2022-07-21 17:30:40,858 INFO L226 Difference]: Without dead ends: 154 [2022-07-21 17:30:40,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:30:40,859 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 59 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:40,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 260 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:30:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-21 17:30:40,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2022-07-21 17:30:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 152 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 161 transitions. [2022-07-21 17:30:40,860 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 161 transitions. Word has length 28 [2022-07-21 17:30:40,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:40,861 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 161 transitions. [2022-07-21 17:30:40,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2022-07-21 17:30:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 17:30:40,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:40,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:40,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 17:30:40,861 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:40,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:40,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1099927531, now seen corresponding path program 1 times [2022-07-21 17:30:40,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:40,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585507693] [2022-07-21 17:30:40,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:40,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:40,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:40,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585507693] [2022-07-21 17:30:40,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585507693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:40,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:30:40,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:30:40,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850804602] [2022-07-21 17:30:40,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:40,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:30:40,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:40,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:30:40,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:30:40,951 INFO L87 Difference]: Start difference. First operand 153 states and 161 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:41,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:41,186 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2022-07-21 17:30:41,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:30:41,187 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-21 17:30:41,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:41,187 INFO L225 Difference]: With dead ends: 149 [2022-07-21 17:30:41,187 INFO L226 Difference]: Without dead ends: 149 [2022-07-21 17:30:41,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:30:41,188 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 69 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:41,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 400 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:30:41,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-21 17:30:41,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 130. [2022-07-21 17:30:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.2685185185185186) internal successors, (137), 129 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2022-07-21 17:30:41,190 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 28 [2022-07-21 17:30:41,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:41,190 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2022-07-21 17:30:41,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-07-21 17:30:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 17:30:41,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:41,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:41,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 17:30:41,191 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:41,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2136034553, now seen corresponding path program 1 times [2022-07-21 17:30:41,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:41,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454500434] [2022-07-21 17:30:41,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:41,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:41,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:41,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454500434] [2022-07-21 17:30:41,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454500434] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:30:41,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203416185] [2022-07-21 17:30:41,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:41,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:30:41,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:30:41,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:30:41,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 17:30:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:41,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:30:41,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:30:41,351 INFO L390 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 [2022-07-21 17:30:41,371 INFO L390 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 [2022-07-21 17:30:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:30:41,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:30:41,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203416185] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:30:41,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:30:41,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-21 17:30:41,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722051908] [2022-07-21 17:30:41,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:30:41,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:30:41,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:41,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:30:41,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:30:41,380 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:41,430 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2022-07-21 17:30:41,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:30:41,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-21 17:30:41,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:41,431 INFO L225 Difference]: With dead ends: 139 [2022-07-21 17:30:41,431 INFO L226 Difference]: Without dead ends: 139 [2022-07-21 17:30:41,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:30:41,432 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 6 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:41,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 252 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:30:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-21 17:30:41,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2022-07-21 17:30:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.2612612612612613) internal successors, (140), 132 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2022-07-21 17:30:41,433 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 29 [2022-07-21 17:30:41,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:41,434 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2022-07-21 17:30:41,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:41,434 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2022-07-21 17:30:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 17:30:41,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:41,434 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:41,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 17:30:41,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-21 17:30:41,650 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:41,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:41,650 INFO L85 PathProgramCache]: Analyzing trace with hash 180762931, now seen corresponding path program 1 times [2022-07-21 17:30:41,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:41,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149722074] [2022-07-21 17:30:41,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:41,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:41,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:41,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149722074] [2022-07-21 17:30:41,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149722074] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:30:41,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263160965] [2022-07-21 17:30:41,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:41,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:30:41,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:30:41,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:30:41,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 17:30:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:41,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-21 17:30:41,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:30:41,842 INFO L390 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 [2022-07-21 17:30:41,845 INFO L390 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 [2022-07-21 17:30:41,857 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 17:30:41,857 INFO L390 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 21 treesize of output 20 [2022-07-21 17:30:41,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:30:41,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:30:41,884 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 17:30:41,885 INFO L390 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 21 treesize of output 20 [2022-07-21 17:30:41,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:30:41,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:30:41,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:30:41,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:30:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:30:41,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:30:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:30:42,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263160965] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:30:42,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:30:42,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2022-07-21 17:30:42,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069940491] [2022-07-21 17:30:42,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:30:42,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:30:42,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:42,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:30:42,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:30:42,023 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:42,331 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2022-07-21 17:30:42,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 17:30:42,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-21 17:30:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:42,334 INFO L225 Difference]: With dead ends: 181 [2022-07-21 17:30:42,334 INFO L226 Difference]: Without dead ends: 181 [2022-07-21 17:30:42,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:30:42,334 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 78 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:42,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 468 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:30:42,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-21 17:30:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 144. [2022-07-21 17:30:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 143 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2022-07-21 17:30:42,336 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 30 [2022-07-21 17:30:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:42,336 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2022-07-21 17:30:42,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2022-07-21 17:30:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 17:30:42,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:42,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:42,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 17:30:42,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:30:42,547 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:42,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1308683207, now seen corresponding path program 1 times [2022-07-21 17:30:42,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:42,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636591058] [2022-07-21 17:30:42,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:42,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:30:42,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:42,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636591058] [2022-07-21 17:30:42,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636591058] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:30:42,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349262584] [2022-07-21 17:30:42,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:42,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:30:42,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:30:42,585 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:30:42,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 17:30:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:42,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 17:30:42,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:30:42,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 17:30:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:30:42,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:30:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:30:42,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349262584] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:30:42,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:30:42,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-07-21 17:30:42,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303491065] [2022-07-21 17:30:42,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:30:42,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:30:42,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:42,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:30:42,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:30:42,781 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:42,830 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2022-07-21 17:30:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:30:42,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-21 17:30:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:42,831 INFO L225 Difference]: With dead ends: 152 [2022-07-21 17:30:42,831 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 17:30:42,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:30:42,831 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:42,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 44 Unchecked, 0.0s Time] [2022-07-21 17:30:42,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 17:30:42,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-21 17:30:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.280373831775701) internal successors, (137), 128 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2022-07-21 17:30:42,833 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 31 [2022-07-21 17:30:42,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:42,833 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2022-07-21 17:30:42,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:42,833 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2022-07-21 17:30:42,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 17:30:42,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:42,833 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:42,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 17:30:43,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:30:43,043 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:43,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:43,044 INFO L85 PathProgramCache]: Analyzing trace with hash 929038273, now seen corresponding path program 1 times [2022-07-21 17:30:43,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:43,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232706292] [2022-07-21 17:30:43,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:43,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:43,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:43,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232706292] [2022-07-21 17:30:43,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232706292] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:30:43,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942010858] [2022-07-21 17:30:43,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:43,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:30:43,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:30:43,281 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:30:43,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 17:30:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:43,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-21 17:30:43,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:30:43,389 INFO L390 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 [2022-07-21 17:30:43,397 INFO L390 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 [2022-07-21 17:30:43,448 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:30:43,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:30:43,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:30:43,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:30:43,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:30:43,543 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:30:43,543 INFO L390 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 29 treesize of output 30 [2022-07-21 17:30:43,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 17:30:43,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 17:30:43,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:30:43,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:30:43,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:30:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:43,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:30:43,711 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2022-07-21 17:30:43,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-21 17:30:43,723 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2022-07-21 17:30:43,732 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_915 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_913) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_912) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2022-07-21 17:30:43,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_915 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_913) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_912) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_915)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-21 17:30:43,748 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:30:43,749 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-21 17:30:43,751 INFO L390 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 70 treesize of output 62 [2022-07-21 17:30:43,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-07-21 17:30:43,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_908 Int) (v_ArrVal_913 (Array Int Int)) (v_arrayElimCell_28 Int) (v_ArrVal_915 (Array Int Int))) (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_908))) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (or (and (not .cse0) (= ~unnamed1~0~BLACK (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (and .cse0 (= ~unnamed1~0~BLACK (select (select (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_913) v_arrayElimCell_28 v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)))))) is different from false [2022-07-21 17:30:44,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:30:44,467 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:30:44,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 55 [2022-07-21 17:30:44,474 INFO L390 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 101 treesize of output 83 [2022-07-21 17:30:44,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-21 17:30:44,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:30:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:44,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942010858] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:30:44,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:30:44,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 26 [2022-07-21 17:30:44,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031838941] [2022-07-21 17:30:44,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:30:44,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 17:30:44,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:44,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 17:30:44,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=305, Unknown=9, NotChecked=246, Total=650 [2022-07-21 17:30:44,510 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:45,082 INFO L93 Difference]: Finished difference Result 221 states and 236 transitions. [2022-07-21 17:30:45,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 17:30:45,082 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-21 17:30:45,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:45,084 INFO L225 Difference]: With dead ends: 221 [2022-07-21 17:30:45,084 INFO L226 Difference]: Without dead ends: 221 [2022-07-21 17:30:45,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=691, Unknown=9, NotChecked=378, Total=1332 [2022-07-21 17:30:45,085 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 515 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1158 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:45,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 524 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 609 Invalid, 0 Unknown, 1158 Unchecked, 0.3s Time] [2022-07-21 17:30:45,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-21 17:30:45,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 155. [2022-07-21 17:30:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.2406015037593985) internal successors, (165), 154 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2022-07-21 17:30:45,088 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 35 [2022-07-21 17:30:45,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:45,088 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2022-07-21 17:30:45,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2022-07-21 17:30:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:30:45,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:45,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:45,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 17:30:45,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-21 17:30:45,306 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:45,306 INFO L85 PathProgramCache]: Analyzing trace with hash 899162440, now seen corresponding path program 1 times [2022-07-21 17:30:45,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:45,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266872234] [2022-07-21 17:30:45,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:45,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:45,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:45,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266872234] [2022-07-21 17:30:45,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266872234] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:30:45,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166813387] [2022-07-21 17:30:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:45,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:30:45,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:30:45,456 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:30:45,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 17:30:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:45,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-21 17:30:45,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:30:45,555 INFO L390 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 [2022-07-21 17:30:45,608 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:30:45,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:30:45,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:30:45,709 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:30:45,709 INFO L390 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 28 treesize of output 29 [2022-07-21 17:30:45,771 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:30:45,771 INFO L390 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 31 treesize of output 29 [2022-07-21 17:30:45,812 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:30:45,812 INFO L390 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 28 treesize of output 29 [2022-07-21 17:30:45,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:30:45,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 17:30:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:46,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:30:46,424 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:30:46,424 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-07-21 17:30:46,431 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:30:46,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2022-07-21 17:30:46,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 204 [2022-07-21 17:30:46,445 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:30:46,446 INFO L390 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 204 treesize of output 196 [2022-07-21 17:30:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:53,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166813387] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:30:53,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:30:53,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 33 [2022-07-21 17:30:53,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188726019] [2022-07-21 17:30:53,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:30:53,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-21 17:30:53,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:53,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-21 17:30:53,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=942, Unknown=19, NotChecked=0, Total=1122 [2022-07-21 17:30:53,965 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand has 34 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 34 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:54,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:30:54,522 INFO L93 Difference]: Finished difference Result 231 states and 246 transitions. [2022-07-21 17:30:54,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 17:30:54,522 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 34 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-21 17:30:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:30:54,523 INFO L225 Difference]: With dead ends: 231 [2022-07-21 17:30:54,523 INFO L226 Difference]: Without dead ends: 231 [2022-07-21 17:30:54,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=282, Invalid=1339, Unknown=19, NotChecked=0, Total=1640 [2022-07-21 17:30:54,524 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 493 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 907 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:30:54,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 751 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 847 Invalid, 0 Unknown, 907 Unchecked, 0.4s Time] [2022-07-21 17:30:54,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-21 17:30:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 163. [2022-07-21 17:30:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 162 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2022-07-21 17:30:54,526 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 42 [2022-07-21 17:30:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:30:54,526 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2022-07-21 17:30:54,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 34 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:30:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2022-07-21 17:30:54,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:30:54,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:30:54,527 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:30:54,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-21 17:30:54,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:30:54,728 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:30:54,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:30:54,728 INFO L85 PathProgramCache]: Analyzing trace with hash 899162441, now seen corresponding path program 1 times [2022-07-21 17:30:54,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:30:54,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138421728] [2022-07-21 17:30:54,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:54,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:30:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:54,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:30:54,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138421728] [2022-07-21 17:30:54,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138421728] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:30:54,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144706767] [2022-07-21 17:30:54,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:30:54,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:30:54,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:30:54,899 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:30:54,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 17:30:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:30:54,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-21 17:30:55,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:30:55,010 INFO L390 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 [2022-07-21 17:30:55,055 INFO L390 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 [2022-07-21 17:30:55,062 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:30:55,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:30:55,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:30:55,088 INFO L390 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 [2022-07-21 17:30:55,155 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:30:55,155 INFO L390 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 38 treesize of output 37 [2022-07-21 17:30:55,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 17:30:55,234 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:30:55,234 INFO L390 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 14 treesize of output 20 [2022-07-21 17:30:55,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:30:55,257 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:30:55,260 INFO L390 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 31 treesize of output 29 [2022-07-21 17:30:55,305 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:30:55,305 INFO L390 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 38 treesize of output 37 [2022-07-21 17:30:55,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 17:30:55,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:30:55,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:30:55,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:30:55,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:30:55,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-07-21 17:30:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:55,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:30:55,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_86| Int)) (or (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_86|))) (and (<= (+ .cse0 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_86|))) (<= 0 (+ .cse0 8)))) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_86| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-21 17:30:56,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_86| Int) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (or (and (forall ((v_ArrVal_1118 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1114) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1113) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1118) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_86|) 8))) (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1117 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1113))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1114) .cse0 v_ArrVal_1118) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_86|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1117) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_86|))))))) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_86| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-21 17:30:56,237 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:30:56,237 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-21 17:30:56,242 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:30:56,243 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-07-21 17:30:56,246 INFO L390 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 54 treesize of output 46 [2022-07-21 17:30:56,253 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:30:56,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 181 [2022-07-21 17:30:56,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 156 [2022-07-21 17:30:56,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 126 [2022-07-21 17:30:56,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2022-07-21 17:30:56,369 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:30:56,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-07-21 17:30:56,374 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:30:56,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-07-21 17:30:56,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:30:56,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:30:56,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2022-07-21 17:30:56,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:30:56,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-07-21 17:30:56,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-07-21 17:30:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:30:56,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144706767] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:30:56,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:30:56,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 36 [2022-07-21 17:30:56,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105874003] [2022-07-21 17:30:56,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:30:56,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-21 17:30:56,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:30:56,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-21 17:30:56,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1061, Unknown=19, NotChecked=134, Total=1332 [2022-07-21 17:30:56,599 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand has 37 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 37 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:02,287 INFO L93 Difference]: Finished difference Result 227 states and 243 transitions. [2022-07-21 17:31:02,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 17:31:02,288 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 37 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-21 17:31:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:02,288 INFO L225 Difference]: With dead ends: 227 [2022-07-21 17:31:02,288 INFO L226 Difference]: Without dead ends: 227 [2022-07-21 17:31:02,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=382, Invalid=2469, Unknown=19, NotChecked=210, Total=3080 [2022-07-21 17:31:02,290 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 432 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 830 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:02,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 790 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 884 Invalid, 0 Unknown, 830 Unchecked, 0.4s Time] [2022-07-21 17:31:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-21 17:31:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 166. [2022-07-21 17:31:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 165 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 178 transitions. [2022-07-21 17:31:02,292 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 178 transitions. Word has length 42 [2022-07-21 17:31:02,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:02,292 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 178 transitions. [2022-07-21 17:31:02,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 37 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2022-07-21 17:31:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 17:31:02,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:02,293 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:02,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:02,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:31:02,493 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:02,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:02,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1421280140, now seen corresponding path program 1 times [2022-07-21 17:31:02,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:31:02,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697827812] [2022-07-21 17:31:02,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:02,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:31:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:02,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:31:02,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697827812] [2022-07-21 17:31:02,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697827812] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:31:02,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426444033] [2022-07-21 17:31:02,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:02,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:31:02,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:31:02,894 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:31:02,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 17:31:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:03,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-21 17:31:03,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:03,018 INFO L390 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 [2022-07-21 17:31:03,027 INFO L390 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 [2022-07-21 17:31:03,080 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:31:03,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:31:03,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:31:03,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:31:03,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:31:03,219 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:31:03,219 INFO L390 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 29 treesize of output 30 [2022-07-21 17:31:03,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 17:31:03,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 17:31:03,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:31:03,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:31:03,286 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 17:31:03,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:31:03,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:31:03,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-07-21 17:31:03,350 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:31:03,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-07-21 17:31:03,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 17:31:03,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-21 17:31:03,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:31:03,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:31:03,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:31:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:03,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:31:03,483 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-21 17:31:03,488 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-21 17:31:03,491 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2022-07-21 17:31:03,496 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1277 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1278) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1277) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2022-07-21 17:31:03,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1277 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1278) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1277) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1280)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-21 17:31:03,507 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:31:03,508 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-21 17:31:03,509 INFO L390 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 60 treesize of output 52 [2022-07-21 17:31:03,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-07-21 17:31:03,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_83 Int) (v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1274 (Array Int Int))) (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1274)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (or (and (not .cse0) (= ~unnamed1~0~BLACK (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (and .cse0 (= ~unnamed1~0~BLACK (select (select (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1278) v_arrayElimCell_83 v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)))))) is different from false [2022-07-21 17:31:03,783 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_11| Int) (v_ArrVal_1274 (Array Int Int))) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| |c_ULTIMATE.start_main_~end~0#1.base|))) (or (and (forall ((v_arrayElimCell_83 Int) (v_ArrVal_1278 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1274) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1278) v_arrayElimCell_83 v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) .cse0) (and (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1274) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (not .cse0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_11|) 0))))) is different from false [2022-07-21 17:31:04,206 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:31:04,206 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2022-07-21 17:31:04,210 INFO L390 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 104 treesize of output 92 [2022-07-21 17:31:04,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2022-07-21 17:31:04,268 INFO L356 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-07-21 17:31:04,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2022-07-21 17:31:04,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_arrayElimCell_85 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_11| Int) (v_ArrVal_1269 Int) (v_ArrVal_1274 (Array Int Int))) (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| |c_ULTIMATE.start_main_~end~0#1.base|) (and .cse0 (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_arrayElimCell_85)) (and .cse0 (forall ((v_ArrVal_1270 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1269)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1270) v_arrayElimCell_85 v_ArrVal_1274) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))) (and (not .cse0) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1269)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1274) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))))) is different from false [2022-07-21 17:31:09,181 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_93| Int) (v_ArrVal_1280 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_17| Int) (v_arrayElimCell_85 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_11| Int) (v_ArrVal_1269 Int) (v_ArrVal_1274 (Array Int Int))) (let ((.cse0 (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_17|))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_17|) 0)) (and (forall ((v_ArrVal_1270 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_93| v_ArrVal_1269)) |v_ULTIMATE.start_main_#t~malloc3#1.base_17| v_ArrVal_1270) v_arrayElimCell_85 v_ArrVal_1274) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) .cse0) (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_arrayElimCell_85) .cse0) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| |v_ULTIMATE.start_main_#t~malloc3#1.base_17|) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_93| |c_ULTIMATE.start_main_~list~0#1.offset|)) (and (not .cse0) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_93| v_ArrVal_1269)) |v_ULTIMATE.start_main_#t~malloc3#1.base_17| v_ArrVal_1274) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))))) is different from false [2022-07-21 17:31:09,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:31:09,193 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:31:09,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 61 [2022-07-21 17:31:09,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:31:09,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 147 [2022-07-21 17:31:09,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-21 17:31:09,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-07-21 17:31:09,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:09,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426444033] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:31:09,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:31:09,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 22] total 46 [2022-07-21 17:31:09,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134731535] [2022-07-21 17:31:09,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:31:09,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-21 17:31:09,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:31:09,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-21 17:31:09,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1108, Unknown=21, NotChecked=702, Total=2070 [2022-07-21 17:31:09,269 INFO L87 Difference]: Start difference. First operand 166 states and 178 transitions. Second operand has 46 states, 46 states have (on average 2.282608695652174) internal successors, (105), 46 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:10,228 INFO L93 Difference]: Finished difference Result 425 states and 457 transitions. [2022-07-21 17:31:10,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-21 17:31:10,228 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.282608695652174) internal successors, (105), 46 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-21 17:31:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:10,230 INFO L225 Difference]: With dead ends: 425 [2022-07-21 17:31:10,231 INFO L226 Difference]: Without dead ends: 425 [2022-07-21 17:31:10,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 70 SyntacticMatches, 10 SemanticMatches, 61 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=516, Invalid=2361, Unknown=21, NotChecked=1008, Total=3906 [2022-07-21 17:31:10,233 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 493 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 4476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3357 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:10,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1016 Invalid, 4476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1021 Invalid, 0 Unknown, 3357 Unchecked, 0.5s Time] [2022-07-21 17:31:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-07-21 17:31:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 192. [2022-07-21 17:31:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 170 states have (on average 1.2058823529411764) internal successors, (205), 191 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2022-07-21 17:31:10,262 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 45 [2022-07-21 17:31:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:10,262 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2022-07-21 17:31:10,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.282608695652174) internal successors, (105), 46 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2022-07-21 17:31:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 17:31:10,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:10,263 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:10,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:10,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-21 17:31:10,480 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:10,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:10,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1605357382, now seen corresponding path program 2 times [2022-07-21 17:31:10,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:31:10,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979901969] [2022-07-21 17:31:10,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:10,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:31:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:10,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:31:10,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979901969] [2022-07-21 17:31:10,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979901969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:31:10,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382519970] [2022-07-21 17:31:10,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:31:10,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:31:10,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:31:10,719 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:31:10,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 17:31:10,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:31:10,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:31:10,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-21 17:31:10,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:10,998 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-21 17:31:10,999 INFO L390 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 19 treesize of output 26 [2022-07-21 17:31:11,010 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-21 17:31:11,011 INFO L390 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 19 treesize of output 26 [2022-07-21 17:31:11,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:31:11,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-21 17:31:11,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:31:11,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-21 17:31:11,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:31:11,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:31:11,522 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-07-21 17:31:11,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 64 [2022-07-21 17:31:11,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:31:11,531 INFO L356 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2022-07-21 17:31:11,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 40 [2022-07-21 17:31:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:11,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:31:15,084 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:31:15,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 4247 treesize of output 3133 [2022-07-21 17:31:15,570 INFO L356 Elim1Store]: treesize reduction 198, result has 64.1 percent of original size [2022-07-21 17:31:15,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 10208 treesize of output 7189 [2022-07-21 17:31:15,945 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 17:31:15,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:16,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-21 17:31:16,162 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:545) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:348) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 17:31:16,164 INFO L158 Benchmark]: Toolchain (without parser) took 46690.59ms. Allocated memory was 58.7MB in the beginning and 285.2MB in the end (delta: 226.5MB). Free memory was 37.8MB in the beginning and 247.8MB in the end (delta: -210.0MB). Peak memory consumption was 176.1MB. Max. memory is 16.1GB. [2022-07-21 17:31:16,165 INFO L158 Benchmark]: CDTParser took 4.14ms. Allocated memory is still 58.7MB. Free memory was 40.5MB in the beginning and 40.4MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:31:16,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.23ms. Allocated memory is still 58.7MB. Free memory was 37.6MB in the beginning and 33.5MB in the end (delta: 4.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 17:31:16,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.25ms. Allocated memory is still 58.7MB. Free memory was 33.3MB in the beginning and 31.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:31:16,165 INFO L158 Benchmark]: Boogie Preprocessor took 47.50ms. Allocated memory is still 58.7MB. Free memory was 31.3MB in the beginning and 29.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:31:16,165 INFO L158 Benchmark]: RCFGBuilder took 491.43ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 29.4MB in the beginning and 43.7MB in the end (delta: -14.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 17:31:16,166 INFO L158 Benchmark]: TraceAbstraction took 45691.29ms. Allocated memory was 77.6MB in the beginning and 285.2MB in the end (delta: 207.6MB). Free memory was 43.0MB in the beginning and 247.8MB in the end (delta: -204.9MB). Peak memory consumption was 162.5MB. Max. memory is 16.1GB. [2022-07-21 17:31:16,168 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.14ms. Allocated memory is still 58.7MB. Free memory was 40.5MB in the beginning and 40.4MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.23ms. Allocated memory is still 58.7MB. Free memory was 37.6MB in the beginning and 33.5MB in the end (delta: 4.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.25ms. Allocated memory is still 58.7MB. Free memory was 33.3MB in the beginning and 31.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.50ms. Allocated memory is still 58.7MB. Free memory was 31.3MB in the beginning and 29.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 491.43ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 29.4MB in the beginning and 43.7MB in the end (delta: -14.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 45691.29ms. Allocated memory was 77.6MB in the beginning and 285.2MB in the end (delta: 207.6MB). Free memory was 43.0MB in the beginning and 247.8MB in the end (delta: -204.9MB). Peak memory consumption was 162.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 17:31:16,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-1.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 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:31:17,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:31:17,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:31:17,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:31:17,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:31:17,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:31:17,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:31:17,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:31:17,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:31:17,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:31:17,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:31:17,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:31:17,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:31:17,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:31:17,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:31:17,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:31:17,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:31:17,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:31:17,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:31:17,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:31:17,828 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:31:17,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:31:17,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:31:17,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:31:17,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:31:17,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:31:17,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:31:17,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:31:17,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:31:17,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:31:17,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:31:17,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:31:17,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:31:17,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:31:17,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:31:17,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:31:17,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:31:17,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:31:17,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:31:17,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:31:17,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:31:17,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:31:17,858 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-21 17:31:17,875 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:31:17,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:31:17,876 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:31:17,876 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:31:17,876 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:31:17,877 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:31:17,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:31:17,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:31:17,877 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:31:17,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:31:17,878 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:31:17,878 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:31:17,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:31:17,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:31:17,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:31:17,878 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:31:17,878 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:31:17,879 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:31:17,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:31:17,879 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:31:17,879 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 17:31:17,879 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 17:31:17,879 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:31:17,879 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:31:17,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:31:17,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:31:17,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:31:17,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:31:17,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:31:17,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:31:17,880 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 17:31:17,880 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 17:31:17,880 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 17:31:17,880 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2022-07-21 17:31:18,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:31:18,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:31:18,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:31:18,300 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:31:18,301 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:31:18,302 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-1.i [2022-07-21 17:31:18,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7487c38/860d9395ab0642d69d8f8c77af257fdc/FLAG1d73ba244 [2022-07-21 17:31:18,744 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:31:18,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2022-07-21 17:31:18,754 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7487c38/860d9395ab0642d69d8f8c77af257fdc/FLAG1d73ba244 [2022-07-21 17:31:18,764 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7487c38/860d9395ab0642d69d8f8c77af257fdc [2022-07-21 17:31:18,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:31:18,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:31:18,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:31:18,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:31:18,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:31:18,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:31:18" (1/1) ... [2022-07-21 17:31:18,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e58b39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:31:18, skipping insertion in model container [2022-07-21 17:31:18,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:31:18" (1/1) ... [2022-07-21 17:31:18,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:31:18,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:31:19,009 WARN L230 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-1.i[22569,22582] [2022-07-21 17:31:19,012 WARN L230 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-1.i[22645,22658] [2022-07-21 17:31:19,013 WARN L230 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-1.i[22715,22728] [2022-07-21 17:31:19,015 WARN L230 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-1.i[22822,22835] [2022-07-21 17:31:19,016 WARN L230 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-1.i[22894,22907] [2022-07-21 17:31:19,018 WARN L230 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-1.i[23045,23058] [2022-07-21 17:31:19,019 WARN L230 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-1.i[23119,23132] [2022-07-21 17:31:19,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:31:19,038 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:31:19,064 WARN L230 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-1.i[22569,22582] [2022-07-21 17:31:19,065 WARN L230 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-1.i[22645,22658] [2022-07-21 17:31:19,065 WARN L230 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-1.i[22715,22728] [2022-07-21 17:31:19,066 WARN L230 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-1.i[22822,22835] [2022-07-21 17:31:19,066 WARN L230 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-1.i[22894,22907] [2022-07-21 17:31:19,067 WARN L230 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-1.i[23045,23058] [2022-07-21 17:31:19,067 WARN L230 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-1.i[23119,23132] [2022-07-21 17:31:19,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:31:19,088 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:31:19,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:31:19 WrapperNode [2022-07-21 17:31:19,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:31:19,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:31:19,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:31:19,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:31:19,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:31:19" (1/1) ... [2022-07-21 17:31:19,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:31:19" (1/1) ... [2022-07-21 17:31:19,145 INFO L137 Inliner]: procedures = 122, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 158 [2022-07-21 17:31:19,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:31:19,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:31:19,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:31:19,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:31:19,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:31:19" (1/1) ... [2022-07-21 17:31:19,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:31:19" (1/1) ... [2022-07-21 17:31:19,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:31:19" (1/1) ... [2022-07-21 17:31:19,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:31:19" (1/1) ... [2022-07-21 17:31:19,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:31:19" (1/1) ... [2022-07-21 17:31:19,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:31:19" (1/1) ... [2022-07-21 17:31:19,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:31:19" (1/1) ... [2022-07-21 17:31:19,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:31:19,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:31:19,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:31:19,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:31:19,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:31:19" (1/1) ... [2022-07-21 17:31:19,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:31:19,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:31:19,231 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) [2022-07-21 17:31:19,247 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 [2022-07-21 17:31:19,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 17:31:19,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:31:19,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:31:19,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:31:19,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:31:19,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:31:19,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 17:31:19,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 17:31:19,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:31:19,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:31:19,360 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:31:19,361 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:31:19,751 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:31:19,756 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:31:19,756 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-07-21 17:31:19,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:31:19 BoogieIcfgContainer [2022-07-21 17:31:19,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:31:19,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:31:19,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:31:19,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:31:19,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:31:18" (1/3) ... [2022-07-21 17:31:19,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3698d440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:31:19, skipping insertion in model container [2022-07-21 17:31:19,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:31:19" (2/3) ... [2022-07-21 17:31:19,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3698d440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:31:19, skipping insertion in model container [2022-07-21 17:31:19,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:31:19" (3/3) ... [2022-07-21 17:31:19,764 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2022-07-21 17:31:19,781 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:31:19,781 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2022-07-21 17:31:19,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:31:19,828 INFO L357 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, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ae2450b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a55c657 [2022-07-21 17:31:19,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2022-07-21 17:31:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 82 states have (on average 2.231707317073171) internal successors, (183), 153 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:31:19,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:19,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:31:19,844 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:19,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:19,848 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-21 17:31:19,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:19,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388646317] [2022-07-21 17:31:19,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:19,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:19,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:19,858 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) [2022-07-21 17:31:19,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 17:31:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:19,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:31:19,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:19,996 INFO L390 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 [2022-07-21 17:31:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:20,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:20,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:20,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388646317] [2022-07-21 17:31:20,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388646317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:20,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:20,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:31:20,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656876473] [2022-07-21 17:31:20,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:20,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:31:20,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:20,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:31:20,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:31:20,038 INFO L87 Difference]: Start difference. First operand has 154 states, 82 states have (on average 2.231707317073171) internal successors, (183), 153 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:20,262 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2022-07-21 17:31:20,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:31:20,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-21 17:31:20,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:20,269 INFO L225 Difference]: With dead ends: 155 [2022-07-21 17:31:20,269 INFO L226 Difference]: Without dead ends: 151 [2022-07-21 17:31:20,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:31:20,272 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 135 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:20,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 93 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:31:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-21 17:31:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2022-07-21 17:31:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 83 states have (on average 1.855421686746988) internal successors, (154), 146 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2022-07-21 17:31:20,327 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 3 [2022-07-21 17:31:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:20,328 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2022-07-21 17:31:20,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:20,328 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2022-07-21 17:31:20,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:31:20,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:20,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:31:20,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:20,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:20,535 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:20,536 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-21 17:31:20,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:20,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090982787] [2022-07-21 17:31:20,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:20,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:20,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:20,541 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) [2022-07-21 17:31:20,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 17:31:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:20,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:31:20,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:20,591 INFO L390 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 [2022-07-21 17:31:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:20,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:20,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:20,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090982787] [2022-07-21 17:31:20,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090982787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:20,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:20,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:31:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87412073] [2022-07-21 17:31:20,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:20,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:31:20,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:20,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:31:20,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:31:20,600 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:20,797 INFO L93 Difference]: Finished difference Result 164 states and 170 transitions. [2022-07-21 17:31:20,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:31:20,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-21 17:31:20,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:20,798 INFO L225 Difference]: With dead ends: 164 [2022-07-21 17:31:20,799 INFO L226 Difference]: Without dead ends: 164 [2022-07-21 17:31:20,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:31:20,800 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 129 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:20,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 98 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:31:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-21 17:31:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2022-07-21 17:31:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 90 states have (on average 1.7555555555555555) internal successors, (158), 150 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2022-07-21 17:31:20,805 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 3 [2022-07-21 17:31:20,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:20,806 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2022-07-21 17:31:20,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2022-07-21 17:31:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 17:31:20,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:20,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:20,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:21,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:21,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:21,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash 59261803, now seen corresponding path program 1 times [2022-07-21 17:31:21,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:21,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158624488] [2022-07-21 17:31:21,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:21,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:21,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:21,022 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) [2022-07-21 17:31:21,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 17:31:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:21,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:31:21,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:21,096 INFO L390 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 [2022-07-21 17:31:21,128 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 17:31:21,128 INFO L390 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 12 treesize of output 17 [2022-07-21 17:31:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:21,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:21,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:21,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158624488] [2022-07-21 17:31:21,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158624488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:21,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:21,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:31:21,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006791087] [2022-07-21 17:31:21,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:21,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:31:21,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:21,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:31:21,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:31:21,139 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:21,380 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2022-07-21 17:31:21,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:31:21,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-21 17:31:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:21,381 INFO L225 Difference]: With dead ends: 152 [2022-07-21 17:31:21,382 INFO L226 Difference]: Without dead ends: 152 [2022-07-21 17:31:21,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:31:21,382 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 211 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:21,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 75 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:31:21,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-21 17:31:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 138. [2022-07-21 17:31:21,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 92 states have (on average 1.5978260869565217) internal successors, (147), 137 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2022-07-21 17:31:21,388 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 8 [2022-07-21 17:31:21,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:21,388 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2022-07-21 17:31:21,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2022-07-21 17:31:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 17:31:21,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:21,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:21,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:21,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:21,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:21,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:21,598 INFO L85 PathProgramCache]: Analyzing trace with hash 59261804, now seen corresponding path program 1 times [2022-07-21 17:31:21,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:21,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953158247] [2022-07-21 17:31:21,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:21,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:21,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:21,599 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) [2022-07-21 17:31:21,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 17:31:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:21,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:31:21,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:21,659 INFO L390 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 [2022-07-21 17:31:21,720 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:31:21,721 INFO L390 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 12 treesize of output 14 [2022-07-21 17:31:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:21,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:21,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:21,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953158247] [2022-07-21 17:31:21,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953158247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:21,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:21,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:31:21,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357770056] [2022-07-21 17:31:21,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:21,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:31:21,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:21,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:31:21,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:31:21,736 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:22,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:22,066 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2022-07-21 17:31:22,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:31:22,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-21 17:31:22,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:22,067 INFO L225 Difference]: With dead ends: 176 [2022-07-21 17:31:22,067 INFO L226 Difference]: Without dead ends: 176 [2022-07-21 17:31:22,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:31:22,068 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 175 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:22,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 113 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:31:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-21 17:31:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 147. [2022-07-21 17:31:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 102 states have (on average 1.5588235294117647) internal successors, (159), 146 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2022-07-21 17:31:22,074 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 8 [2022-07-21 17:31:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:22,074 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2022-07-21 17:31:22,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2022-07-21 17:31:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 17:31:22,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:22,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:22,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:22,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:22,282 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:22,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:22,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1116069405, now seen corresponding path program 1 times [2022-07-21 17:31:22,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:22,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537875705] [2022-07-21 17:31:22,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:22,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:22,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:22,284 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) [2022-07-21 17:31:22,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 17:31:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:22,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:31:22,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:22,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:22,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:22,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537875705] [2022-07-21 17:31:22,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537875705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:22,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:22,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:31:22,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463794634] [2022-07-21 17:31:22,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:22,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:31:22,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:22,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:31:22,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:31:22,357 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:22,546 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2022-07-21 17:31:22,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:31:22,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-21 17:31:22,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:22,547 INFO L225 Difference]: With dead ends: 161 [2022-07-21 17:31:22,547 INFO L226 Difference]: Without dead ends: 161 [2022-07-21 17:31:22,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:31:22,548 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 147 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:22,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 171 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:31:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-21 17:31:22,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 145. [2022-07-21 17:31:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 101 states have (on average 1.5346534653465347) internal successors, (155), 144 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2022-07-21 17:31:22,555 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 10 [2022-07-21 17:31:22,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:22,555 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2022-07-21 17:31:22,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:22,555 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2022-07-21 17:31:22,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:31:22,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:22,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:22,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:22,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:22,762 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:22,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:22,763 INFO L85 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2022-07-21 17:31:22,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:22,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766586504] [2022-07-21 17:31:22,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:22,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:22,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:22,764 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) [2022-07-21 17:31:22,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 17:31:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:22,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:31:22,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:22,824 INFO L390 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 [2022-07-21 17:31:22,840 INFO L390 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 [2022-07-21 17:31:22,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-21 17:31:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:22,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:22,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:22,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766586504] [2022-07-21 17:31:22,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766586504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:22,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:22,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:31:22,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338727318] [2022-07-21 17:31:22,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:22,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:31:22,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:22,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:31:22,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:31:22,860 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:23,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:23,121 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2022-07-21 17:31:23,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:31:23,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 17:31:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:23,123 INFO L225 Difference]: With dead ends: 144 [2022-07-21 17:31:23,123 INFO L226 Difference]: Without dead ends: 144 [2022-07-21 17:31:23,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:31:23,123 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 9 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:23,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 330 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:31:23,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-21 17:31:23,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-07-21 17:31:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 101 states have (on average 1.5148514851485149) internal successors, (153), 143 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2022-07-21 17:31:23,127 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 11 [2022-07-21 17:31:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:23,127 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2022-07-21 17:31:23,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2022-07-21 17:31:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:31:23,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:23,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:23,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-21 17:31:23,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:23,328 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:23,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2022-07-21 17:31:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:23,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281102376] [2022-07-21 17:31:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:23,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:23,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:23,331 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) [2022-07-21 17:31:23,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 17:31:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:23,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 17:31:23,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:23,398 INFO L390 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 [2022-07-21 17:31:23,411 INFO L390 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 [2022-07-21 17:31:23,416 INFO L390 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 [2022-07-21 17:31:23,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-21 17:31:23,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:31:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:23,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:23,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:23,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281102376] [2022-07-21 17:31:23,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281102376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:23,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:23,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:31:23,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223270596] [2022-07-21 17:31:23,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:23,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:31:23,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:23,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:31:23,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:31:23,459 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:23,795 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2022-07-21 17:31:23,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:31:23,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 17:31:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:23,797 INFO L225 Difference]: With dead ends: 143 [2022-07-21 17:31:23,797 INFO L226 Difference]: Without dead ends: 143 [2022-07-21 17:31:23,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:31:23,797 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 4 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:23,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 315 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:31:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-21 17:31:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-07-21 17:31:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 101 states have (on average 1.495049504950495) internal successors, (151), 142 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2022-07-21 17:31:23,800 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 11 [2022-07-21 17:31:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:23,800 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2022-07-21 17:31:23,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2022-07-21 17:31:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 17:31:23,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:23,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:23,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:24,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:24,011 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:24,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:24,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1485862716, now seen corresponding path program 1 times [2022-07-21 17:31:24,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:24,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126970793] [2022-07-21 17:31:24,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:24,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:24,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:24,013 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) [2022-07-21 17:31:24,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-21 17:31:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:24,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:31:24,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:24,093 INFO L390 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 [2022-07-21 17:31:24,127 INFO L390 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 [2022-07-21 17:31:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:24,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:24,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:24,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126970793] [2022-07-21 17:31:24,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126970793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:24,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:24,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:31:24,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004922732] [2022-07-21 17:31:24,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:24,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:31:24,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:24,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:31:24,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:31:24,135 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:24,490 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2022-07-21 17:31:24,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:31:24,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-21 17:31:24,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:24,491 INFO L225 Difference]: With dead ends: 197 [2022-07-21 17:31:24,491 INFO L226 Difference]: Without dead ends: 197 [2022-07-21 17:31:24,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:31:24,492 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 87 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:24,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 298 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:31:24,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-21 17:31:24,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 148. [2022-07-21 17:31:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 106 states have (on average 1.471698113207547) internal successors, (156), 147 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2022-07-21 17:31:24,495 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 13 [2022-07-21 17:31:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:24,495 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2022-07-21 17:31:24,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2022-07-21 17:31:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 17:31:24,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:24,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:24,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:24,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:24,703 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:24,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:24,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053835, now seen corresponding path program 1 times [2022-07-21 17:31:24,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:24,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175971828] [2022-07-21 17:31:24,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:24,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:24,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:24,705 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) [2022-07-21 17:31:24,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-21 17:31:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:24,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 17:31:24,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:24,843 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-21 17:31:24,844 INFO L390 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 12 treesize of output 21 [2022-07-21 17:31:24,932 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-21 17:31:24,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-21 17:31:24,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:31:25,148 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:31:25,148 INFO L390 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 44 treesize of output 43 [2022-07-21 17:31:25,223 INFO L390 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 41 treesize of output 25 [2022-07-21 17:31:25,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:25,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:25,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:25,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175971828] [2022-07-21 17:31:25,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175971828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:25,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:25,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:31:25,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705077779] [2022-07-21 17:31:25,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:25,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:31:25,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:25,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:31:25,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:31:25,424 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:26,014 INFO L93 Difference]: Finished difference Result 220 states and 234 transitions. [2022-07-21 17:31:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 17:31:26,015 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-21 17:31:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:26,015 INFO L225 Difference]: With dead ends: 220 [2022-07-21 17:31:26,015 INFO L226 Difference]: Without dead ends: 220 [2022-07-21 17:31:26,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-07-21 17:31:26,016 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 162 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:26,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 544 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 209 Invalid, 0 Unknown, 367 Unchecked, 0.3s Time] [2022-07-21 17:31:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-21 17:31:26,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 150. [2022-07-21 17:31:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 108 states have (on average 1.4722222222222223) internal successors, (159), 149 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2022-07-21 17:31:26,019 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 15 [2022-07-21 17:31:26,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:26,019 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2022-07-21 17:31:26,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:26,019 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2022-07-21 17:31:26,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 17:31:26,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:26,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:26,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:26,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:26,220 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:26,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:26,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053834, now seen corresponding path program 1 times [2022-07-21 17:31:26,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:26,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30555260] [2022-07-21 17:31:26,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:26,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:26,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:26,222 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) [2022-07-21 17:31:26,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 17:31:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:26,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-21 17:31:26,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:26,341 INFO L390 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 [2022-07-21 17:31:26,354 INFO L390 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 [2022-07-21 17:31:26,362 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:31:26,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:31:26,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:31:26,390 INFO L390 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 [2022-07-21 17:31:26,457 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:31:26,457 INFO L390 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 38 treesize of output 37 [2022-07-21 17:31:26,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 17:31:26,494 INFO L390 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 25 treesize of output 13 [2022-07-21 17:31:26,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:31:26,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:26,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:26,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:26,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30555260] [2022-07-21 17:31:26,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30555260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:26,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:26,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:31:26,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708061977] [2022-07-21 17:31:26,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:26,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:31:26,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:26,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:31:26,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:31:26,528 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:27,272 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2022-07-21 17:31:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 17:31:27,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-21 17:31:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:27,273 INFO L225 Difference]: With dead ends: 167 [2022-07-21 17:31:27,273 INFO L226 Difference]: Without dead ends: 167 [2022-07-21 17:31:27,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2022-07-21 17:31:27,274 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 228 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:27,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 296 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 17:31:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-21 17:31:27,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2022-07-21 17:31:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 123 states have (on average 1.3902439024390243) internal successors, (171), 158 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 171 transitions. [2022-07-21 17:31:27,276 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 171 transitions. Word has length 15 [2022-07-21 17:31:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:27,277 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 171 transitions. [2022-07-21 17:31:27,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2022-07-21 17:31:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:31:27,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:27,277 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:27,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:27,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:27,485 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:27,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2044653013, now seen corresponding path program 1 times [2022-07-21 17:31:27,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:27,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54503622] [2022-07-21 17:31:27,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:27,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:27,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:27,487 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) [2022-07-21 17:31:27,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 17:31:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:27,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 17:31:27,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:27,588 INFO L390 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 [2022-07-21 17:31:27,592 INFO L390 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 [2022-07-21 17:31:27,609 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 17:31:27,610 INFO L390 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 21 treesize of output 20 [2022-07-21 17:31:27,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:31:27,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:31:27,630 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 17:31:27,630 INFO L390 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 21 treesize of output 20 [2022-07-21 17:31:27,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:31:27,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:31:27,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:31:27,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:31:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:27,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:31:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:27,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:27,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54503622] [2022-07-21 17:31:27,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54503622] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:31:27,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:31:27,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-21 17:31:27,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014285305] [2022-07-21 17:31:27,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:31:27,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:31:27,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:27,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:31:27,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:31:27,758 INFO L87 Difference]: Start difference. First operand 159 states and 171 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:28,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:28,139 INFO L93 Difference]: Finished difference Result 209 states and 225 transitions. [2022-07-21 17:31:28,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:31:28,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-21 17:31:28,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:28,140 INFO L225 Difference]: With dead ends: 209 [2022-07-21 17:31:28,140 INFO L226 Difference]: Without dead ends: 209 [2022-07-21 17:31:28,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:31:28,141 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 100 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:28,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 322 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:31:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-21 17:31:28,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 166. [2022-07-21 17:31:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 130 states have (on average 1.376923076923077) internal successors, (179), 165 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:28,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2022-07-21 17:31:28,144 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 20 [2022-07-21 17:31:28,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:28,144 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2022-07-21 17:31:28,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:28,144 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2022-07-21 17:31:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:31:28,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:28,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:28,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-21 17:31:28,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:28,352 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:28,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:28,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2086671266, now seen corresponding path program 1 times [2022-07-21 17:31:28,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:28,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924631940] [2022-07-21 17:31:28,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:28,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:28,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:28,354 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:28,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 17:31:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:28,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:31:28,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:28,415 INFO L390 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 [2022-07-21 17:31:28,442 INFO L390 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 [2022-07-21 17:31:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:28,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:28,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:28,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924631940] [2022-07-21 17:31:28,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924631940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:28,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:28,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:31:28,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131612304] [2022-07-21 17:31:28,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:28,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:31:28,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:28,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:31:28,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:31:28,454 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:28,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:28,728 INFO L93 Difference]: Finished difference Result 185 states and 198 transitions. [2022-07-21 17:31:28,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:31:28,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-21 17:31:28,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:28,729 INFO L225 Difference]: With dead ends: 185 [2022-07-21 17:31:28,729 INFO L226 Difference]: Without dead ends: 185 [2022-07-21 17:31:28,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:31:28,730 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 55 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:28,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 284 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:31:28,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-21 17:31:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 166. [2022-07-21 17:31:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 130 states have (on average 1.3692307692307693) internal successors, (178), 165 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 178 transitions. [2022-07-21 17:31:28,732 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 178 transitions. Word has length 20 [2022-07-21 17:31:28,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:28,732 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 178 transitions. [2022-07-21 17:31:28,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2022-07-21 17:31:28,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:31:28,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:28,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:28,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:28,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:28,940 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:28,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:28,941 INFO L85 PathProgramCache]: Analyzing trace with hash 786329176, now seen corresponding path program 1 times [2022-07-21 17:31:28,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:28,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410276931] [2022-07-21 17:31:28,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:28,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:28,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:28,942 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:28,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 17:31:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:29,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:31:29,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:29,025 INFO L390 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 [2022-07-21 17:31:29,037 INFO L390 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 [2022-07-21 17:31:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:29,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:29,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:29,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410276931] [2022-07-21 17:31:29,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410276931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:29,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:29,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:31:29,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835978145] [2022-07-21 17:31:29,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:29,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:31:29,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:29,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:31:29,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:31:29,043 INFO L87 Difference]: Start difference. First operand 166 states and 178 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:29,189 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2022-07-21 17:31:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:31:29,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-21 17:31:29,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:29,190 INFO L225 Difference]: With dead ends: 164 [2022-07-21 17:31:29,190 INFO L226 Difference]: Without dead ends: 164 [2022-07-21 17:31:29,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:31:29,190 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 19 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:29,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 273 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:31:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-21 17:31:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-07-21 17:31:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 129 states have (on average 1.3565891472868217) internal successors, (175), 163 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2022-07-21 17:31:29,193 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 20 [2022-07-21 17:31:29,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:29,193 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2022-07-21 17:31:29,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2022-07-21 17:31:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:31:29,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:29,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:29,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:29,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:29,394 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:29,394 INFO L85 PathProgramCache]: Analyzing trace with hash 9814789, now seen corresponding path program 1 times [2022-07-21 17:31:29,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:29,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51477566] [2022-07-21 17:31:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:29,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:29,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:29,396 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:29,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-21 17:31:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:29,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:31:29,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:29,484 INFO L390 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 [2022-07-21 17:31:29,490 INFO L390 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 [2022-07-21 17:31:29,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-21 17:31:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:29,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:29,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:29,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51477566] [2022-07-21 17:31:29,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51477566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:29,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:29,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:31:29,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771803455] [2022-07-21 17:31:29,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:29,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:31:29,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:29,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:31:29,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:31:29,509 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:29,735 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2022-07-21 17:31:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:31:29,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-21 17:31:29,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:29,737 INFO L225 Difference]: With dead ends: 163 [2022-07-21 17:31:29,737 INFO L226 Difference]: Without dead ends: 163 [2022-07-21 17:31:29,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:31:29,737 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:29,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 306 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:31:29,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-21 17:31:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-07-21 17:31:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.3488372093023255) internal successors, (174), 162 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 174 transitions. [2022-07-21 17:31:29,740 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 174 transitions. Word has length 22 [2022-07-21 17:31:29,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:29,740 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 174 transitions. [2022-07-21 17:31:29,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:29,741 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 174 transitions. [2022-07-21 17:31:29,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:31:29,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:29,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:29,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:29,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:29,942 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:29,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:29,942 INFO L85 PathProgramCache]: Analyzing trace with hash 9814790, now seen corresponding path program 1 times [2022-07-21 17:31:29,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:29,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647514079] [2022-07-21 17:31:29,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:29,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:29,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:29,944 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:29,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-21 17:31:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:30,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 17:31:30,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:30,094 INFO L390 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 [2022-07-21 17:31:30,104 INFO L390 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 [2022-07-21 17:31:30,109 INFO L390 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 [2022-07-21 17:31:30,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:31:30,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-21 17:31:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:30,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:30,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:30,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647514079] [2022-07-21 17:31:30,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647514079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:30,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:30,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:31:30,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890491624] [2022-07-21 17:31:30,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:30,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:31:30,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:30,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:31:30,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:31:30,149 INFO L87 Difference]: Start difference. First operand 163 states and 174 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:30,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:30,427 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2022-07-21 17:31:30,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:31:30,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-21 17:31:30,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:30,428 INFO L225 Difference]: With dead ends: 162 [2022-07-21 17:31:30,428 INFO L226 Difference]: Without dead ends: 162 [2022-07-21 17:31:30,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:31:30,428 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 2 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:30,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 298 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:31:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-21 17:31:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-07-21 17:31:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 129 states have (on average 1.3410852713178294) internal successors, (173), 161 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2022-07-21 17:31:30,431 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 22 [2022-07-21 17:31:30,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:30,431 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2022-07-21 17:31:30,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2022-07-21 17:31:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 17:31:30,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:30,437 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:31:30,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:30,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:30,644 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:30,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:30,644 INFO L85 PathProgramCache]: Analyzing trace with hash 784847942, now seen corresponding path program 1 times [2022-07-21 17:31:30,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:30,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015963389] [2022-07-21 17:31:30,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:30,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:30,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:30,646 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:30,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-21 17:31:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:30,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 17:31:30,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:30,771 INFO L390 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 [2022-07-21 17:31:30,774 INFO L390 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 [2022-07-21 17:31:30,794 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 17:31:30,795 INFO L390 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 21 treesize of output 20 [2022-07-21 17:31:30,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:31:30,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:31:30,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:31:30,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:31:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:30,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:30,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:30,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015963389] [2022-07-21 17:31:30,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015963389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:30,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:30,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:31:30,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186871559] [2022-07-21 17:31:30,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:30,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:31:30,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:30,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:31:30,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:31:30,826 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:31,043 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2022-07-21 17:31:31,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:31:31,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-21 17:31:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:31,044 INFO L225 Difference]: With dead ends: 160 [2022-07-21 17:31:31,044 INFO L226 Difference]: Without dead ends: 160 [2022-07-21 17:31:31,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:31:31,044 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 14 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:31,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 250 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:31:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-21 17:31:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-07-21 17:31:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 128 states have (on average 1.328125) internal successors, (170), 159 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 170 transitions. [2022-07-21 17:31:31,047 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 170 transitions. Word has length 23 [2022-07-21 17:31:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:31,047 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 170 transitions. [2022-07-21 17:31:31,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 170 transitions. [2022-07-21 17:31:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:31:31,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:31,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:31,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:31,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:31,255 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:31,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1675242166, now seen corresponding path program 1 times [2022-07-21 17:31:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:31,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358349536] [2022-07-21 17:31:31,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:31,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:31,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:31,257 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:31,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-21 17:31:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:31,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:31:31,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:31,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:31:31,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:31:31,392 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:31:31,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:31:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:31,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:31,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:31,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358349536] [2022-07-21 17:31:31,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358349536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:31,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:31,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:31:31,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141577144] [2022-07-21 17:31:31,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:31,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:31:31,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:31,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:31:31,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:31:31,406 INFO L87 Difference]: Start difference. First operand 160 states and 170 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:31,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:31,567 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2022-07-21 17:31:31,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:31:31,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-21 17:31:31,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:31,568 INFO L225 Difference]: With dead ends: 172 [2022-07-21 17:31:31,568 INFO L226 Difference]: Without dead ends: 172 [2022-07-21 17:31:31,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:31:31,569 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 154 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:31,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 94 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:31:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-21 17:31:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2022-07-21 17:31:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 127 states have (on average 1.31496062992126) internal successors, (167), 157 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2022-07-21 17:31:31,571 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 25 [2022-07-21 17:31:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:31,571 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2022-07-21 17:31:31,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2022-07-21 17:31:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 17:31:31,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:31,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:31,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:31,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:31,780 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:31,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:31,780 INFO L85 PathProgramCache]: Analyzing trace with hash -619225460, now seen corresponding path program 1 times [2022-07-21 17:31:31,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:31,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75157862] [2022-07-21 17:31:31,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:31,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:31,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:31,784 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:31,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-21 17:31:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:31,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 17:31:31,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:31:31,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:31,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:31,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75157862] [2022-07-21 17:31:31,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75157862] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:31,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:31,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:31:31,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72988557] [2022-07-21 17:31:31,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:31,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:31:31,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:31,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:31:31,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:31:31,927 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:31,976 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2022-07-21 17:31:31,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:31:31,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-21 17:31:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:31,978 INFO L225 Difference]: With dead ends: 160 [2022-07-21 17:31:31,978 INFO L226 Difference]: Without dead ends: 160 [2022-07-21 17:31:31,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:31:31,978 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 70 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:31,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 111 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:31:31,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-21 17:31:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-07-21 17:31:31,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 129 states have (on average 1.310077519379845) internal successors, (169), 159 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2022-07-21 17:31:31,980 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 26 [2022-07-21 17:31:31,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:31,980 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2022-07-21 17:31:31,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2022-07-21 17:31:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 17:31:31,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:31,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:31,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:32,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:32,188 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:32,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:32,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1783743687, now seen corresponding path program 1 times [2022-07-21 17:31:32,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:32,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885264367] [2022-07-21 17:31:32,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:32,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:32,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:32,190 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:32,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-21 17:31:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:32,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 17:31:32,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:32,343 INFO L390 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 [2022-07-21 17:31:32,367 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:31:32,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 17:31:32,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:31:32,429 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:31:32,429 INFO L390 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 28 treesize of output 29 [2022-07-21 17:31:32,444 INFO L390 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 25 treesize of output 13 [2022-07-21 17:31:32,524 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-21 17:31:32,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-21 17:31:32,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-07-21 17:31:32,708 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:31:32,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-21 17:31:32,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-07-21 17:31:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:32,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:32,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:32,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885264367] [2022-07-21 17:31:32,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885264367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:32,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:32,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 17:31:32,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836939832] [2022-07-21 17:31:32,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:32,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 17:31:32,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:32,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 17:31:32,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:31:32,877 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:33,307 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2022-07-21 17:31:33,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 17:31:33,307 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-21 17:31:33,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:33,308 INFO L225 Difference]: With dead ends: 161 [2022-07-21 17:31:33,308 INFO L226 Difference]: Without dead ends: 161 [2022-07-21 17:31:33,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2022-07-21 17:31:33,309 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 97 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 325 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:33,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 323 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 181 Invalid, 0 Unknown, 325 Unchecked, 0.2s Time] [2022-07-21 17:31:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-21 17:31:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-07-21 17:31:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 129 states have (on average 1.302325581395349) internal successors, (168), 158 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2022-07-21 17:31:33,312 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 26 [2022-07-21 17:31:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:33,312 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2022-07-21 17:31:33,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2022-07-21 17:31:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 17:31:33,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:33,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:33,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:33,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:33,513 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:33,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:33,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1783743688, now seen corresponding path program 1 times [2022-07-21 17:31:33,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:33,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065939832] [2022-07-21 17:31:33,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:33,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:33,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:33,515 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:33,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-21 17:31:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:33,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-21 17:31:33,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:33,681 INFO L390 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 [2022-07-21 17:31:33,706 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:31:33,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 17:31:33,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:31:33,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:31:33,781 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:31:33,782 INFO L390 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 37 treesize of output 36 [2022-07-21 17:31:33,799 INFO L390 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 34 treesize of output 18 [2022-07-21 17:31:33,872 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 17:31:33,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 17:31:33,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:31:33,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:31:33,909 INFO L390 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 [2022-07-21 17:31:33,974 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:31:33,974 INFO L390 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 38 treesize of output 37 [2022-07-21 17:31:33,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 17:31:33,992 INFO L390 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 25 treesize of output 13 [2022-07-21 17:31:33,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:31:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:34,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:34,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:34,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065939832] [2022-07-21 17:31:34,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065939832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:34,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:34,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 17:31:34,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748500476] [2022-07-21 17:31:34,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:34,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 17:31:34,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:34,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 17:31:34,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:31:34,056 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:34,749 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2022-07-21 17:31:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-21 17:31:34,749 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-21 17:31:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:34,750 INFO L225 Difference]: With dead ends: 160 [2022-07-21 17:31:34,750 INFO L226 Difference]: Without dead ends: 160 [2022-07-21 17:31:34,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2022-07-21 17:31:34,751 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 113 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 255 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:34,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 386 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 335 Invalid, 0 Unknown, 255 Unchecked, 0.3s Time] [2022-07-21 17:31:34,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-21 17:31:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-07-21 17:31:34,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 129 states have (on average 1.2945736434108528) internal successors, (167), 157 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2022-07-21 17:31:34,753 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 26 [2022-07-21 17:31:34,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:34,753 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2022-07-21 17:31:34,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2022-07-21 17:31:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 17:31:34,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:34,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:34,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:34,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:34,959 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:34,960 INFO L85 PathProgramCache]: Analyzing trace with hash -538520510, now seen corresponding path program 1 times [2022-07-21 17:31:34,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:34,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812246422] [2022-07-21 17:31:34,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:34,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:34,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:34,961 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:34,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-21 17:31:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:35,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-21 17:31:35,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:35,140 INFO L390 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 [2022-07-21 17:31:35,165 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:31:35,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 17:31:35,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:31:35,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:31:35,251 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:31:35,251 INFO L390 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 37 treesize of output 36 [2022-07-21 17:31:35,267 INFO L390 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 34 treesize of output 18 [2022-07-21 17:31:35,340 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:31:35,340 INFO L390 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 12 treesize of output 14 [2022-07-21 17:31:35,358 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 17:31:35,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 17:31:35,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:31:35,386 INFO L390 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 [2022-07-21 17:31:35,452 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:31:35,452 INFO L390 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 38 treesize of output 37 [2022-07-21 17:31:35,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 17:31:35,478 INFO L390 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 25 treesize of output 13 [2022-07-21 17:31:35,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:31:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:35,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:35,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:35,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812246422] [2022-07-21 17:31:35,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812246422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:35,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:35,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 17:31:35,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875810432] [2022-07-21 17:31:35,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:35,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 17:31:35,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:35,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 17:31:35,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:31:35,532 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:36,167 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2022-07-21 17:31:36,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-21 17:31:36,168 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-21 17:31:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:36,169 INFO L225 Difference]: With dead ends: 159 [2022-07-21 17:31:36,169 INFO L226 Difference]: Without dead ends: 159 [2022-07-21 17:31:36,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2022-07-21 17:31:36,169 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 100 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:36,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 415 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 390 Invalid, 0 Unknown, 289 Unchecked, 0.3s Time] [2022-07-21 17:31:36,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-21 17:31:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2022-07-21 17:31:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 156 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2022-07-21 17:31:36,173 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 27 [2022-07-21 17:31:36,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:36,174 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2022-07-21 17:31:36,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2022-07-21 17:31:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 17:31:36,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:36,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:36,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:36,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:36,383 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:36,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:36,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1071250695, now seen corresponding path program 1 times [2022-07-21 17:31:36,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:36,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803095080] [2022-07-21 17:31:36,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:36,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:36,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:36,386 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:36,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-21 17:31:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:36,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:31:36,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:36,470 INFO L390 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 [2022-07-21 17:31:36,494 INFO L390 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 [2022-07-21 17:31:36,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:31:36,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:36,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:36,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803095080] [2022-07-21 17:31:36,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803095080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:36,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:36,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:31:36,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726093385] [2022-07-21 17:31:36,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:36,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:31:36,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:36,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:31:36,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:31:36,500 INFO L87 Difference]: Start difference. First operand 157 states and 166 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:36,610 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2022-07-21 17:31:36,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:31:36,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-21 17:31:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:36,613 INFO L225 Difference]: With dead ends: 165 [2022-07-21 17:31:36,613 INFO L226 Difference]: Without dead ends: 165 [2022-07-21 17:31:36,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:31:36,614 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 6 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:36,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 264 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:31:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-21 17:31:36,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2022-07-21 17:31:36,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 159 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2022-07-21 17:31:36,616 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 28 [2022-07-21 17:31:36,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:36,616 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2022-07-21 17:31:36,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2022-07-21 17:31:36,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 17:31:36,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:36,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:36,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:36,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:36,825 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:36,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash 485733390, now seen corresponding path program 1 times [2022-07-21 17:31:36,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:36,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733746332] [2022-07-21 17:31:36,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:36,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:36,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:36,828 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:36,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-21 17:31:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:36,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:31:36,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:36,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:36,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:36,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733746332] [2022-07-21 17:31:36,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733746332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:36,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:36,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:31:36,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180290739] [2022-07-21 17:31:36,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:36,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:31:36,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:36,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:31:36,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:31:36,999 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:37,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:37,237 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2022-07-21 17:31:37,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:31:37,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-21 17:31:37,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:37,239 INFO L225 Difference]: With dead ends: 159 [2022-07-21 17:31:37,239 INFO L226 Difference]: Without dead ends: 159 [2022-07-21 17:31:37,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:31:37,239 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 26 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:37,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 127 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:31:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-21 17:31:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-07-21 17:31:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.2727272727272727) internal successors, (168), 158 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2022-07-21 17:31:37,241 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 28 [2022-07-21 17:31:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:37,241 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2022-07-21 17:31:37,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2022-07-21 17:31:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 17:31:37,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:37,242 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:37,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:37,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:37,442 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:37,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:37,443 INFO L85 PathProgramCache]: Analyzing trace with hash -460831951, now seen corresponding path program 1 times [2022-07-21 17:31:37,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:37,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843076349] [2022-07-21 17:31:37,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:37,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:37,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:37,444 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:37,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-21 17:31:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:37,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 17:31:37,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:37,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:31:37,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:31:37,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:37,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:31:37,748 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-21 17:31:37,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-07-21 17:31:37,755 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-21 17:31:37,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-07-21 17:31:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:37,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:37,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843076349] [2022-07-21 17:31:37,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843076349] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:31:37,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:31:37,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2022-07-21 17:31:37,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657125104] [2022-07-21 17:31:37,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:31:37,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:31:37,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:37,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:31:37,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:31:37,782 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:38,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:38,418 INFO L93 Difference]: Finished difference Result 204 states and 217 transitions. [2022-07-21 17:31:38,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 17:31:38,418 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-21 17:31:38,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:38,419 INFO L225 Difference]: With dead ends: 204 [2022-07-21 17:31:38,419 INFO L226 Difference]: Without dead ends: 204 [2022-07-21 17:31:38,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-07-21 17:31:38,420 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 177 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:38,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 409 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 17:31:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-21 17:31:38,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 170. [2022-07-21 17:31:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 143 states have (on average 1.2657342657342658) internal successors, (181), 169 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 181 transitions. [2022-07-21 17:31:38,422 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 181 transitions. Word has length 29 [2022-07-21 17:31:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:38,422 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 181 transitions. [2022-07-21 17:31:38,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 181 transitions. [2022-07-21 17:31:38,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 17:31:38,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:38,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:38,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:38,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:38,630 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:38,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:38,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1400888953, now seen corresponding path program 1 times [2022-07-21 17:31:38,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:38,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647351585] [2022-07-21 17:31:38,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:38,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:38,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:38,632 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:38,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-21 17:31:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:38,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:31:38,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:31:38,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:31:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:31:38,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:38,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647351585] [2022-07-21 17:31:38,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647351585] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:31:38,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:31:38,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2022-07-21 17:31:38,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056951301] [2022-07-21 17:31:38,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:31:38,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:31:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:38,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:31:38,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:31:38,861 INFO L87 Difference]: Start difference. First operand 170 states and 181 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:38,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:38,964 INFO L93 Difference]: Finished difference Result 178 states and 188 transitions. [2022-07-21 17:31:38,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:31:38,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-21 17:31:38,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:38,965 INFO L225 Difference]: With dead ends: 178 [2022-07-21 17:31:38,965 INFO L226 Difference]: Without dead ends: 155 [2022-07-21 17:31:38,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:31:38,965 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:38,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 94 Unchecked, 0.1s Time] [2022-07-21 17:31:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-21 17:31:38,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-07-21 17:31:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.2890625) internal successors, (165), 154 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2022-07-21 17:31:38,968 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 30 [2022-07-21 17:31:38,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:38,968 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2022-07-21 17:31:38,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2022-07-21 17:31:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 17:31:38,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:38,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:38,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:39,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:39,175 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:39,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:39,176 INFO L85 PathProgramCache]: Analyzing trace with hash 738626226, now seen corresponding path program 1 times [2022-07-21 17:31:39,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:39,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33547524] [2022-07-21 17:31:39,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:39,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:39,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:39,177 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:39,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-21 17:31:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:39,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:31:39,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:39,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:31:39,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:39,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33547524] [2022-07-21 17:31:39,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33547524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:31:39,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:31:39,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:31:39,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953547320] [2022-07-21 17:31:39,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:31:39,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:31:39,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:39,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:31:39,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:31:39,365 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:39,578 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2022-07-21 17:31:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:31:39,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-21 17:31:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:39,579 INFO L225 Difference]: With dead ends: 166 [2022-07-21 17:31:39,579 INFO L226 Difference]: Without dead ends: 166 [2022-07-21 17:31:39,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:31:39,579 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 39 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:39,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 122 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:31:39,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-21 17:31:39,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 147. [2022-07-21 17:31:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 146 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2022-07-21 17:31:39,581 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 31 [2022-07-21 17:31:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:39,581 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2022-07-21 17:31:39,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2022-07-21 17:31:39,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 17:31:39,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:39,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:39,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-21 17:31:39,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:39,782 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:39,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:39,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1009509384, now seen corresponding path program 1 times [2022-07-21 17:31:39,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:39,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621535561] [2022-07-21 17:31:39,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:39,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:39,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:39,808 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:39,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-21 17:31:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:39,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 17:31:39,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:39,960 INFO L390 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 [2022-07-21 17:31:39,972 INFO L390 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 [2022-07-21 17:31:40,033 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:31:40,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:31:40,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:31:40,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:31:40,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:31:40,129 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:31:40,129 INFO L390 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 29 treesize of output 30 [2022-07-21 17:31:40,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 17:31:40,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 17:31:40,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:31:40,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:31:40,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:31:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:40,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:31:40,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1070 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-21 17:31:40,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1070 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-21 17:31:40,385 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1070 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1070) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-21 17:31:40,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1070 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1067) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1068) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1070) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-21 17:31:40,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1070 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1067) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1068) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1070)) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-21 17:31:40,437 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:31:40,437 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-21 17:31:40,440 INFO L390 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 70 treesize of output 62 [2022-07-21 17:31:40,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-07-21 17:31:40,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1067 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_88 (_ BitVec 32)) (v_ArrVal_1064 (_ BitVec 32)) (v_ArrVal_1070 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1064))) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse2 (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (or (and (= ~unnamed1~0~BLACK (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1067) v_arrayElimCell_88 v_ArrVal_1070) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) .cse2) (and (= ~unnamed1~0~BLACK (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (not .cse2))))) is different from false [2022-07-21 17:31:41,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1064 (_ BitVec 32)) (v_ArrVal_1070 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_7| (_ BitVec 32))) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~malloc3#1.base_7| |c_ULTIMATE.start_main_~list~0#1.base|))) (or (and (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_1064)) |v_ULTIMATE.start_main_#t~malloc3#1.base_7| v_ArrVal_1070) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not .cse0)) (and .cse0 (forall ((v_ArrVal_1067 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_88 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_1064)) |v_ULTIMATE.start_main_#t~malloc3#1.base_7| v_ArrVal_1067) v_arrayElimCell_88 v_ArrVal_1070) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_7|) (_ bv0 1)))))) is different from false [2022-07-21 17:31:41,038 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-21 17:31:41,039 INFO L390 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 55 [2022-07-21 17:31:41,050 INFO L390 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 101 treesize of output 83 [2022-07-21 17:31:41,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-21 17:31:41,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:31:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:41,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:31:41,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621535561] [2022-07-21 17:31:41,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621535561] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:31:41,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:31:41,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-07-21 17:31:41,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006268107] [2022-07-21 17:31:41,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:31:41,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 17:31:41,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:31:41,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 17:31:41,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=214, Unknown=8, NotChecked=252, Total=552 [2022-07-21 17:31:41,089 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:31:42,078 INFO L93 Difference]: Finished difference Result 229 states and 247 transitions. [2022-07-21 17:31:42,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 17:31:42,078 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-21 17:31:42,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:31:42,079 INFO L225 Difference]: With dead ends: 229 [2022-07-21 17:31:42,079 INFO L226 Difference]: Without dead ends: 229 [2022-07-21 17:31:42,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=383, Unknown=8, NotChecked=336, Total=870 [2022-07-21 17:31:42,080 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 152 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1163 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:31:42,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 728 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 661 Invalid, 0 Unknown, 1163 Unchecked, 0.7s Time] [2022-07-21 17:31:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-21 17:31:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 163. [2022-07-21 17:31:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 139 states have (on average 1.2589928057553956) internal successors, (175), 162 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2022-07-21 17:31:42,088 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 32 [2022-07-21 17:31:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:31:42,088 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2022-07-21 17:31:42,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:31:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2022-07-21 17:31:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 17:31:42,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:31:42,088 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:31:42,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-21 17:31:42,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:31:42,297 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:31:42,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:31:42,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1726076529, now seen corresponding path program 1 times [2022-07-21 17:31:42,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:31:42,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320730593] [2022-07-21 17:31:42,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:31:42,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:31:42,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:31:42,299 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:31:42,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-21 17:31:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:31:42,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 17:31:42,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:31:42,502 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-21 17:31:42,502 INFO L390 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 12 treesize of output 21 [2022-07-21 17:31:42,560 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-21 17:31:42,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-21 17:31:42,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:31:42,726 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:31:42,727 INFO L390 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 44 treesize of output 43 [2022-07-21 17:31:42,788 INFO L390 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 41 treesize of output 25 [2022-07-21 17:31:43,488 INFO L356 Elim1Store]: treesize reduction 61, result has 37.8 percent of original size [2022-07-21 17:31:43,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 63 [2022-07-21 17:31:43,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-07-21 17:31:44,551 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:31:44,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2022-07-21 17:31:45,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2022-07-21 17:31:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:31:45,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:31:45,877 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1139) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-21 17:31:45,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1139) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-21 17:31:45,888 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:31:45,888 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-21 17:31:45,890 INFO L390 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 34 treesize of output 26 [2022-07-21 17:31:45,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-21 17:32:02,862 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:02,862 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2022-07-21 17:32:02,864 INFO L390 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 74 treesize of output 62 [2022-07-21 17:32:02,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-21 17:32:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-21 17:32:16,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:32:16,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320730593] [2022-07-21 17:32:16,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320730593] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:32:16,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:32:16,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 28 [2022-07-21 17:32:16,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509980167] [2022-07-21 17:32:16,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:32:16,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-21 17:32:16,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:32:16,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-21 17:32:16,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=551, Unknown=35, NotChecked=102, Total=812 [2022-07-21 17:32:16,960 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:32:19,356 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2022-07-21 17:32:19,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 17:32:19,356 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-21 17:32:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:32:19,357 INFO L225 Difference]: With dead ends: 184 [2022-07-21 17:32:19,357 INFO L226 Difference]: Without dead ends: 184 [2022-07-21 17:32:19,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=223, Invalid=871, Unknown=36, NotChecked=130, Total=1260 [2022-07-21 17:32:19,358 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 26 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 381 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:32:19,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 962 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 381 Unchecked, 0.1s Time] [2022-07-21 17:32:19,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-21 17:32:19,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2022-07-21 17:32:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 158 states have (on average 1.240506329113924) internal successors, (196), 181 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2022-07-21 17:32:19,360 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 34 [2022-07-21 17:32:19,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:32:19,360 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2022-07-21 17:32:19,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2022-07-21 17:32:19,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 17:32:19,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:32:19,360 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:32:19,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-21 17:32:19,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:32:19,561 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:32:19,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:32:19,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1020923205, now seen corresponding path program 1 times [2022-07-21 17:32:19,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:32:19,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571887411] [2022-07-21 17:32:19,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:19,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:32:19,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:32:19,563 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:32:19,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-21 17:32:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:19,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 17:32:19,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:32:19,772 INFO L390 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 [2022-07-21 17:32:19,793 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:32:19,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 17:32:19,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:32:19,860 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:32:19,861 INFO L390 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 28 treesize of output 29 [2022-07-21 17:32:19,871 INFO L390 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 25 treesize of output 13 [2022-07-21 17:32:19,928 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 17:32:19,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 17:32:19,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:32:19,948 INFO L390 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 [2022-07-21 17:32:19,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:32:20,009 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:32:20,009 INFO L390 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 38 treesize of output 37 [2022-07-21 17:32:20,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 17:32:20,026 INFO L390 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 25 treesize of output 13 [2022-07-21 17:32:20,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:32:20,093 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:32:20,094 INFO L390 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 12 treesize of output 14 [2022-07-21 17:32:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:20,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:32:20,514 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1225 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_14| (_ BitVec 32)) (v_ArrVal_1224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1225) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc3#1.base_14| (_ bv12 32)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1224) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_ArrVal_1225 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1225) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2022-07-21 17:32:20,532 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1225 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1225) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1225 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_14| (_ BitVec 32)) (v_ArrVal_1224 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1225) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc3#1.base_14| (_ bv12 32)) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1224) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)))))) is different from false [2022-07-21 17:32:20,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:20,557 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 28 [2022-07-21 17:32:20,559 INFO L390 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 40 treesize of output 28 [2022-07-21 17:32:20,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 17:32:20,577 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:20,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-21 17:32:20,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:32:20,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2022-07-21 17:32:20,587 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:20,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-21 17:32:20,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:32:20,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-21 17:32:20,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1218) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-21 17:32:20,803 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:20,803 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-21 17:32:20,805 INFO L390 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 34 treesize of output 26 [2022-07-21 17:32:20,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-21 17:32:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:29,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:32:29,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571887411] [2022-07-21 17:32:29,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571887411] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:32:29,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:32:29,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2022-07-21 17:32:29,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612404718] [2022-07-21 17:32:29,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:32:29,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-21 17:32:29,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:32:29,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-21 17:32:29,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=517, Unknown=15, NotChecked=144, Total=756 [2022-07-21 17:32:29,650 INFO L87 Difference]: Start difference. First operand 182 states and 196 transitions. Second operand has 28 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 28 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:32:31,797 INFO L93 Difference]: Finished difference Result 198 states and 213 transitions. [2022-07-21 17:32:31,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-21 17:32:31,797 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 28 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-21 17:32:31,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:32:31,798 INFO L225 Difference]: With dead ends: 198 [2022-07-21 17:32:31,798 INFO L226 Difference]: Without dead ends: 198 [2022-07-21 17:32:31,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=282, Invalid=1606, Unknown=16, NotChecked=258, Total=2162 [2022-07-21 17:32:31,802 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 112 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 918 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 17:32:31,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 912 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 637 Invalid, 0 Unknown, 918 Unchecked, 0.8s Time] [2022-07-21 17:32:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-21 17:32:31,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 171. [2022-07-21 17:32:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 148 states have (on average 1.2432432432432432) internal successors, (184), 170 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 184 transitions. [2022-07-21 17:32:31,813 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 184 transitions. Word has length 37 [2022-07-21 17:32:31,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:32:31,813 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 184 transitions. [2022-07-21 17:32:31,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 28 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 184 transitions. [2022-07-21 17:32:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:32:31,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:32:31,814 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:32:31,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-21 17:32:32,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:32:32,023 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:32:32,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:32:32,024 INFO L85 PathProgramCache]: Analyzing trace with hash 60416495, now seen corresponding path program 1 times [2022-07-21 17:32:32,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:32:32,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889834041] [2022-07-21 17:32:32,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:32,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:32:32,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:32:32,026 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:32:32,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-21 17:32:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:32,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-21 17:32:32,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:32:32,240 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-21 17:32:32,240 INFO L390 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 12 treesize of output 21 [2022-07-21 17:32:32,309 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-21 17:32:32,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-21 17:32:32,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:32:32,506 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:32:32,507 INFO L390 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 44 treesize of output 43 [2022-07-21 17:32:32,673 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:32:32,674 INFO L390 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 47 treesize of output 43 [2022-07-21 17:32:32,734 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:32:32,735 INFO L390 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 44 treesize of output 43 [2022-07-21 17:32:33,201 INFO L390 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 41 treesize of output 25 [2022-07-21 17:32:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:33,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:32:33,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1277))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1279)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-21 17:32:33,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1277))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1279)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-21 17:32:33,728 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:33,728 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-07-21 17:32:33,747 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:33,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2022-07-21 17:32:33,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 204 [2022-07-21 17:32:33,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:33,767 INFO L390 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 204 treesize of output 196 [2022-07-21 17:32:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:56,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:32:56,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889834041] [2022-07-21 17:32:56,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889834041] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:32:56,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:32:56,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 25 [2022-07-21 17:32:56,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189439337] [2022-07-21 17:32:56,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:32:56,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 17:32:56,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:32:56,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 17:32:56,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=451, Unknown=13, NotChecked=90, Total=650 [2022-07-21 17:32:56,258 INFO L87 Difference]: Start difference. First operand 171 states and 184 transitions. Second operand has 26 states, 25 states have (on average 3.12) internal successors, (78), 26 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:32:56,810 INFO L93 Difference]: Finished difference Result 185 states and 201 transitions. [2022-07-21 17:32:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 17:32:56,811 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.12) internal successors, (78), 26 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-21 17:32:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:32:56,811 INFO L225 Difference]: With dead ends: 185 [2022-07-21 17:32:56,811 INFO L226 Difference]: Without dead ends: 185 [2022-07-21 17:32:56,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=161, Invalid=646, Unknown=13, NotChecked=110, Total=930 [2022-07-21 17:32:56,812 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 72 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 629 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:32:56,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 675 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 277 Invalid, 0 Unknown, 629 Unchecked, 0.3s Time] [2022-07-21 17:32:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-21 17:32:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2022-07-21 17:32:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 156 states have (on average 1.25) internal successors, (195), 178 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 195 transitions. [2022-07-21 17:32:56,814 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 195 transitions. Word has length 39 [2022-07-21 17:32:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:32:56,814 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 195 transitions. [2022-07-21 17:32:56,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.12) internal successors, (78), 26 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:32:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2022-07-21 17:32:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:32:56,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:32:56,815 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:32:56,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-07-21 17:32:57,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:32:57,015 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-21 17:32:57,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:32:57,015 INFO L85 PathProgramCache]: Analyzing trace with hash 60416496, now seen corresponding path program 1 times [2022-07-21 17:32:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:32:57,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557108185] [2022-07-21 17:32:57,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:32:57,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:32:57,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:32:57,017 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:32:57,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-21 17:32:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:32:57,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-21 17:32:57,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:32:57,204 INFO L390 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 [2022-07-21 17:32:57,229 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:32:57,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:32:57,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:32:57,254 INFO L390 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 [2022-07-21 17:32:57,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:32:57,328 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:32:57,329 INFO L390 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 38 treesize of output 37 [2022-07-21 17:32:57,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 17:32:57,403 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:32:57,403 INFO L390 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 14 treesize of output 20 [2022-07-21 17:32:57,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:32:57,420 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:32:57,420 INFO L390 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 31 treesize of output 29 [2022-07-21 17:32:57,460 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:32:57,460 INFO L390 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 38 treesize of output 37 [2022-07-21 17:32:57,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 17:32:57,590 INFO L390 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 25 treesize of output 13 [2022-07-21 17:32:57,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:32:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:32:57,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:32:57,991 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1337 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-07-21 17:32:58,027 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1337) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1337 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1337) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1336) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-07-21 17:32:58,048 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1337) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1336) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (forall ((v_ArrVal_1337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1337) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32)))))) is different from false [2022-07-21 17:32:58,159 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1332) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1333) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1337) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_1332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1333))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1332) .cse1 v_ArrVal_1337) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1336) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) is different from false [2022-07-21 17:32:58,482 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1333))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1332) .cse1 v_ArrVal_1337) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1336) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (forall ((v_ArrVal_1332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1332) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1333) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1337)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32)))))) is different from false [2022-07-21 17:32:58,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:58,522 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-07-21 17:32:58,531 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:58,532 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-07-21 17:32:58,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:58,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 334 treesize of output 301 [2022-07-21 17:32:58,587 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:58,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 950 treesize of output 909 [2022-07-21 17:32:58,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 894 treesize of output 854 [2022-07-21 17:32:58,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 854 treesize of output 838 [2022-07-21 17:32:58,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 838 treesize of output 798 [2022-07-21 17:32:58,640 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:32:58,642 INFO L390 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 798 treesize of output 730 [2022-07-21 17:34:47,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:34:47,450 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2022-07-21 17:34:47,455 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:34:47,455 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2022-07-21 17:34:47,459 INFO L390 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 84 treesize of output 72 [2022-07-21 17:34:47,480 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:34:47,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 131 [2022-07-21 17:34:47,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-07-21 17:34:47,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2022-07-21 17:34:47,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 92 [2022-07-21 17:34:50,236 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-21 17:34:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:50,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:34:50,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557108185] [2022-07-21 17:34:50,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557108185] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:34:50,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:34:50,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2022-07-21 17:34:50,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790677143] [2022-07-21 17:34:50,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:34:50,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 17:34:50,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:34:50,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 17:34:50,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=291, Unknown=5, NotChecked=190, Total=552 [2022-07-21 17:34:50,322 INFO L87 Difference]: Start difference. First operand 179 states and 195 transitions. Second operand has 24 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 24 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)