./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f4b24e32 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/sll-queue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 05:50:23,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:50:23,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:50:23,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:50:23,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:50:23,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:50:23,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:50:23,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:50:23,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:50:23,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:50:23,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:50:23,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:50:23,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:50:23,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:50:23,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:50:23,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:50:23,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:50:23,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:50:23,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:50:23,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:50:23,114 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:50:23,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:50:23,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:50:23,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:50:23,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:50:23,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:50:23,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:50:23,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:50:23,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:50:23,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:50:23,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:50:23,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:50:23,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:50:23,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:50:23,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:50:23,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:50:23,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:50:23,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:50:23,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:50:23,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:50:23,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:50:23,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:50:23,132 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-14 05:50:23,157 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:50:23,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:50:23,158 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:50:23,158 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:50:23,159 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:50:23,159 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:50:23,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:50:23,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:50:23,160 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:50:23,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:50:23,160 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:50:23,161 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:50:23,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:50:23,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:50:23,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:50:23,161 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:50:23,161 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:50:23,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:50:23,161 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:50:23,162 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:50:23,162 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:50:23,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:50:23,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:50:23,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:50:23,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:23,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:50:23,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:50:23,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 05:50:23,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 05:50:23,163 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 [2022-07-14 05:50:23,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:50:23,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:50:23,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:50:23,383 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:50:23,383 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:50:23,384 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-07-14 05:50:23,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f8f0045/6adcaa85b60c42a59a7997291c8fcf2c/FLAGdf3f051b4 [2022-07-14 05:50:23,803 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:50:23,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-07-14 05:50:23,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f8f0045/6adcaa85b60c42a59a7997291c8fcf2c/FLAGdf3f051b4 [2022-07-14 05:50:24,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f8f0045/6adcaa85b60c42a59a7997291c8fcf2c [2022-07-14 05:50:24,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:50:24,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:50:24,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:24,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:50:24,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:50:24,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:24" (1/1) ... [2022-07-14 05:50:24,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d84e4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:24, skipping insertion in model container [2022-07-14 05:50:24,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:24" (1/1) ... [2022-07-14 05:50:24,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:50:24,245 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:50:24,438 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/sll-queue-2.i[22387,22400] [2022-07-14 05:50:24,441 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/sll-queue-2.i[22458,22471] [2022-07-14 05:50:24,442 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/sll-queue-2.i[22532,22545] [2022-07-14 05:50:24,443 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/sll-queue-2.i[22624,22637] [2022-07-14 05:50:24,443 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/sll-queue-2.i[22701,22714] [2022-07-14 05:50:24,445 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/sll-queue-2.i[22796,22809] [2022-07-14 05:50:24,445 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/sll-queue-2.i[22873,22886] [2022-07-14 05:50:24,446 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/sll-queue-2.i[22956,22969] [2022-07-14 05:50:24,447 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/sll-queue-2.i[23051,23064] [2022-07-14 05:50:24,447 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/sll-queue-2.i[23128,23141] [2022-07-14 05:50:24,448 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/sll-queue-2.i[23211,23224] [2022-07-14 05:50:24,449 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/sll-queue-2.i[23300,23313] [2022-07-14 05:50:24,449 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/sll-queue-2.i[23386,23399] [2022-07-14 05:50:24,450 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/sll-queue-2.i[23532,23545] [2022-07-14 05:50:24,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:24,459 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 05:50:24,480 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/sll-queue-2.i[22387,22400] [2022-07-14 05:50:24,481 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/sll-queue-2.i[22458,22471] [2022-07-14 05:50:24,481 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/sll-queue-2.i[22532,22545] [2022-07-14 05:50:24,482 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/sll-queue-2.i[22624,22637] [2022-07-14 05:50:24,482 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/sll-queue-2.i[22701,22714] [2022-07-14 05:50:24,483 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/sll-queue-2.i[22796,22809] [2022-07-14 05:50:24,483 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/sll-queue-2.i[22873,22886] [2022-07-14 05:50:24,484 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/sll-queue-2.i[22956,22969] [2022-07-14 05:50:24,484 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/sll-queue-2.i[23051,23064] [2022-07-14 05:50:24,485 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/sll-queue-2.i[23128,23141] [2022-07-14 05:50:24,485 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/sll-queue-2.i[23211,23224] [2022-07-14 05:50:24,486 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/sll-queue-2.i[23300,23313] [2022-07-14 05:50:24,487 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/sll-queue-2.i[23386,23399] [2022-07-14 05:50:24,488 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/sll-queue-2.i[23532,23545] [2022-07-14 05:50:24,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:24,507 INFO L208 MainTranslator]: Completed translation [2022-07-14 05:50:24,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:24 WrapperNode [2022-07-14 05:50:24,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:24,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:24,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 05:50:24,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 05:50:24,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:24" (1/1) ... [2022-07-14 05:50:24,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:24" (1/1) ... [2022-07-14 05:50:24,540 INFO L137 Inliner]: procedures = 119, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 222 [2022-07-14 05:50:24,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:24,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 05:50:24,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 05:50:24,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 05:50:24,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:24" (1/1) ... [2022-07-14 05:50:24,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:24" (1/1) ... [2022-07-14 05:50:24,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:24" (1/1) ... [2022-07-14 05:50:24,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:24" (1/1) ... [2022-07-14 05:50:24,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:24" (1/1) ... [2022-07-14 05:50:24,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:24" (1/1) ... [2022-07-14 05:50:24,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:24" (1/1) ... [2022-07-14 05:50:24,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 05:50:24,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 05:50:24,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 05:50:24,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 05:50:24,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:24" (1/1) ... [2022-07-14 05:50:24,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:24,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:24,599 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-14 05:50:24,621 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-14 05:50:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 05:50:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 05:50:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 05:50:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 05:50:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 05:50:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 05:50:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 05:50:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 05:50:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 05:50:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 05:50:24,708 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 05:50:24,710 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 05:50:25,076 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 05:50:25,081 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 05:50:25,083 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-14 05:50:25,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:25 BoogieIcfgContainer [2022-07-14 05:50:25,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 05:50:25,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 05:50:25,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 05:50:25,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 05:50:25,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 05:50:24" (1/3) ... [2022-07-14 05:50:25,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4523d11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:25, skipping insertion in model container [2022-07-14 05:50:25,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:24" (2/3) ... [2022-07-14 05:50:25,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4523d11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:25, skipping insertion in model container [2022-07-14 05:50:25,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:25" (3/3) ... [2022-07-14 05:50:25,092 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2022-07-14 05:50:25,102 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 05:50:25,102 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-07-14 05:50:25,140 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 05:50:25,145 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@2dd622c3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5464f450 [2022-07-14 05:50:25,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-07-14 05:50:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 100 states have (on average 2.26) internal successors, (226), 170 states have internal predecessors, (226), 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-14 05:50:25,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 05:50:25,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:25,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 05:50:25,154 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:25,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:25,158 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 05:50:25,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:25,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71225077] [2022-07-14 05:50:25,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:25,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:25,286 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-14 05:50:25,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:25,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71225077] [2022-07-14 05:50:25,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71225077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:25,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:25,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:25,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760274704] [2022-07-14 05:50:25,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:25,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:25,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:25,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:25,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:25,317 INFO L87 Difference]: Start difference. First operand has 171 states, 100 states have (on average 2.26) internal successors, (226), 170 states have internal predecessors, (226), 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-14 05:50:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:25,446 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-07-14 05:50:25,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:25,448 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-14 05:50:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:25,458 INFO L225 Difference]: With dead ends: 169 [2022-07-14 05:50:25,459 INFO L226 Difference]: Without dead ends: 165 [2022-07-14 05:50:25,461 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-14 05:50:25,464 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 160 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:25,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 109 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:25,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-14 05:50:25,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2022-07-14 05:50:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 101 states have (on average 1.7128712871287128) internal successors, (173), 160 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-14 05:50:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2022-07-14 05:50:25,515 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 3 [2022-07-14 05:50:25,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:25,515 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2022-07-14 05:50:25,515 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-14 05:50:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2022-07-14 05:50:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 05:50:25,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:25,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 05:50:25,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 05:50:25,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:25,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:25,517 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 05:50:25,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:25,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945427541] [2022-07-14 05:50:25,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:25,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:25,578 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-14 05:50:25,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:25,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945427541] [2022-07-14 05:50:25,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945427541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:25,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:25,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:25,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771344237] [2022-07-14 05:50:25,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:25,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:25,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:25,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:25,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:25,586 INFO L87 Difference]: Start difference. First operand 161 states and 173 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-14 05:50:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:25,675 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-07-14 05:50:25,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:25,680 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-14 05:50:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:25,682 INFO L225 Difference]: With dead ends: 155 [2022-07-14 05:50:25,682 INFO L226 Difference]: Without dead ends: 155 [2022-07-14 05:50:25,683 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-14 05:50:25,683 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 147 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:25,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 112 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:25,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-14 05:50:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2022-07-14 05:50:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 101 states have (on average 1.603960396039604) internal successors, (162), 150 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-14 05:50:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2022-07-14 05:50:25,693 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 3 [2022-07-14 05:50:25,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:25,693 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2022-07-14 05:50:25,694 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-14 05:50:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2022-07-14 05:50:25,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 05:50:25,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:25,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:25,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 05:50:25,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:25,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:25,695 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2022-07-14 05:50:25,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:25,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762361693] [2022-07-14 05:50:25,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:25,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:25,775 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-14 05:50:25,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:25,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762361693] [2022-07-14 05:50:25,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762361693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:25,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:25,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:25,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822083969] [2022-07-14 05:50:25,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:25,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:50:25,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:25,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:50:25,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:50:25,778 INFO L87 Difference]: Start difference. First operand 151 states and 162 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-14 05:50:25,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:25,865 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2022-07-14 05:50:25,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:25,866 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-14 05:50:25,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:25,866 INFO L225 Difference]: With dead ends: 161 [2022-07-14 05:50:25,866 INFO L226 Difference]: Without dead ends: 161 [2022-07-14 05:50:25,867 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-14 05:50:25,868 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 260 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:25,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 116 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-14 05:50:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2022-07-14 05:50:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.5555555555555556) internal successors, (168), 152 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-14 05:50:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2022-07-14 05:50:25,873 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 8 [2022-07-14 05:50:25,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:25,873 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2022-07-14 05:50:25,873 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-14 05:50:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2022-07-14 05:50:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 05:50:25,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:25,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:25,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 05:50:25,874 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:25,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:25,875 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2022-07-14 05:50:25,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:25,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937114266] [2022-07-14 05:50:25,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:25,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:25,918 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-14 05:50:25,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:25,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937114266] [2022-07-14 05:50:25,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937114266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:25,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:25,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:25,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740892230] [2022-07-14 05:50:25,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:25,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:50:25,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:25,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:50:25,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:50:25,921 INFO L87 Difference]: Start difference. First operand 153 states and 168 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-14 05:50:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:26,104 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2022-07-14 05:50:26,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:26,105 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-14 05:50:26,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:26,106 INFO L225 Difference]: With dead ends: 244 [2022-07-14 05:50:26,106 INFO L226 Difference]: Without dead ends: 244 [2022-07-14 05:50:26,106 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-14 05:50:26,110 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 318 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:26,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 184 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-14 05:50:26,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 158. [2022-07-14 05:50:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.5309734513274336) internal successors, (173), 157 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-14 05:50:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2022-07-14 05:50:26,118 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 8 [2022-07-14 05:50:26,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:26,119 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2022-07-14 05:50:26,119 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-14 05:50:26,119 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2022-07-14 05:50:26,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 05:50:26,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:26,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:26,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 05:50:26,120 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:26,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:26,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1837174119, now seen corresponding path program 1 times [2022-07-14 05:50:26,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:26,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286780599] [2022-07-14 05:50:26,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:26,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:26,141 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-14 05:50:26,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:26,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286780599] [2022-07-14 05:50:26,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286780599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:26,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:26,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:26,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612943138] [2022-07-14 05:50:26,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:26,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:26,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:26,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:26,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:26,144 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-14 05:50:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:26,165 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2022-07-14 05:50:26,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:26,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-14 05:50:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:26,166 INFO L225 Difference]: With dead ends: 148 [2022-07-14 05:50:26,166 INFO L226 Difference]: Without dead ends: 148 [2022-07-14 05:50:26,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-14 05:50:26,167 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 125 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:26,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-14 05:50:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-07-14 05:50:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.5) internal successors, (162), 147 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-14 05:50:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2022-07-14 05:50:26,172 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 9 [2022-07-14 05:50:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:26,172 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2022-07-14 05:50:26,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-14 05:50:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2022-07-14 05:50:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 05:50:26,173 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:26,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:26,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 05:50:26,173 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:26,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:26,173 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-07-14 05:50:26,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:26,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304973959] [2022-07-14 05:50:26,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:26,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:26,213 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-14 05:50:26,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:26,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304973959] [2022-07-14 05:50:26,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304973959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:26,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:26,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:26,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528493137] [2022-07-14 05:50:26,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:26,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:26,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:26,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:26,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:26,215 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-14 05:50:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:26,417 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2022-07-14 05:50:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:50:26,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-14 05:50:26,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:26,419 INFO L225 Difference]: With dead ends: 219 [2022-07-14 05:50:26,419 INFO L226 Difference]: Without dead ends: 219 [2022-07-14 05:50:26,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:50:26,419 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 110 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:26,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 682 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:26,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-14 05:50:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 147. [2022-07-14 05:50:26,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 146 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-14 05:50:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2022-07-14 05:50:26,423 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 12 [2022-07-14 05:50:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:26,423 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2022-07-14 05:50:26,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-14 05:50:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2022-07-14 05:50:26,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 05:50:26,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:26,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:26,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 05:50:26,424 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:26,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:26,424 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-07-14 05:50:26,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:26,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070477077] [2022-07-14 05:50:26,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:26,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:26,480 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-14 05:50:26,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:26,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070477077] [2022-07-14 05:50:26,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070477077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:26,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:26,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:26,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878728568] [2022-07-14 05:50:26,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:26,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:26,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:26,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:26,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:26,481 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-14 05:50:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:26,678 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2022-07-14 05:50:26,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 05:50:26,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-14 05:50:26,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:26,679 INFO L225 Difference]: With dead ends: 211 [2022-07-14 05:50:26,679 INFO L226 Difference]: Without dead ends: 211 [2022-07-14 05:50:26,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-14 05:50:26,680 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 97 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:26,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 676 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:26,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-14 05:50:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 136. [2022-07-14 05:50:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 135 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-14 05:50:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2022-07-14 05:50:26,683 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 12 [2022-07-14 05:50:26,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:26,683 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2022-07-14 05:50:26,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-14 05:50:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2022-07-14 05:50:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 05:50:26,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:26,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:26,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 05:50:26,684 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:26,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:26,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1603335132, now seen corresponding path program 1 times [2022-07-14 05:50:26,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:26,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943922196] [2022-07-14 05:50:26,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:26,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:26,719 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-14 05:50:26,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:26,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943922196] [2022-07-14 05:50:26,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943922196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:26,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:26,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309225110] [2022-07-14 05:50:26,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:26,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:26,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:26,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:26,722 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-14 05:50:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:26,753 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-07-14 05:50:26,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:26,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-14 05:50:26,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:26,754 INFO L225 Difference]: With dead ends: 191 [2022-07-14 05:50:26,754 INFO L226 Difference]: Without dead ends: 191 [2022-07-14 05:50:26,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-14 05:50:26,755 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 47 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:26,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 250 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-14 05:50:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 149. [2022-07-14 05:50:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.4051724137931034) internal successors, (163), 148 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-14 05:50:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2022-07-14 05:50:26,758 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 15 [2022-07-14 05:50:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:26,758 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2022-07-14 05:50:26,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-14 05:50:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2022-07-14 05:50:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 05:50:26,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:26,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:26,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 05:50:26,764 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:26,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:26,765 INFO L85 PathProgramCache]: Analyzing trace with hash -775737061, now seen corresponding path program 1 times [2022-07-14 05:50:26,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:26,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196194655] [2022-07-14 05:50:26,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:26,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:26,815 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-14 05:50:26,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:26,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196194655] [2022-07-14 05:50:26,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196194655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:26,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:26,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:26,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393309097] [2022-07-14 05:50:26,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:26,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:26,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:26,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:26,817 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-14 05:50:26,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:26,905 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2022-07-14 05:50:26,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 05:50:26,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2022-07-14 05:50:26,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:26,906 INFO L225 Difference]: With dead ends: 149 [2022-07-14 05:50:26,906 INFO L226 Difference]: Without dead ends: 149 [2022-07-14 05:50:26,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-14 05:50:26,907 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 90 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:26,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 541 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-14 05:50:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2022-07-14 05:50:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 115 states have (on average 1.4) internal successors, (161), 146 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-14 05:50:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2022-07-14 05:50:26,910 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 19 [2022-07-14 05:50:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:26,911 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2022-07-14 05:50:26,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-14 05:50:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2022-07-14 05:50:26,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 05:50:26,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:26,911 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-14 05:50:26,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 05:50:26,912 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:26,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:26,912 INFO L85 PathProgramCache]: Analyzing trace with hash 73317399, now seen corresponding path program 1 times [2022-07-14 05:50:26,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:26,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47329937] [2022-07-14 05:50:26,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:26,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:26,985 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-14 05:50:26,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:26,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47329937] [2022-07-14 05:50:26,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47329937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:26,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:26,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:26,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25094315] [2022-07-14 05:50:26,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:26,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:26,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:26,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:26,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:26,987 INFO L87 Difference]: Start difference. First operand 147 states and 161 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-14 05:50:27,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:27,079 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2022-07-14 05:50:27,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:50:27,079 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-14 05:50:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:27,080 INFO L225 Difference]: With dead ends: 156 [2022-07-14 05:50:27,080 INFO L226 Difference]: Without dead ends: 156 [2022-07-14 05:50:27,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:27,081 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 8 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:27,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 572 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:27,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-14 05:50:27,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2022-07-14 05:50:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 151 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-14 05:50:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2022-07-14 05:50:27,084 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 20 [2022-07-14 05:50:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:27,084 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2022-07-14 05:50:27,084 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-14 05:50:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-07-14 05:50:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 05:50:27,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:27,085 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-14 05:50:27,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 05:50:27,086 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:27,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:27,087 INFO L85 PathProgramCache]: Analyzing trace with hash -800612379, now seen corresponding path program 1 times [2022-07-14 05:50:27,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:27,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064126547] [2022-07-14 05:50:27,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:27,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:27,117 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-14 05:50:27,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:27,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064126547] [2022-07-14 05:50:27,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064126547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:27,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:27,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:27,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952832022] [2022-07-14 05:50:27,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:27,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:27,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:27,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:27,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:27,119 INFO L87 Difference]: Start difference. First operand 152 states and 166 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-14 05:50:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:27,190 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2022-07-14 05:50:27,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:27,191 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-14 05:50:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:27,191 INFO L225 Difference]: With dead ends: 152 [2022-07-14 05:50:27,191 INFO L226 Difference]: Without dead ends: 152 [2022-07-14 05:50:27,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:27,192 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 125 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:27,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 296 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-14 05:50:27,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-07-14 05:50:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.375) internal successors, (165), 151 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-14 05:50:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-07-14 05:50:27,195 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 22 [2022-07-14 05:50:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:27,195 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-07-14 05:50:27,196 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-14 05:50:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-07-14 05:50:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 05:50:27,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:27,196 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] [2022-07-14 05:50:27,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 05:50:27,197 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:27,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:27,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1089542561, now seen corresponding path program 1 times [2022-07-14 05:50:27,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:27,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134721882] [2022-07-14 05:50:27,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:27,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:27,236 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-14 05:50:27,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:27,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134721882] [2022-07-14 05:50:27,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134721882] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:27,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340897074] [2022-07-14 05:50:27,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:27,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:27,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:27,252 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-14 05:50:27,256 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-14 05:50:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:27,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 05:50:27,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:27,441 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-14 05:50:27,448 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-14 05:50:27,471 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-14 05:50:27,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:27,569 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-14 05:50:27,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340897074] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:27,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:27,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 11 [2022-07-14 05:50:27,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094294333] [2022-07-14 05:50:27,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:27,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 05:50:27,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:27,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 05:50:27,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-14 05:50:27,572 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-14 05:50:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:27,812 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2022-07-14 05:50:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 05:50:27,813 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-14 05:50:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:27,814 INFO L225 Difference]: With dead ends: 181 [2022-07-14 05:50:27,814 INFO L226 Difference]: Without dead ends: 181 [2022-07-14 05:50:27,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-07-14 05:50:27,814 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 155 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:27,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 712 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-14 05:50:27,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 162. [2022-07-14 05:50:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 130 states have (on average 1.353846153846154) internal successors, (176), 161 states have internal predecessors, (176), 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-14 05:50:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2022-07-14 05:50:27,817 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 25 [2022-07-14 05:50:27,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:27,818 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2022-07-14 05:50:27,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-14 05:50:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2022-07-14 05:50:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 05:50:27,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:27,819 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-14 05:50:27,836 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-14 05:50:28,027 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,SelfDestructingSolverStorable11 [2022-07-14 05:50:28,028 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:28,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash 583917852, now seen corresponding path program 1 times [2022-07-14 05:50:28,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:28,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794340620] [2022-07-14 05:50:28,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:28,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:28,077 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-14 05:50:28,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:28,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794340620] [2022-07-14 05:50:28,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794340620] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:28,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384429808] [2022-07-14 05:50:28,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:28,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:28,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:28,086 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-14 05:50:28,087 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-14 05:50:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:28,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 05:50:28,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:28,199 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-14 05:50:28,228 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-14 05:50:28,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:28,270 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-14 05:50:28,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384429808] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:28,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:28,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-14 05:50:28,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746044843] [2022-07-14 05:50:28,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:28,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:28,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:28,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:28,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:28,272 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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-14 05:50:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:28,405 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2022-07-14 05:50:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:28,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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-14 05:50:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:28,406 INFO L225 Difference]: With dead ends: 172 [2022-07-14 05:50:28,406 INFO L226 Difference]: Without dead ends: 153 [2022-07-14 05:50:28,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:28,407 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 12 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:28,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 378 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:28,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-14 05:50:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-14 05:50:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.371900826446281) internal successors, (166), 152 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-14 05:50:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2022-07-14 05:50:28,409 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 26 [2022-07-14 05:50:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:28,409 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2022-07-14 05:50:28,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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-14 05:50:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2022-07-14 05:50:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 05:50:28,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:28,410 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-14 05:50:28,441 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-14 05:50:28,627 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,SelfDestructingSolverStorable12 [2022-07-14 05:50:28,627 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:28,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:28,628 INFO L85 PathProgramCache]: Analyzing trace with hash -370767273, now seen corresponding path program 1 times [2022-07-14 05:50:28,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:28,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224943142] [2022-07-14 05:50:28,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:28,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:28,757 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-14 05:50:28,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:28,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224943142] [2022-07-14 05:50:28,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224943142] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:28,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188609779] [2022-07-14 05:50:28,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:28,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:28,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:28,759 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-14 05:50:28,760 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-14 05:50:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:28,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-14 05:50:28,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:28,830 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-14 05:50:28,888 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:28,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 05:50:28,922 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:29,014 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:29,014 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 30 treesize of output 28 [2022-07-14 05:50:29,034 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:29,034 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 27 treesize of output 28 [2022-07-14 05:50:29,102 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 24 treesize of output 12 [2022-07-14 05:50:29,106 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-14 05:50:29,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:29,125 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-14 05:50:29,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-14 05:50:29,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-14 05:50:29,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:29,147 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 19 treesize of output 20 [2022-07-14 05:50:29,153 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:29,153 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 33 treesize of output 36 [2022-07-14 05:50:29,161 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 20 treesize of output 18 [2022-07-14 05:50:29,282 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-14 05:50:29,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188609779] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:29,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:29,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-07-14 05:50:29,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556698691] [2022-07-14 05:50:29,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:29,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 05:50:29,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:29,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 05:50:29,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=363, Unknown=3, NotChecked=120, Total=552 [2022-07-14 05:50:29,284 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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-14 05:50:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:30,032 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2022-07-14 05:50:30,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 05:50:30,033 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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-14 05:50:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:30,034 INFO L225 Difference]: With dead ends: 281 [2022-07-14 05:50:30,034 INFO L226 Difference]: Without dead ends: 281 [2022-07-14 05:50:30,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=749, Unknown=3, NotChecked=180, Total=1122 [2022-07-14 05:50:30,035 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 527 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 531 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:30,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1402 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 901 Invalid, 0 Unknown, 531 Unchecked, 0.4s Time] [2022-07-14 05:50:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-07-14 05:50:30,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 168. [2022-07-14 05:50:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 167 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-14 05:50:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2022-07-14 05:50:30,038 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 29 [2022-07-14 05:50:30,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:30,039 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2022-07-14 05:50:30,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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-14 05:50:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2022-07-14 05:50:30,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 05:50:30,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:30,040 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-14 05:50:30,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:30,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:30,257 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:30,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:30,258 INFO L85 PathProgramCache]: Analyzing trace with hash -751968760, now seen corresponding path program 1 times [2022-07-14 05:50:30,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:30,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81608548] [2022-07-14 05:50:30,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:30,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:30,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81608548] [2022-07-14 05:50:30,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81608548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:30,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:30,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:30,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754671950] [2022-07-14 05:50:30,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:30,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:30,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:30,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:30,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:30,280 INFO L87 Difference]: Start difference. First operand 168 states and 183 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-14 05:50:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:30,298 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2022-07-14 05:50:30,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:30,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-14 05:50:30,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:30,299 INFO L225 Difference]: With dead ends: 239 [2022-07-14 05:50:30,299 INFO L226 Difference]: Without dead ends: 239 [2022-07-14 05:50:30,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-14 05:50:30,300 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 55 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:30,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 245 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-14 05:50:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 186. [2022-07-14 05:50:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 185 states have internal predecessors, (201), 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-14 05:50:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 201 transitions. [2022-07-14 05:50:30,303 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 201 transitions. Word has length 30 [2022-07-14 05:50:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:30,303 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 201 transitions. [2022-07-14 05:50:30,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-14 05:50:30,304 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 201 transitions. [2022-07-14 05:50:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 05:50:30,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:30,304 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-14 05:50:30,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 05:50:30,304 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:30,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:30,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046208, now seen corresponding path program 1 times [2022-07-14 05:50:30,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:30,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301458939] [2022-07-14 05:50:30,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:30,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:30,470 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-14 05:50:30,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301458939] [2022-07-14 05:50:30,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301458939] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958283034] [2022-07-14 05:50:30,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:30,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:30,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:30,496 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-14 05:50:30,497 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-14 05:50:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:30,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 05:50:30,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:30,576 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-14 05:50:30,626 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 05:50:30,627 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-14 05:50:30,673 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-14 05:50:30,768 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:30,769 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-14 05:50:30,794 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:30,794 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-14 05:50:30,902 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-14 05:50:30,980 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-14 05:50:30,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:31,019 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2022-07-14 05:50:31,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2022-07-14 05:50:31,072 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:31,072 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-14 05:50:31,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:31,078 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 34 treesize of output 37 [2022-07-14 05:50:31,080 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-14 05:50:33,366 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-14 05:50:33,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958283034] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:33,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:33,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2022-07-14 05:50:33,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166082365] [2022-07-14 05:50:33,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:33,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-14 05:50:33,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:33,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-14 05:50:33,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=612, Unknown=10, NotChecked=106, Total=870 [2022-07-14 05:50:33,368 INFO L87 Difference]: Start difference. First operand 186 states and 201 transitions. Second operand has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 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-14 05:50:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:33,955 INFO L93 Difference]: Finished difference Result 247 states and 272 transitions. [2022-07-14 05:50:33,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 05:50:33,958 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 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-14 05:50:33,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:33,959 INFO L225 Difference]: With dead ends: 247 [2022-07-14 05:50:33,959 INFO L226 Difference]: Without dead ends: 247 [2022-07-14 05:50:33,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=344, Invalid=1294, Unknown=10, NotChecked=158, Total=1806 [2022-07-14 05:50:33,960 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 270 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 689 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:33,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1287 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 662 Invalid, 0 Unknown, 689 Unchecked, 0.3s Time] [2022-07-14 05:50:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-14 05:50:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 197. [2022-07-14 05:50:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 165 states have (on average 1.309090909090909) internal successors, (216), 196 states have internal predecessors, (216), 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-14 05:50:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 216 transitions. [2022-07-14 05:50:33,965 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 216 transitions. Word has length 39 [2022-07-14 05:50:33,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:33,965 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 216 transitions. [2022-07-14 05:50:33,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 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-14 05:50:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 216 transitions. [2022-07-14 05:50:33,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 05:50:33,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:33,966 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-14 05:50:34,001 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-14 05:50:34,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-14 05:50:34,184 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:34,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046209, now seen corresponding path program 1 times [2022-07-14 05:50:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:34,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159726281] [2022-07-14 05:50:34,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:34,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:34,458 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-14 05:50:34,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:34,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159726281] [2022-07-14 05:50:34,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159726281] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:34,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503885764] [2022-07-14 05:50:34,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:34,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:34,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:34,460 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-14 05:50:34,473 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-14 05:50:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:34,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-14 05:50:34,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:34,556 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-14 05:50:34,615 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:34,618 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-14 05:50:34,640 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-14 05:50:34,666 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-14 05:50:34,674 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-14 05:50:34,813 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:34,814 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-14 05:50:34,818 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-14 05:50:34,833 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:34,833 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-14 05:50:34,896 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:34,896 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-14 05:50:34,899 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-14 05:50:35,045 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-14 05:50:35,048 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-14 05:50:35,112 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-14 05:50:35,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:35,271 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-14 05:50:35,288 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)))) is different from false [2022-07-14 05:50:35,297 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4))) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-07-14 05:50:35,309 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:35,309 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-14 05:50:35,315 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:35,315 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 34 treesize of output 37 [2022-07-14 05:50:35,320 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-14 05:50:35,343 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:35,343 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 37 treesize of output 38 [2022-07-14 05:50:35,348 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:35,348 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 29 treesize of output 30 [2022-07-14 05:50:35,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:35,354 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 27 treesize of output 19 [2022-07-14 05:50:35,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:35,358 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 20 treesize of output 12 [2022-07-14 05:50:35,474 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-14 05:50:35,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503885764] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:35,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:35,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2022-07-14 05:50:35,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634923841] [2022-07-14 05:50:35,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:35,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-14 05:50:35,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:35,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-14 05:50:35,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2022-07-14 05:50:35,477 INFO L87 Difference]: Start difference. First operand 197 states and 216 transitions. Second operand has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 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-14 05:50:37,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:37,137 INFO L93 Difference]: Finished difference Result 325 states and 350 transitions. [2022-07-14 05:50:37,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-14 05:50:37,138 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 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-14 05:50:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:37,140 INFO L225 Difference]: With dead ends: 325 [2022-07-14 05:50:37,140 INFO L226 Difference]: Without dead ends: 325 [2022-07-14 05:50:37,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=471, Invalid=2294, Unknown=3, NotChecked=312, Total=3080 [2022-07-14 05:50:37,141 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1069 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 879 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:37,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1111 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1151 Invalid, 0 Unknown, 879 Unchecked, 0.6s Time] [2022-07-14 05:50:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-07-14 05:50:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 201. [2022-07-14 05:50:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 169 states have (on average 1.301775147928994) internal successors, (220), 200 states have internal predecessors, (220), 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-14 05:50:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 220 transitions. [2022-07-14 05:50:37,145 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 220 transitions. Word has length 39 [2022-07-14 05:50:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:37,146 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 220 transitions. [2022-07-14 05:50:37,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 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-14 05:50:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 220 transitions. [2022-07-14 05:50:37,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 05:50:37,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:37,147 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] [2022-07-14 05:50:37,165 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-14 05:50:37,365 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,SelfDestructingSolverStorable16 [2022-07-14 05:50:37,365 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:37,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:37,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1519790839, now seen corresponding path program 1 times [2022-07-14 05:50:37,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:37,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228906824] [2022-07-14 05:50:37,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:37,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 05:50:37,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:37,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228906824] [2022-07-14 05:50:37,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228906824] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:37,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:37,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:37,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872680434] [2022-07-14 05:50:37,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:37,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:37,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:37,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:37,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:37,435 INFO L87 Difference]: Start difference. First operand 201 states and 220 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-14 05:50:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:37,441 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2022-07-14 05:50:37,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:37,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 40 [2022-07-14 05:50:37,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:37,443 INFO L225 Difference]: With dead ends: 202 [2022-07-14 05:50:37,444 INFO L226 Difference]: Without dead ends: 202 [2022-07-14 05:50:37,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-14 05:50:37,445 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:37,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:37,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-14 05:50:37,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-07-14 05:50:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.2941176470588236) internal successors, (220), 201 states have internal predecessors, (220), 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-14 05:50:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 220 transitions. [2022-07-14 05:50:37,448 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 220 transitions. Word has length 40 [2022-07-14 05:50:37,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:37,448 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 220 transitions. [2022-07-14 05:50:37,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-14 05:50:37,448 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2022-07-14 05:50:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 05:50:37,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:37,449 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] [2022-07-14 05:50:37,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 05:50:37,450 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:37,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:37,450 INFO L85 PathProgramCache]: Analyzing trace with hash 231761564, now seen corresponding path program 1 times [2022-07-14 05:50:37,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:37,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754242739] [2022-07-14 05:50:37,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:37,741 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-14 05:50:37,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:37,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754242739] [2022-07-14 05:50:37,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754242739] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:37,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970250012] [2022-07-14 05:50:37,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:37,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:37,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:37,747 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-14 05:50:37,780 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-14 05:50:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:37,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-14 05:50:37,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:37,846 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-14 05:50:37,880 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:37,880 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-14 05:50:37,888 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-14 05:50:37,911 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-14 05:50:37,918 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-14 05:50:38,007 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:38,008 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-14 05:50:38,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:38,015 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 14 treesize of output 16 [2022-07-14 05:50:38,071 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:38,072 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 70 treesize of output 63 [2022-07-14 05:50:38,081 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 21 treesize of output 13 [2022-07-14 05:50:38,085 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-14 05:50:38,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-14 05:50:38,304 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 29 treesize of output 17 [2022-07-14 05:50:38,307 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-14 05:50:38,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:38,392 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:38,392 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 17 treesize of output 10 [2022-07-14 05:50:38,407 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-14 05:50:38,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:38,511 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 80 treesize of output 60 [2022-07-14 05:50:38,747 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:38,748 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 22 treesize of output 23 [2022-07-14 05:50:38,754 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:38,754 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 38 treesize of output 41 [2022-07-14 05:50:38,757 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-14 05:50:38,786 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:50:38,786 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 18 treesize of output 1 [2022-07-14 05:50:38,796 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:38,797 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 18 treesize of output 19 [2022-07-14 05:50:38,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:38,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:38,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:38,802 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 16 treesize of output 8 [2022-07-14 05:50:38,908 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-14 05:50:38,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970250012] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:38,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:38,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 37 [2022-07-14 05:50:38,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265560928] [2022-07-14 05:50:38,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:38,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-14 05:50:38,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:38,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-14 05:50:38,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2022-07-14 05:50:38,910 INFO L87 Difference]: Start difference. First operand 202 states and 220 transitions. Second operand has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 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-14 05:50:40,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:40,253 INFO L93 Difference]: Finished difference Result 315 states and 338 transitions. [2022-07-14 05:50:40,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 05:50:40,254 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 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-14 05:50:40,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:40,255 INFO L225 Difference]: With dead ends: 315 [2022-07-14 05:50:40,255 INFO L226 Difference]: Without dead ends: 315 [2022-07-14 05:50:40,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=419, Invalid=2887, Unknown=0, NotChecked=0, Total=3306 [2022-07-14 05:50:40,257 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 457 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 605 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:40,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 2102 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1241 Invalid, 0 Unknown, 605 Unchecked, 0.6s Time] [2022-07-14 05:50:40,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-14 05:50:40,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 201. [2022-07-14 05:50:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 200 states have internal predecessors, (218), 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-14 05:50:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2022-07-14 05:50:40,261 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 42 [2022-07-14 05:50:40,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:40,262 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2022-07-14 05:50:40,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 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-14 05:50:40,262 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2022-07-14 05:50:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 05:50:40,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:40,262 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, 1, 1] [2022-07-14 05:50:40,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:40,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:40,477 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:40,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995560, now seen corresponding path program 1 times [2022-07-14 05:50:40,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:40,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765320786] [2022-07-14 05:50:40,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:40,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:40,612 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-14 05:50:40,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:40,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765320786] [2022-07-14 05:50:40,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765320786] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:40,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125313239] [2022-07-14 05:50:40,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:40,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:40,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:40,614 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-14 05:50:40,615 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-14 05:50:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:40,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-14 05:50:40,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:40,699 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-14 05:50:40,740 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 05:50:40,741 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-14 05:50:40,766 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-14 05:50:40,847 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:40,847 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-14 05:50:40,871 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:40,872 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-14 05:50:41,008 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-14 05:50:41,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-14 05:50:41,061 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-14 05:50:41,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:41,142 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_681 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-14 05:50:41,154 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2022-07-14 05:50:41,159 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_681 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2022-07-14 05:50:41,165 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:41,165 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 19 treesize of output 20 [2022-07-14 05:50:41,170 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:41,170 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 33 treesize of output 36 [2022-07-14 05:50:41,172 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 20 treesize of output 18 [2022-07-14 05:50:41,185 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:41,185 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 20 treesize of output 21 [2022-07-14 05:50:41,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:41,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:41,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:41,190 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 18 treesize of output 10 [2022-07-14 05:50:41,272 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-14 05:50:41,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125313239] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:41,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:41,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-07-14 05:50:41,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698763781] [2022-07-14 05:50:41,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:41,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-14 05:50:41,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:41,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-14 05:50:41,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=539, Unknown=3, NotChecked=150, Total=812 [2022-07-14 05:50:41,275 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 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-14 05:50:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:41,753 INFO L93 Difference]: Finished difference Result 248 states and 269 transitions. [2022-07-14 05:50:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 05:50:41,754 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 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 44 [2022-07-14 05:50:41,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:41,754 INFO L225 Difference]: With dead ends: 248 [2022-07-14 05:50:41,755 INFO L226 Difference]: Without dead ends: 248 [2022-07-14 05:50:41,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=753, Unknown=3, NotChecked=180, Total=1122 [2022-07-14 05:50:41,755 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 376 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 591 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:41,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1160 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 849 Invalid, 0 Unknown, 591 Unchecked, 0.3s Time] [2022-07-14 05:50:41,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-14 05:50:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 224. [2022-07-14 05:50:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 192 states have (on average 1.3125) internal successors, (252), 223 states have internal predecessors, (252), 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-14 05:50:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 252 transitions. [2022-07-14 05:50:41,761 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 252 transitions. Word has length 44 [2022-07-14 05:50:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:41,761 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 252 transitions. [2022-07-14 05:50:41,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 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-14 05:50:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 252 transitions. [2022-07-14 05:50:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 05:50:41,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:41,762 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, 1, 1] [2022-07-14 05:50:41,781 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-14 05:50:41,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:41,979 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:41,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995559, now seen corresponding path program 1 times [2022-07-14 05:50:41,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:41,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176276996] [2022-07-14 05:50:41,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:41,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:42,155 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-14 05:50:42,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:42,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176276996] [2022-07-14 05:50:42,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176276996] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:42,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160375507] [2022-07-14 05:50:42,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:42,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:42,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:42,158 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-14 05:50:42,161 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-14 05:50:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:42,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-14 05:50:42,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:42,262 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-14 05:50:42,306 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-14 05:50:42,315 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:42,315 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-14 05:50:42,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 11 treesize of output 7 [2022-07-14 05:50:42,357 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-14 05:50:42,467 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:50:42,467 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-14 05:50:42,469 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-14 05:50:42,485 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:42,486 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-14 05:50:42,523 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:42,524 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-14 05:50:42,527 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-14 05:50:42,704 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-14 05:50:42,707 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-14 05:50:42,756 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-14 05:50:42,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:42,922 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-14 05:50:42,939 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-14 05:50:42,949 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-14 05:50:42,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:42,974 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 37 treesize of output 38 [2022-07-14 05:50:42,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:42,977 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 29 treesize of output 30 [2022-07-14 05:50:42,983 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:42,983 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 52 treesize of output 55 [2022-07-14 05:50:42,990 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:42,990 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 82 treesize of output 81 [2022-07-14 05:50:42,994 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 34 treesize of output 30 [2022-07-14 05:50:42,996 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 62 treesize of output 58 [2022-07-14 05:50:43,065 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:43,065 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 18 treesize of output 19 [2022-07-14 05:50:43,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:43,068 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 16 treesize of output 8 [2022-07-14 05:50:43,181 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-14 05:50:43,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160375507] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:43,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:43,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 29 [2022-07-14 05:50:43,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370794376] [2022-07-14 05:50:43,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:43,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-14 05:50:43,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:43,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-14 05:50:43,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=618, Unknown=3, NotChecked=156, Total=870 [2022-07-14 05:50:43,182 INFO L87 Difference]: Start difference. First operand 224 states and 252 transitions. Second operand has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 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-14 05:50:44,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:44,072 INFO L93 Difference]: Finished difference Result 247 states and 268 transitions. [2022-07-14 05:50:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 05:50:44,072 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 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 44 [2022-07-14 05:50:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:44,073 INFO L225 Difference]: With dead ends: 247 [2022-07-14 05:50:44,073 INFO L226 Difference]: Without dead ends: 247 [2022-07-14 05:50:44,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=293, Invalid=1198, Unknown=3, NotChecked=228, Total=1722 [2022-07-14 05:50:44,074 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 434 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 486 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:44,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1063 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 906 Invalid, 0 Unknown, 486 Unchecked, 0.4s Time] [2022-07-14 05:50:44,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-14 05:50:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 224. [2022-07-14 05:50:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 192 states have (on average 1.3072916666666667) internal successors, (251), 223 states have internal predecessors, (251), 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-14 05:50:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 251 transitions. [2022-07-14 05:50:44,077 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 251 transitions. Word has length 44 [2022-07-14 05:50:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:44,077 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 251 transitions. [2022-07-14 05:50:44,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 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-14 05:50:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 251 transitions. [2022-07-14 05:50:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 05:50:44,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:44,077 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:44,097 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-14 05:50:44,278 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,SelfDestructingSolverStorable20 [2022-07-14 05:50:44,278 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:44,279 INFO L85 PathProgramCache]: Analyzing trace with hash -64101254, now seen corresponding path program 1 times [2022-07-14 05:50:44,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:44,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865047710] [2022-07-14 05:50:44,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:44,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 05:50:44,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:44,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865047710] [2022-07-14 05:50:44,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865047710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:44,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:44,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:44,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657741228] [2022-07-14 05:50:44,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:44,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:44,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:44,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:44,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:44,333 INFO L87 Difference]: Start difference. First operand 224 states and 251 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-14 05:50:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:44,356 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2022-07-14 05:50:44,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:44,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 44 [2022-07-14 05:50:44,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:44,357 INFO L225 Difference]: With dead ends: 298 [2022-07-14 05:50:44,357 INFO L226 Difference]: Without dead ends: 298 [2022-07-14 05:50:44,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-14 05:50:44,371 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 64 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:44,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 282 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:44,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-14 05:50:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 242. [2022-07-14 05:50:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 210 states have (on average 1.2857142857142858) internal successors, (270), 241 states have internal predecessors, (270), 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-14 05:50:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2022-07-14 05:50:44,375 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 44 [2022-07-14 05:50:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:44,375 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2022-07-14 05:50:44,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-14 05:50:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2022-07-14 05:50:44,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 05:50:44,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:44,375 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-14 05:50:44,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 05:50:44,376 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:44,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:44,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2014223229, now seen corresponding path program 1 times [2022-07-14 05:50:44,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:44,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893870026] [2022-07-14 05:50:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:44,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 05:50:44,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:44,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893870026] [2022-07-14 05:50:44,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893870026] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:44,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977842325] [2022-07-14 05:50:44,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:44,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:44,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:44,456 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-14 05:50:44,486 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-14 05:50:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:44,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 05:50:44,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:44,597 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 17 [2022-07-14 05:50:44,598 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 21 treesize of output 13 [2022-07-14 05:50:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 05:50:44,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 05:50:44,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977842325] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:44,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:44,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-07-14 05:50:44,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671902735] [2022-07-14 05:50:44,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:44,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:44,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:44,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:44,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:44,657 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-14 05:50:44,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:44,735 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2022-07-14 05:50:44,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:44,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-14 05:50:44,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:44,736 INFO L225 Difference]: With dead ends: 283 [2022-07-14 05:50:44,736 INFO L226 Difference]: Without dead ends: 275 [2022-07-14 05:50:44,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:50:44,737 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 192 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:44,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 349 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-14 05:50:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 269. [2022-07-14 05:50:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 237 states have (on average 1.2827004219409284) internal successors, (304), 268 states have internal predecessors, (304), 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-14 05:50:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 304 transitions. [2022-07-14 05:50:44,740 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 304 transitions. Word has length 45 [2022-07-14 05:50:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:44,740 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 304 transitions. [2022-07-14 05:50:44,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-14 05:50:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 304 transitions. [2022-07-14 05:50:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 05:50:44,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:44,741 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:44,758 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-14 05:50:44,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:44,951 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:44,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:44,952 INFO L85 PathProgramCache]: Analyzing trace with hash 164743237, now seen corresponding path program 1 times [2022-07-14 05:50:44,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:44,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138629977] [2022-07-14 05:50:44,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:44,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:45,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:45,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138629977] [2022-07-14 05:50:45,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138629977] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:45,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147532742] [2022-07-14 05:50:45,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:45,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:45,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:45,192 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:45,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 05:50:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:45,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-14 05:50:45,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:45,325 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-14 05:50:45,376 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:45,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 05:50:45,406 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:45,498 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:45,499 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 30 treesize of output 28 [2022-07-14 05:50:45,515 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:45,516 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 30 treesize of output 28 [2022-07-14 05:50:45,562 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:45,563 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-14 05:50:45,594 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 05:50:45,594 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 1 case distinctions, treesize of input 35 treesize of output 26 [2022-07-14 05:50:45,703 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 05:50:45,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2022-07-14 05:50:45,712 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-14 05:50:45,782 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 05:50:45,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 55 [2022-07-14 05:50:45,800 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 16 treesize of output 12 [2022-07-14 05:50:45,865 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 24 treesize of output 12 [2022-07-14 05:50:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:45,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:45,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-14 05:50:45,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-14 05:50:45,894 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-14 05:50:45,898 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-14 05:50:45,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:45,954 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 05:50:45,959 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2022-07-14 05:50:45,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2022-07-14 05:50:45,978 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_68| Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_14 |v_ULTIMATE.start_main_~item~0#1.offset_68|))) (or (not (= 0 (select |c_#valid| .cse0))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2022-07-14 05:50:45,988 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:45,988 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 24 treesize of output 25 [2022-07-14 05:50:45,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:45,994 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 73 treesize of output 76 [2022-07-14 05:50:46,002 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:46,003 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 69 treesize of output 65 [2022-07-14 05:50:46,014 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 50 treesize of output 46 [2022-07-14 05:50:46,022 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 05:50:46,022 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 13 treesize of output 12 [2022-07-14 05:50:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-14 05:50:46,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147532742] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:46,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:46,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 40 [2022-07-14 05:50:46,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438984073] [2022-07-14 05:50:46,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:46,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-14 05:50:46,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:46,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-14 05:50:46,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=925, Unknown=7, NotChecked=476, Total=1560 [2022-07-14 05:50:46,148 INFO L87 Difference]: Start difference. First operand 269 states and 304 transitions. Second operand has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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-14 05:50:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:47,115 INFO L93 Difference]: Finished difference Result 336 states and 377 transitions. [2022-07-14 05:50:47,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 05:50:47,115 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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-14 05:50:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:47,117 INFO L225 Difference]: With dead ends: 336 [2022-07-14 05:50:47,117 INFO L226 Difference]: Without dead ends: 336 [2022-07-14 05:50:47,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=396, Invalid=1881, Unknown=7, NotChecked=686, Total=2970 [2022-07-14 05:50:47,118 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 385 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1233 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:47,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1431 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 967 Invalid, 0 Unknown, 1233 Unchecked, 0.4s Time] [2022-07-14 05:50:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-07-14 05:50:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 292. [2022-07-14 05:50:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 260 states have (on average 1.2615384615384615) internal successors, (328), 291 states have internal predecessors, (328), 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-14 05:50:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 328 transitions. [2022-07-14 05:50:47,122 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 328 transitions. Word has length 45 [2022-07-14 05:50:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:47,122 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 328 transitions. [2022-07-14 05:50:47,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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-14 05:50:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 328 transitions. [2022-07-14 05:50:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 05:50:47,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:47,133 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-07-14 05:50:47,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-14 05:50:47,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-14 05:50:47,343 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:47,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:47,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1983636472, now seen corresponding path program 1 times [2022-07-14 05:50:47,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:47,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213855465] [2022-07-14 05:50:47,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:47,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:47,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:47,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213855465] [2022-07-14 05:50:47,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213855465] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:47,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268135888] [2022-07-14 05:50:47,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:47,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:47,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:47,445 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:47,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 05:50:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:47,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-14 05:50:47,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:47,554 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-14 05:50:47,599 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:50:47,599 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-14 05:50:47,626 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-14 05:50:47,631 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-14 05:50:47,659 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-14 05:50:47,690 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 14 treesize of output 16 [2022-07-14 05:50:47,700 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 14 treesize of output 16 [2022-07-14 05:50:47,776 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-14 05:50:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:47,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:47,817 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-07-14 05:50:47,822 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-07-14 05:50:47,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-07-14 05:50:47,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:47,830 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 18 treesize of output 19 [2022-07-14 05:50:47,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:47,835 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 30 treesize of output 33 [2022-07-14 05:50:47,838 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 9 treesize of output 7 [2022-07-14 05:50:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:47,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268135888] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:47,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:47,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 24 [2022-07-14 05:50:47,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579802606] [2022-07-14 05:50:47,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:47,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-14 05:50:47,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:47,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 05:50:47,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=385, Unknown=3, NotChecked=126, Total=600 [2022-07-14 05:50:47,899 INFO L87 Difference]: Start difference. First operand 292 states and 328 transitions. Second operand has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 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-14 05:50:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:48,351 INFO L93 Difference]: Finished difference Result 301 states and 332 transitions. [2022-07-14 05:50:48,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 05:50:48,352 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 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 46 [2022-07-14 05:50:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:48,353 INFO L225 Difference]: With dead ends: 301 [2022-07-14 05:50:48,353 INFO L226 Difference]: Without dead ends: 301 [2022-07-14 05:50:48,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=828, Unknown=3, NotChecked=192, Total=1260 [2022-07-14 05:50:48,353 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 409 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:48,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1193 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 753 Invalid, 0 Unknown, 512 Unchecked, 0.3s Time] [2022-07-14 05:50:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-14 05:50:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 294. [2022-07-14 05:50:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 262 states have (on average 1.2595419847328244) internal successors, (330), 293 states have internal predecessors, (330), 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-14 05:50:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 330 transitions. [2022-07-14 05:50:48,358 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 330 transitions. Word has length 46 [2022-07-14 05:50:48,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:48,359 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 330 transitions. [2022-07-14 05:50:48,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 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-14 05:50:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 330 transitions. [2022-07-14 05:50:48,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 05:50:48,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:48,359 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-07-14 05:50:48,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:48,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-14 05:50:48,576 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:48,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:48,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1363188935, now seen corresponding path program 1 times [2022-07-14 05:50:48,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:48,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098883083] [2022-07-14 05:50:48,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:48,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:48,611 ERROR L253 erpolLogProxyWrapper]: Interpolant 9 not inductive [2022-07-14 05:50:48,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 05:50:48,621 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:233) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:879) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:803) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) 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-14 05:50:48,627 INFO L158 Benchmark]: Toolchain (without parser) took 24431.70ms. Allocated memory was 96.5MB in the beginning and 222.3MB in the end (delta: 125.8MB). Free memory was 68.8MB in the beginning and 185.1MB in the end (delta: -116.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-07-14 05:50:48,628 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 53.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 05:50:48,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.26ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 68.6MB in the beginning and 85.8MB in the end (delta: -17.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 05:50:48,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.87ms. Allocated memory is still 119.5MB. Free memory was 85.8MB in the beginning and 83.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 05:50:48,628 INFO L158 Benchmark]: Boogie Preprocessor took 32.36ms. Allocated memory is still 119.5MB. Free memory was 83.6MB in the beginning and 81.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 05:50:48,628 INFO L158 Benchmark]: RCFGBuilder took 511.85ms. Allocated memory is still 119.5MB. Free memory was 81.3MB in the beginning and 93.1MB in the end (delta: -11.9MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2022-07-14 05:50:48,632 INFO L158 Benchmark]: TraceAbstraction took 23539.06ms. Allocated memory was 119.5MB in the beginning and 222.3MB in the end (delta: 102.8MB). Free memory was 92.6MB in the beginning and 185.1MB in the end (delta: -92.5MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-07-14 05:50:48,633 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 53.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.26ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 68.6MB in the beginning and 85.8MB in the end (delta: -17.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.87ms. Allocated memory is still 119.5MB. Free memory was 85.8MB in the beginning and 83.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.36ms. Allocated memory is still 119.5MB. Free memory was 83.6MB in the beginning and 81.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 511.85ms. Allocated memory is still 119.5MB. Free memory was 81.3MB in the beginning and 93.1MB in the end (delta: -11.9MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23539.06ms. Allocated memory was 119.5MB in the beginning and 222.3MB in the end (delta: 102.8MB). Free memory was 92.6MB in the beginning and 185.1MB in the end (delta: -92.5MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:233) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 05:50:48,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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/sll-queue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 05:50:50,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:50:50,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:50:50,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:50:50,474 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:50:50,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:50:50,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:50:50,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:50:50,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:50:50,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:50:50,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:50:50,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:50:50,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:50:50,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:50:50,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:50:50,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:50:50,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:50:50,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:50:50,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:50:50,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:50:50,501 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:50:50,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:50:50,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:50:50,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:50:50,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:50:50,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:50:50,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:50:50,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:50:50,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:50:50,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:50:50,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:50:50,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:50:50,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:50:50,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:50:50,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:50:50,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:50:50,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:50:50,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:50:50,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:50:50,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:50:50,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:50:50,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:50:50,525 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-07-14 05:50:50,550 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:50:50,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:50:50,551 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:50:50,551 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:50:50,551 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:50:50,551 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:50:50,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:50:50,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:50:50,552 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:50:50,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:50:50,553 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:50:50,553 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:50:50,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:50:50,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:50:50,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:50:50,560 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:50:50,560 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:50:50,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:50:50,561 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:50:50,561 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 05:50:50,561 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 05:50:50,561 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:50:50,561 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:50:50,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:50:50,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:50:50,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:50:50,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:50,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:50:50,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:50:50,563 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 05:50:50,563 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 05:50:50,563 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 05:50:50,563 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 [2022-07-14 05:50:50,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:50:50,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:50:50,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:50:50,835 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:50:50,836 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:50:50,837 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-07-14 05:50:50,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca1fe5b53/11f13c4321194db28d0139b95163249c/FLAGd995807d0 [2022-07-14 05:50:51,316 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:50:51,317 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-07-14 05:50:51,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca1fe5b53/11f13c4321194db28d0139b95163249c/FLAGd995807d0 [2022-07-14 05:50:51,337 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca1fe5b53/11f13c4321194db28d0139b95163249c [2022-07-14 05:50:51,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:50:51,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:50:51,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:51,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:50:51,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:50:51,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:51" (1/1) ... [2022-07-14 05:50:51,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd57361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:51, skipping insertion in model container [2022-07-14 05:50:51,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:51" (1/1) ... [2022-07-14 05:50:51,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:50:51,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:50:51,665 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/sll-queue-2.i[22387,22400] [2022-07-14 05:50:51,669 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/sll-queue-2.i[22458,22471] [2022-07-14 05:50:51,670 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/sll-queue-2.i[22532,22545] [2022-07-14 05:50:51,671 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/sll-queue-2.i[22624,22637] [2022-07-14 05:50:51,672 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/sll-queue-2.i[22701,22714] [2022-07-14 05:50:51,674 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/sll-queue-2.i[22796,22809] [2022-07-14 05:50:51,675 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/sll-queue-2.i[22873,22886] [2022-07-14 05:50:51,675 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/sll-queue-2.i[22956,22969] [2022-07-14 05:50:51,677 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/sll-queue-2.i[23051,23064] [2022-07-14 05:50:51,678 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/sll-queue-2.i[23128,23141] [2022-07-14 05:50:51,681 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/sll-queue-2.i[23211,23224] [2022-07-14 05:50:51,682 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/sll-queue-2.i[23300,23313] [2022-07-14 05:50:51,683 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/sll-queue-2.i[23386,23399] [2022-07-14 05:50:51,684 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/sll-queue-2.i[23532,23545] [2022-07-14 05:50:51,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:51,706 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 05:50:51,741 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/sll-queue-2.i[22387,22400] [2022-07-14 05:50:51,742 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/sll-queue-2.i[22458,22471] [2022-07-14 05:50:51,742 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/sll-queue-2.i[22532,22545] [2022-07-14 05:50:51,743 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/sll-queue-2.i[22624,22637] [2022-07-14 05:50:51,743 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/sll-queue-2.i[22701,22714] [2022-07-14 05:50:51,744 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/sll-queue-2.i[22796,22809] [2022-07-14 05:50:51,744 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/sll-queue-2.i[22873,22886] [2022-07-14 05:50:51,745 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/sll-queue-2.i[22956,22969] [2022-07-14 05:50:51,745 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/sll-queue-2.i[23051,23064] [2022-07-14 05:50:51,745 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/sll-queue-2.i[23128,23141] [2022-07-14 05:50:51,746 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/sll-queue-2.i[23211,23224] [2022-07-14 05:50:51,747 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/sll-queue-2.i[23300,23313] [2022-07-14 05:50:51,747 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/sll-queue-2.i[23386,23399] [2022-07-14 05:50:51,748 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/sll-queue-2.i[23532,23545] [2022-07-14 05:50:51,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:51,769 INFO L208 MainTranslator]: Completed translation [2022-07-14 05:50:51,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:51 WrapperNode [2022-07-14 05:50:51,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:51,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:51,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 05:50:51,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 05:50:51,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:51" (1/1) ... [2022-07-14 05:50:51,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:51" (1/1) ... [2022-07-14 05:50:51,809 INFO L137 Inliner]: procedures = 122, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2022-07-14 05:50:51,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:51,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 05:50:51,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 05:50:51,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 05:50:51,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:51" (1/1) ... [2022-07-14 05:50:51,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:51" (1/1) ... [2022-07-14 05:50:51,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:51" (1/1) ... [2022-07-14 05:50:51,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:51" (1/1) ... [2022-07-14 05:50:51,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:51" (1/1) ... [2022-07-14 05:50:51,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:51" (1/1) ... [2022-07-14 05:50:51,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:51" (1/1) ... [2022-07-14 05:50:51,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 05:50:51,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 05:50:51,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 05:50:51,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 05:50:51,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:51" (1/1) ... [2022-07-14 05:50:51,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:51,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:51,893 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-14 05:50:51,902 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-14 05:50:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 05:50:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 05:50:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 05:50:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 05:50:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 05:50:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 05:50:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 05:50:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 05:50:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 05:50:51,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 05:50:52,059 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 05:50:52,060 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 05:50:52,577 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 05:50:52,582 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 05:50:52,582 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-14 05:50:52,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:52 BoogieIcfgContainer [2022-07-14 05:50:52,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 05:50:52,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 05:50:52,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 05:50:52,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 05:50:52,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 05:50:51" (1/3) ... [2022-07-14 05:50:52,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a6df58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:52, skipping insertion in model container [2022-07-14 05:50:52,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:51" (2/3) ... [2022-07-14 05:50:52,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a6df58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:52, skipping insertion in model container [2022-07-14 05:50:52,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:52" (3/3) ... [2022-07-14 05:50:52,589 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2022-07-14 05:50:52,603 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 05:50:52,603 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-07-14 05:50:52,646 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 05:50:52,652 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@7bee39a3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31a9e49b [2022-07-14 05:50:52,652 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-07-14 05:50:52,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 97 states have (on average 2.288659793814433) internal successors, (222), 167 states have internal predecessors, (222), 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-14 05:50:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 05:50:52,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:52,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 05:50:52,666 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:52,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:52,671 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 05:50:52,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:52,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710775580] [2022-07-14 05:50:52,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:52,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:52,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:52,682 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-14 05:50:52,690 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-14 05:50:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:52,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 05:50:52,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:52,777 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-14 05:50:52,784 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-14 05:50:52,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:52,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:52,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710775580] [2022-07-14 05:50:52,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710775580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:52,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:52,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:52,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018091666] [2022-07-14 05:50:52,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:52,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:52,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:52,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:52,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:52,806 INFO L87 Difference]: Start difference. First operand has 168 states, 97 states have (on average 2.288659793814433) internal successors, (222), 167 states have internal predecessors, (222), 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-14 05:50:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:53,015 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2022-07-14 05:50:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:53,017 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-14 05:50:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:53,022 INFO L225 Difference]: With dead ends: 166 [2022-07-14 05:50:53,022 INFO L226 Difference]: Without dead ends: 162 [2022-07-14 05:50:53,023 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-14 05:50:53,025 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 156 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:53,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 105 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-14 05:50:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2022-07-14 05:50:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 98 states have (on average 1.7244897959183674) internal successors, (169), 157 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-14 05:50:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2022-07-14 05:50:53,075 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 3 [2022-07-14 05:50:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:53,075 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2022-07-14 05:50:53,075 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-14 05:50:53,075 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2022-07-14 05:50:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 05:50:53,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:53,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 05:50:53,083 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-14 05:50:53,282 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-14 05:50:53,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:53,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:53,283 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 05:50:53,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:53,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008768674] [2022-07-14 05:50:53,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:53,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:53,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:53,285 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-14 05:50:53,287 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-14 05:50:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:53,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 05:50:53,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:53,326 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-14 05:50:53,336 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-14 05:50:53,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:53,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:53,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008768674] [2022-07-14 05:50:53,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008768674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:53,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:53,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:53,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916047652] [2022-07-14 05:50:53,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:53,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:53,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:53,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:53,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:53,339 INFO L87 Difference]: Start difference. First operand 158 states and 169 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-14 05:50:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:53,515 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2022-07-14 05:50:53,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:53,516 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-14 05:50:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:53,517 INFO L225 Difference]: With dead ends: 152 [2022-07-14 05:50:53,517 INFO L226 Difference]: Without dead ends: 152 [2022-07-14 05:50:53,518 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-14 05:50:53,519 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 143 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:53,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 108 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-14 05:50:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2022-07-14 05:50:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 98 states have (on average 1.6122448979591837) 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-14 05:50:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2022-07-14 05:50:53,534 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 3 [2022-07-14 05:50:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:53,536 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2022-07-14 05:50:53,536 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-14 05:50:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2022-07-14 05:50:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 05:50:53,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:53,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:53,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-14 05:50:53,743 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-14 05:50:53,743 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:53,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:53,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2022-07-14 05:50:53,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:53,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601086357] [2022-07-14 05:50:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:53,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:53,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:53,752 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-14 05:50:53,754 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-14 05:50:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:53,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 05:50:53,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:53,834 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-14 05:50:53,876 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 05:50:53,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, 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-14 05:50:53,893 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-14 05:50:53,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:53,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:53,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601086357] [2022-07-14 05:50:53,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601086357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:53,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:53,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:53,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367141375] [2022-07-14 05:50:53,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:53,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:50:53,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:53,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:50:53,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:50:53,898 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-14 05:50:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:54,082 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2022-07-14 05:50:54,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:54,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-07-14 05:50:54,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:54,084 INFO L225 Difference]: With dead ends: 158 [2022-07-14 05:50:54,084 INFO L226 Difference]: Without dead ends: 158 [2022-07-14 05:50:54,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-14 05:50:54,085 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 256 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:54,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 108 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:54,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-14 05:50:54,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2022-07-14 05:50:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 105 states have (on average 1.561904761904762) internal successors, (164), 149 states have internal predecessors, (164), 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-14 05:50:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2022-07-14 05:50:54,092 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 7 [2022-07-14 05:50:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:54,096 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2022-07-14 05:50:54,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-14 05:50:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2022-07-14 05:50:54,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 05:50:54,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:54,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:54,105 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-14 05:50:54,304 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-14 05:50:54,305 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:54,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:54,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2022-07-14 05:50:54,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:54,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645554367] [2022-07-14 05:50:54,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:54,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:54,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:54,311 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-14 05:50:54,313 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-14 05:50:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:54,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 05:50:54,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:54,385 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-14 05:50:54,441 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:50:54,442 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-14 05:50:54,454 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-14 05:50:54,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:54,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:54,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645554367] [2022-07-14 05:50:54,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645554367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:54,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:54,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:54,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610934832] [2022-07-14 05:50:54,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:54,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:50:54,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:54,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:50:54,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:50:54,458 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-14 05:50:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:54,728 INFO L93 Difference]: Finished difference Result 240 states and 255 transitions. [2022-07-14 05:50:54,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:54,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-07-14 05:50:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:54,729 INFO L225 Difference]: With dead ends: 240 [2022-07-14 05:50:54,729 INFO L226 Difference]: Without dead ends: 240 [2022-07-14 05:50:54,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-14 05:50:54,730 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 313 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:54,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 175 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:54,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-14 05:50:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 154. [2022-07-14 05:50:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 153 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-14 05:50:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2022-07-14 05:50:54,737 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 7 [2022-07-14 05:50:54,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:54,737 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2022-07-14 05:50:54,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-14 05:50:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2022-07-14 05:50:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 05:50:54,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:54,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:54,751 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-14 05:50:54,949 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-14 05:50:54,950 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash 59268142, now seen corresponding path program 1 times [2022-07-14 05:50:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:54,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879085544] [2022-07-14 05:50:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:54,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:54,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:54,953 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-14 05:50:54,963 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-14 05:50:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:55,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 05:50:55,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:55,018 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-14 05:50:55,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:55,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:55,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879085544] [2022-07-14 05:50:55,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879085544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:55,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:55,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:55,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739315449] [2022-07-14 05:50:55,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:55,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:55,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:55,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:55,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:55,020 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-14 05:50:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:55,061 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2022-07-14 05:50:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:55,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-14 05:50:55,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:55,064 INFO L225 Difference]: With dead ends: 144 [2022-07-14 05:50:55,064 INFO L226 Difference]: Without dead ends: 144 [2022-07-14 05:50:55,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-14 05:50:55,073 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 122 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:55,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 131 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-14 05:50:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-07-14 05:50:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 104 states have (on average 1.5096153846153846) internal successors, (157), 143 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-14 05:50:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2022-07-14 05:50:55,083 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 8 [2022-07-14 05:50:55,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:55,083 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2022-07-14 05:50:55,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-14 05:50:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2022-07-14 05:50:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:50:55,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:55,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:55,102 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-14 05:50:55,291 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-14 05:50:55,292 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:55,292 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2022-07-14 05:50:55,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:55,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509000275] [2022-07-14 05:50:55,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:55,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:55,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:55,296 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-14 05:50:55,297 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-14 05:50:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:55,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 05:50:55,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:55,391 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-14 05:50:55,401 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-14 05:50:55,428 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-14 05:50:55,442 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-14 05:50:55,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:55,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:55,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509000275] [2022-07-14 05:50:55,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509000275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:55,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:55,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:55,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797651661] [2022-07-14 05:50:55,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:55,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:55,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:55,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:55,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:55,443 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-14 05:50:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:55,847 INFO L93 Difference]: Finished difference Result 215 states and 229 transitions. [2022-07-14 05:50:55,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:50:55,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-14 05:50:55,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:55,848 INFO L225 Difference]: With dead ends: 215 [2022-07-14 05:50:55,848 INFO L226 Difference]: Without dead ends: 215 [2022-07-14 05:50:55,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:50:55,849 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 109 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:55,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 656 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 05:50:55,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-14 05:50:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 143. [2022-07-14 05:50:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.5) internal successors, (156), 142 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-14 05:50:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2022-07-14 05:50:55,854 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 11 [2022-07-14 05:50:55,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:55,854 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2022-07-14 05:50:55,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-14 05:50:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2022-07-14 05:50:55,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:50:55,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:55,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:55,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:56,061 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-14 05:50:56,062 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:56,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:56,063 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2022-07-14 05:50:56,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:56,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183414585] [2022-07-14 05:50:56,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:56,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:56,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:56,067 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-14 05:50:56,079 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-14 05:50:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:56,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 05:50:56,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:56,159 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-14 05:50:56,186 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-14 05:50:56,191 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-14 05:50:56,214 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-14 05:50:56,218 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-14 05:50:56,239 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-14 05:50:56,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:56,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:56,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183414585] [2022-07-14 05:50:56,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183414585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:56,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:56,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:56,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118997635] [2022-07-14 05:50:56,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:56,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:56,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:56,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:56,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:56,241 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-14 05:50:56,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:56,640 INFO L93 Difference]: Finished difference Result 207 states and 223 transitions. [2022-07-14 05:50:56,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 05:50:56,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-14 05:50:56,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:56,641 INFO L225 Difference]: With dead ends: 207 [2022-07-14 05:50:56,641 INFO L226 Difference]: Without dead ends: 207 [2022-07-14 05:50:56,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-14 05:50:56,642 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 96 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:56,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 650 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-14 05:50:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 133. [2022-07-14 05:50:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 100 states have (on average 1.45) internal successors, (145), 132 states have internal predecessors, (145), 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-14 05:50:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-07-14 05:50:56,646 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2022-07-14 05:50:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:56,650 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-07-14 05:50:56,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-14 05:50:56,650 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-07-14 05:50:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 05:50:56,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:56,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:56,658 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-14 05:50:56,858 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-14 05:50:56,858 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:56,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:56,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1469737219, now seen corresponding path program 1 times [2022-07-14 05:50:56,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:56,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325462334] [2022-07-14 05:50:56,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:56,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:56,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:56,860 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-14 05:50:56,862 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-14 05:50:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:56,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 05:50:56,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:56,910 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-14 05:50:56,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:56,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:56,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325462334] [2022-07-14 05:50:56,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325462334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:56,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:56,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:56,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065907961] [2022-07-14 05:50:56,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:56,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:56,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:56,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:56,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:56,912 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-14 05:50:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:56,930 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2022-07-14 05:50:56,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:56,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-14 05:50:56,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:56,931 INFO L225 Difference]: With dead ends: 185 [2022-07-14 05:50:56,931 INFO L226 Difference]: Without dead ends: 185 [2022-07-14 05:50:56,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-14 05:50:56,932 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 44 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:56,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 242 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-14 05:50:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2022-07-14 05:50:56,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.4107142857142858) internal successors, (158), 144 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-14 05:50:56,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2022-07-14 05:50:56,935 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 14 [2022-07-14 05:50:56,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:56,936 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2022-07-14 05:50:56,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-14 05:50:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2022-07-14 05:50:56,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 05:50:56,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:56,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:56,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-14 05:50:57,143 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-14 05:50:57,143 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:57,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:57,144 INFO L85 PathProgramCache]: Analyzing trace with hash -529144660, now seen corresponding path program 1 times [2022-07-14 05:50:57,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:57,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377927259] [2022-07-14 05:50:57,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:57,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:57,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:57,146 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-14 05:50:57,147 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-14 05:50:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:57,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 05:50:57,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:57,220 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-14 05:50:57,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:57,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:57,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377927259] [2022-07-14 05:50:57,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377927259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:57,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:57,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:57,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653469862] [2022-07-14 05:50:57,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:57,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:50:57,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:57,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:50:57,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:50:57,226 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-14 05:50:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:57,256 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2022-07-14 05:50:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:57,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2022-07-14 05:50:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:57,257 INFO L225 Difference]: With dead ends: 176 [2022-07-14 05:50:57,257 INFO L226 Difference]: Without dead ends: 176 [2022-07-14 05:50:57,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-14 05:50:57,259 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 31 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:57,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 361 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-14 05:50:57,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 154. [2022-07-14 05:50:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.396694214876033) internal successors, (169), 153 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-14 05:50:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2022-07-14 05:50:57,263 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 17 [2022-07-14 05:50:57,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:57,263 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2022-07-14 05:50:57,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-14 05:50:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2022-07-14 05:50:57,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 05:50:57,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:57,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:57,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-14 05:50:57,470 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-14 05:50:57,471 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:57,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:57,473 INFO L85 PathProgramCache]: Analyzing trace with hash 271532674, now seen corresponding path program 1 times [2022-07-14 05:50:57,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:57,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121275673] [2022-07-14 05:50:57,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:57,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:57,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:57,475 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-14 05:50:57,497 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-14 05:50:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:57,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 05:50:57,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:57,554 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-14 05:50:57,563 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-14 05:50:57,582 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-14 05:50:57,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:57,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:57,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121275673] [2022-07-14 05:50:57,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121275673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:57,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:57,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:50:57,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879842322] [2022-07-14 05:50:57,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:57,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:57,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:57,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:57,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:57,584 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-14 05:50:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:57,757 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2022-07-14 05:50:57,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 05:50:57,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2022-07-14 05:50:57,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:57,758 INFO L225 Difference]: With dead ends: 152 [2022-07-14 05:50:57,758 INFO L226 Difference]: Without dead ends: 152 [2022-07-14 05:50:57,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-14 05:50:57,759 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 89 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:57,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 515 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:57,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-14 05:50:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-07-14 05:50:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 151 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-14 05:50:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2022-07-14 05:50:57,761 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 18 [2022-07-14 05:50:57,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:57,761 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2022-07-14 05:50:57,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-14 05:50:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2022-07-14 05:50:57,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 05:50:57,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:57,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:57,769 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-14 05:50:57,969 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-14 05:50:57,969 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:57,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:57,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1721073736, now seen corresponding path program 1 times [2022-07-14 05:50:57,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:57,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093519547] [2022-07-14 05:50:57,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:57,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:57,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:57,977 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-14 05:50:58,010 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-14 05:50:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:58,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 05:50:58,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:58,100 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-14 05:50:58,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:58,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:58,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093519547] [2022-07-14 05:50:58,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093519547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:58,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:58,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:58,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224056444] [2022-07-14 05:50:58,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:58,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:58,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:58,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:58,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:58,101 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-14 05:50:58,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:58,226 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2022-07-14 05:50:58,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:58,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2022-07-14 05:50:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:58,227 INFO L225 Difference]: With dead ends: 156 [2022-07-14 05:50:58,227 INFO L226 Difference]: Without dead ends: 156 [2022-07-14 05:50:58,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:58,228 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 262 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:58,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 201 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:58,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-14 05:50:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2022-07-14 05:50:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 151 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-14 05:50:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2022-07-14 05:50:58,230 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 19 [2022-07-14 05:50:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:58,230 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2022-07-14 05:50:58,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-14 05:50:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-07-14 05:50:58,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 05:50:58,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:58,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:58,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:58,437 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-14 05:50:58,438 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:58,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:58,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1701915074, now seen corresponding path program 1 times [2022-07-14 05:50:58,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:58,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083468035] [2022-07-14 05:50:58,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:58,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:58,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:58,440 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-14 05:50:58,441 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-14 05:50:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:58,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 05:50:58,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:58,504 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-14 05:50:58,509 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-14 05:50:58,533 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 05:50:58,534 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-14 05:50:58,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:58,546 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-14 05:50:58,576 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-14 05:50:58,578 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-14 05:50:58,595 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-14 05:50:58,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:50:58,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:58,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083468035] [2022-07-14 05:50:58,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083468035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:58,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:58,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:58,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315623206] [2022-07-14 05:50:58,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:58,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:58,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:58,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:58,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:58,596 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-14 05:50:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:58,749 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-07-14 05:50:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:58,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2022-07-14 05:50:58,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:58,750 INFO L225 Difference]: With dead ends: 149 [2022-07-14 05:50:58,750 INFO L226 Difference]: Without dead ends: 149 [2022-07-14 05:50:58,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-14 05:50:58,751 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:58,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 438 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:58,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-14 05:50:58,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2022-07-14 05:50:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 114 states have (on average 1.3771929824561404) internal successors, (157), 145 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-14 05:50:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2022-07-14 05:50:58,753 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 19 [2022-07-14 05:50:58,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:58,753 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2022-07-14 05:50:58,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-14 05:50:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2022-07-14 05:50:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 05:50:58,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:58,754 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] [2022-07-14 05:50:58,761 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-14 05:50:58,959 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-14 05:50:58,960 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash 812348068, now seen corresponding path program 1 times [2022-07-14 05:50:58,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:58,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996217149] [2022-07-14 05:50:58,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:58,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:58,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:58,962 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-14 05:50:58,963 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-14 05:50:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:59,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 05:50:59,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:59,026 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-14 05:50:59,030 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-14 05:50:59,051 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 05:50:59,051 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-14 05:50:59,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:59,057 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-14 05:50:59,102 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-14 05:50:59,105 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-14 05:50:59,129 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-14 05:50:59,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:59,186 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-14 05:50:59,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:59,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996217149] [2022-07-14 05:50:59,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996217149] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:59,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:59,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-14 05:50:59,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112373623] [2022-07-14 05:50:59,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:59,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:59,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:59,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:59,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:59,188 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand has 5 states, 5 states have (on average 4.4) 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-14 05:50:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:59,299 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-07-14 05:50:59,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:59,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) 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-14 05:50:59,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:59,301 INFO L225 Difference]: With dead ends: 153 [2022-07-14 05:50:59,301 INFO L226 Difference]: Without dead ends: 153 [2022-07-14 05:50:59,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 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-14 05:50:59,301 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:59,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 443 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:59,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-14 05:50:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-14 05:50:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 152 states have internal predecessors, (164), 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-14 05:50:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2022-07-14 05:50:59,304 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 22 [2022-07-14 05:50:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:59,304 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2022-07-14 05:50:59,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) 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-14 05:50:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-07-14 05:50:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 05:50:59,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:59,305 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-14 05:50:59,318 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-14 05:50:59,510 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-14 05:50:59,511 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:50:59,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash -587014801, now seen corresponding path program 1 times [2022-07-14 05:50:59,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:50:59,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456807415] [2022-07-14 05:50:59,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:59,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:50:59,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:50:59,513 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-14 05:50:59,515 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-14 05:50:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:59,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 05:50:59,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:59,697 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-14 05:50:59,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:59,747 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-14 05:50:59,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:50:59,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456807415] [2022-07-14 05:50:59,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456807415] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:59,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:50:59,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-14 05:50:59,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347587068] [2022-07-14 05:50:59,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:59,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:50:59,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:50:59,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:50:59,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:59,749 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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-14 05:50:59,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:59,957 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-07-14 05:50:59,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:59,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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-14 05:50:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:59,958 INFO L225 Difference]: With dead ends: 155 [2022-07-14 05:50:59,958 INFO L226 Difference]: Without dead ends: 138 [2022-07-14 05:50:59,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:50:59,959 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:59,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 445 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2022-07-14 05:50:59,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-14 05:50:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-07-14 05:50:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.3962264150943395) internal successors, (148), 137 states have internal predecessors, (148), 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-14 05:50:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2022-07-14 05:50:59,961 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 23 [2022-07-14 05:50:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:59,961 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2022-07-14 05:50:59,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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-14 05:50:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2022-07-14 05:50:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 05:50:59,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:59,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, 1, 1, 1] [2022-07-14 05:50:59,973 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-14 05:51:00,169 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-14 05:51:00,169 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:51:00,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1469175391, now seen corresponding path program 1 times [2022-07-14 05:51:00,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:00,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012476574] [2022-07-14 05:51:00,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:00,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:00,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:00,171 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-14 05:51:00,207 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-14 05:51:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:00,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 05:51:00,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:00,262 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-14 05:51:00,287 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:00,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 05:51:00,310 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:51:00,379 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:00,379 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 30 treesize of output 28 [2022-07-14 05:51:00,403 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-14 05:51:00,454 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 24 treesize of output 12 [2022-07-14 05:51:00,465 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-14 05:51:00,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:00,493 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 05:51:00,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 05:51:00,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 05:51:00,520 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:00,520 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 19 treesize of output 20 [2022-07-14 05:51:00,528 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:00,528 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 33 treesize of output 36 [2022-07-14 05:51:00,531 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 20 treesize of output 18 [2022-07-14 05:51:00,600 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-14 05:51:00,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:00,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012476574] [2022-07-14 05:51:00,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012476574] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:00,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:00,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-07-14 05:51:00,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719880791] [2022-07-14 05:51:00,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:00,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 05:51:00,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:00,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 05:51:00,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=124, Unknown=3, NotChecked=72, Total=240 [2022-07-14 05:51:00,601 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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-14 05:51:01,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:01,196 INFO L93 Difference]: Finished difference Result 238 states and 255 transitions. [2022-07-14 05:51:01,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 05:51:01,196 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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-14 05:51:01,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:01,197 INFO L225 Difference]: With dead ends: 238 [2022-07-14 05:51:01,197 INFO L226 Difference]: Without dead ends: 238 [2022-07-14 05:51:01,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=282, Unknown=3, NotChecked=114, Total=506 [2022-07-14 05:51:01,198 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 392 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 454 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:01,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 614 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 394 Invalid, 0 Unknown, 454 Unchecked, 0.4s Time] [2022-07-14 05:51:01,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-14 05:51:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2022-07-14 05:51:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3666666666666667) internal successors, (164), 151 states have internal predecessors, (164), 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-14 05:51:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2022-07-14 05:51:01,201 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 27 [2022-07-14 05:51:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:01,201 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2022-07-14 05:51:01,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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-14 05:51:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2022-07-14 05:51:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 05:51:01,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:01,202 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-14 05:51:01,211 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-14 05:51:01,409 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-14 05:51:01,409 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:51:01,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash -442882051, now seen corresponding path program 1 times [2022-07-14 05:51:01,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:01,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528162665] [2022-07-14 05:51:01,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:01,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:01,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:01,412 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-14 05:51:01,413 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-14 05:51:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:01,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 05:51:01,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:01,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:01,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:01,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528162665] [2022-07-14 05:51:01,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528162665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:01,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:01,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:51:01,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760700817] [2022-07-14 05:51:01,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:01,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:51:01,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:01,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:51:01,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:51:01,515 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) 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-14 05:51:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:01,537 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2022-07-14 05:51:01,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:51:01,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) 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-14 05:51:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:01,538 INFO L225 Difference]: With dead ends: 209 [2022-07-14 05:51:01,538 INFO L226 Difference]: Without dead ends: 209 [2022-07-14 05:51:01,538 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-14 05:51:01,539 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 52 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:01,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 236 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:51:01,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-14 05:51:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 169. [2022-07-14 05:51:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.3211678832116789) internal successors, (181), 168 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-14 05:51:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 181 transitions. [2022-07-14 05:51:01,542 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 181 transitions. Word has length 28 [2022-07-14 05:51:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:01,542 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 181 transitions. [2022-07-14 05:51:01,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) 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-14 05:51:01,543 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2022-07-14 05:51:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 05:51:01,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:01,543 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, 1, 1, 1] [2022-07-14 05:51:01,552 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-14 05:51:01,750 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-14 05:51:01,751 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:51:01,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:01,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1554549191, now seen corresponding path program 1 times [2022-07-14 05:51:01,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:01,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983127028] [2022-07-14 05:51:01,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:01,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:01,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:01,753 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-14 05:51:01,754 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-14 05:51:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:01,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 05:51:01,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:01,850 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-14 05:51:01,889 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 05:51:01,889 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-14 05:51:01,917 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-14 05:51:01,991 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:01,992 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-14 05:51:02,015 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:02,016 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-14 05:51:02,102 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-14 05:51:02,154 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-14 05:51:02,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:02,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 05:51:02,280 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (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_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 05:51:02,287 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:02,288 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-14 05:51:02,294 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:02,295 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 34 treesize of output 37 [2022-07-14 05:51:02,299 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-14 05:51:13,707 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-14 05:51:13,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:13,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983127028] [2022-07-14 05:51:13,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983127028] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:13,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:13,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-07-14 05:51:13,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087264189] [2022-07-14 05:51:13,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:13,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 05:51:13,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:13,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 05:51:13,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=234, Unknown=7, NotChecked=66, Total=380 [2022-07-14 05:51:13,709 INFO L87 Difference]: Start difference. First operand 169 states and 181 transitions. Second operand has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 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-14 05:51:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:14,161 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2022-07-14 05:51:14,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 05:51:14,162 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 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-14 05:51:14,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:14,162 INFO L225 Difference]: With dead ends: 216 [2022-07-14 05:51:14,162 INFO L226 Difference]: Without dead ends: 216 [2022-07-14 05:51:14,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=119, Invalid=344, Unknown=7, NotChecked=82, Total=552 [2022-07-14 05:51:14,163 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 244 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 603 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:14,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1040 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 257 Invalid, 0 Unknown, 603 Unchecked, 0.3s Time] [2022-07-14 05:51:14,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-14 05:51:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 179. [2022-07-14 05:51:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 178 states have internal predecessors, (194), 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-14 05:51:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2022-07-14 05:51:14,166 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 35 [2022-07-14 05:51:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:14,166 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2022-07-14 05:51:14,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 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-14 05:51:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2022-07-14 05:51:14,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 05:51:14,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:14,167 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, 1, 1, 1] [2022-07-14 05:51:14,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-14 05:51:14,374 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-14 05:51:14,375 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:51:14,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1554549192, now seen corresponding path program 1 times [2022-07-14 05:51:14,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:14,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034138208] [2022-07-14 05:51:14,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:14,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:14,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:14,388 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-14 05:51:14,443 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-14 05:51:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:14,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 05:51:14,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:14,549 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-14 05:51:14,589 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:14,590 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-14 05:51:14,597 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-14 05:51:14,622 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-14 05:51:14,627 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-14 05:51:14,758 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:14,758 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-14 05:51:14,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:14,768 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 14 treesize of output 16 [2022-07-14 05:51:14,787 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:14,788 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-14 05:51:14,792 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-14 05:51:14,938 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-14 05:51:14,942 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-14 05:51:15,002 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-14 05:51:15,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:15,391 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-14 05:51:15,433 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-07-14 05:51:15,470 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2022-07-14 05:51:15,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:15,491 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 37 treesize of output 30 [2022-07-14 05:51:15,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:15,505 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 44 treesize of output 43 [2022-07-14 05:51:15,510 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 15 treesize of output 11 [2022-07-14 05:51:15,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:15,545 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 37 treesize of output 38 [2022-07-14 05:51:15,553 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:15,553 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 29 treesize of output 30 [2022-07-14 05:51:15,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:15,560 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 27 treesize of output 19 [2022-07-14 05:51:15,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:51:15,566 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 20 treesize of output 12 [2022-07-14 05:51:15,671 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-14 05:51:15,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:15,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034138208] [2022-07-14 05:51:15,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034138208] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:15,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:15,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-14 05:51:15,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197190788] [2022-07-14 05:51:15,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:15,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 05:51:15,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:15,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 05:51:15,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-07-14 05:51:15,673 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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-14 05:51:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:17,419 INFO L93 Difference]: Finished difference Result 303 states and 324 transitions. [2022-07-14 05:51:17,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 05:51:17,420 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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-14 05:51:17,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:17,421 INFO L225 Difference]: With dead ends: 303 [2022-07-14 05:51:17,421 INFO L226 Difference]: Without dead ends: 303 [2022-07-14 05:51:17,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=155, Invalid=610, Unknown=3, NotChecked=162, Total=930 [2022-07-14 05:51:17,422 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 395 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 711 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:17,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 636 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 529 Invalid, 0 Unknown, 711 Unchecked, 1.1s Time] [2022-07-14 05:51:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-14 05:51:17,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 183. [2022-07-14 05:51:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 151 states have (on average 1.3112582781456954) internal successors, (198), 182 states have internal predecessors, (198), 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-14 05:51:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2022-07-14 05:51:17,425 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 35 [2022-07-14 05:51:17,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:17,425 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2022-07-14 05:51:17,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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-14 05:51:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2022-07-14 05:51:17,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 05:51:17,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:17,426 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, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:17,433 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-14 05:51:17,626 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-14 05:51:17,626 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:51:17,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:17,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1057065939, now seen corresponding path program 1 times [2022-07-14 05:51:17,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:17,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57019615] [2022-07-14 05:51:17,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:17,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:17,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:17,629 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-14 05:51:17,630 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-14 05:51:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:17,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 05:51:17,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:17,738 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-14 05:51:17,773 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:17,773 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-14 05:51:17,798 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-14 05:51:17,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:51:17,930 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:17,930 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 22 treesize of output 22 [2022-07-14 05:51:17,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:17,938 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 21 [2022-07-14 05:51:17,961 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:17,962 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 54 treesize of output 51 [2022-07-14 05:51:17,965 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 25 treesize of output 17 [2022-07-14 05:51:17,967 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 35 treesize of output 35 [2022-07-14 05:51:18,122 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 33 treesize of output 21 [2022-07-14 05:51:18,125 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 28 treesize of output 16 [2022-07-14 05:51:18,175 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-14 05:51:18,204 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-14 05:51:18,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:18,347 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 77 treesize of output 57 [2022-07-14 05:51:18,354 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-14 05:51:18,376 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.offset|)) (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-14 05:51:18,385 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0)))) is different from false [2022-07-14 05:51:18,399 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:18,400 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 18 treesize of output 19 [2022-07-14 05:51:18,406 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:18,406 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 30 treesize of output 33 [2022-07-14 05:51:18,410 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 9 treesize of output 7 [2022-07-14 05:51:18,433 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 05:51:18,433 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 18 treesize of output 1 [2022-07-14 05:51:18,553 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-14 05:51:18,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:18,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57019615] [2022-07-14 05:51:18,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57019615] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:18,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:18,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-07-14 05:51:18,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457349710] [2022-07-14 05:51:18,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:18,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-14 05:51:18,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:18,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 05:51:18,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=336, Unknown=3, NotChecked=114, Total=506 [2022-07-14 05:51:18,554 INFO L87 Difference]: Start difference. First operand 183 states and 198 transitions. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 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-14 05:51:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:20,023 INFO L93 Difference]: Finished difference Result 301 states and 324 transitions. [2022-07-14 05:51:20,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 05:51:20,025 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 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 38 [2022-07-14 05:51:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:20,026 INFO L225 Difference]: With dead ends: 301 [2022-07-14 05:51:20,026 INFO L226 Difference]: Without dead ends: 301 [2022-07-14 05:51:20,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=995, Unknown=3, NotChecked=204, Total=1406 [2022-07-14 05:51:20,040 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 403 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 521 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:20,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1301 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 859 Invalid, 0 Unknown, 521 Unchecked, 0.9s Time] [2022-07-14 05:51:20,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-14 05:51:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 182. [2022-07-14 05:51:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 150 states have (on average 1.3066666666666666) 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-14 05:51:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2022-07-14 05:51:20,043 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 38 [2022-07-14 05:51:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:20,043 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2022-07-14 05:51:20,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 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-14 05:51:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2022-07-14 05:51:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 05:51:20,044 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:20,044 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] [2022-07-14 05:51:20,056 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-14 05:51:20,256 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-14 05:51:20,257 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:51:20,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:20,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322345, now seen corresponding path program 1 times [2022-07-14 05:51:20,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:20,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804238796] [2022-07-14 05:51:20,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:20,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:20,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:20,259 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-14 05:51:20,265 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-14 05:51:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:20,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 05:51:20,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:20,395 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-14 05:51:20,427 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 05:51:20,428 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-14 05:51:20,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, 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-14 05:51:20,528 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:20,529 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-14 05:51:20,553 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:20,553 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-14 05:51:20,678 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-14 05:51:20,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-07-14 05:51:20,723 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-14 05:51:20,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:20,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 05:51:20,838 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (_ bv1 1) (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-14 05:51:20,844 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 05:51:20,853 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:20,853 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 23 treesize of output 24 [2022-07-14 05:51:20,863 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:20,863 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 40 treesize of output 43 [2022-07-14 05:51:20,867 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-14 05:51:21,442 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-14 05:51:21,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:21,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804238796] [2022-07-14 05:51:21,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804238796] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:21,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:21,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-14 05:51:21,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107156432] [2022-07-14 05:51:21,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:21,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 05:51:21,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:21,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 05:51:21,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=244, Unknown=3, NotChecked=102, Total=420 [2022-07-14 05:51:21,446 INFO L87 Difference]: Start difference. First operand 182 states and 196 transitions. Second operand has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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-14 05:51:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:22,068 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2022-07-14 05:51:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 05:51:22,068 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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 40 [2022-07-14 05:51:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:22,069 INFO L225 Difference]: With dead ends: 218 [2022-07-14 05:51:22,069 INFO L226 Difference]: Without dead ends: 218 [2022-07-14 05:51:22,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=323, Unknown=3, NotChecked=120, Total=552 [2022-07-14 05:51:22,071 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 232 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 887 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:22,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 686 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 284 Invalid, 0 Unknown, 887 Unchecked, 0.4s Time] [2022-07-14 05:51:22,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-14 05:51:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2022-07-14 05:51:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.3294117647058823) internal successors, (226), 201 states have internal predecessors, (226), 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-14 05:51:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2022-07-14 05:51:22,078 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 40 [2022-07-14 05:51:22,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:22,078 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2022-07-14 05:51:22,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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-14 05:51:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2022-07-14 05:51:22,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 05:51:22,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:22,079 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] [2022-07-14 05:51:22,097 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-14 05:51:22,287 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-14 05:51:22,287 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:51:22,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:22,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322346, now seen corresponding path program 1 times [2022-07-14 05:51:22,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:22,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317325650] [2022-07-14 05:51:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:22,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:22,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:22,289 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-14 05:51:22,291 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-14 05:51:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:22,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 05:51:22,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:22,404 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-14 05:51:22,424 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:22,424 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-14 05:51:22,429 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-14 05:51:22,446 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-14 05:51:22,451 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-14 05:51:22,512 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:22,513 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-14 05:51:22,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:22,521 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 14 treesize of output 16 [2022-07-14 05:51:22,537 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:22,537 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-14 05:51:22,540 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-14 05:51:22,627 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-14 05:51:22,635 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-14 05:51:22,668 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-14 05:51:22,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:22,940 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-14 05:51:22,968 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-14 05:51:22,986 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-14 05:51:23,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:23,003 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 37 treesize of output 38 [2022-07-14 05:51:23,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:23,008 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 29 treesize of output 30 [2022-07-14 05:51:23,017 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:23,018 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 52 treesize of output 55 [2022-07-14 05:51:23,031 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:23,031 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 82 treesize of output 81 [2022-07-14 05:51:23,037 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 34 treesize of output 30 [2022-07-14 05:51:23,040 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 62 treesize of output 58 [2022-07-14 05:51:23,351 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:23,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 28 [2022-07-14 05:51:23,363 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:23,363 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 40 treesize of output 39 [2022-07-14 05:51:23,369 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-14 05:51:24,136 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-14 05:51:24,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:24,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317325650] [2022-07-14 05:51:24,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317325650] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:24,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:24,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-14 05:51:24,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664327995] [2022-07-14 05:51:24,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:24,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 05:51:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:24,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 05:51:24,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-07-14 05:51:24,138 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 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-14 05:51:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:25,338 INFO L93 Difference]: Finished difference Result 217 states and 234 transitions. [2022-07-14 05:51:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 05:51:25,339 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 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 40 [2022-07-14 05:51:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:25,340 INFO L225 Difference]: With dead ends: 217 [2022-07-14 05:51:25,340 INFO L226 Difference]: Without dead ends: 217 [2022-07-14 05:51:25,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=164, Invalid=495, Unknown=3, NotChecked=150, Total=812 [2022-07-14 05:51:25,340 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 389 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 755 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:25,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 509 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 384 Invalid, 0 Unknown, 755 Unchecked, 0.7s Time] [2022-07-14 05:51:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-14 05:51:25,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 202. [2022-07-14 05:51:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.3235294117647058) internal successors, (225), 201 states have internal predecessors, (225), 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-14 05:51:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 225 transitions. [2022-07-14 05:51:25,343 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 225 transitions. Word has length 40 [2022-07-14 05:51:25,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:25,343 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 225 transitions. [2022-07-14 05:51:25,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 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-14 05:51:25,344 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 225 transitions. [2022-07-14 05:51:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 05:51:25,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:25,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:25,363 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-14 05:51:25,551 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-14 05:51:25,551 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:51:25,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:25,552 INFO L85 PathProgramCache]: Analyzing trace with hash -466746806, now seen corresponding path program 1 times [2022-07-14 05:51:25,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:25,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873886377] [2022-07-14 05:51:25,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:25,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:25,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:25,553 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-14 05:51:25,555 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-14 05:51:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:25,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 05:51:25,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:25,685 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 17 [2022-07-14 05:51:25,690 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 21 treesize of output 13 [2022-07-14 05:51:25,724 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-14 05:51:25,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:25,779 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-14 05:51:25,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:25,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873886377] [2022-07-14 05:51:25,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873886377] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:25,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:25,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-07-14 05:51:25,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51711948] [2022-07-14 05:51:25,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:25,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:51:25,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:25,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:51:25,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:51:25,781 INFO L87 Difference]: Start difference. First operand 202 states and 225 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-14 05:51:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:25,950 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2022-07-14 05:51:25,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:51:25,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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 41 [2022-07-14 05:51:25,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:25,952 INFO L225 Difference]: With dead ends: 229 [2022-07-14 05:51:25,952 INFO L226 Difference]: Without dead ends: 229 [2022-07-14 05:51:25,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:51:25,952 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 181 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:25,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 334 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:51:25,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-14 05:51:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2022-07-14 05:51:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 191 states have (on average 1.324607329842932) internal successors, (253), 222 states have internal predecessors, (253), 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-14 05:51:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2022-07-14 05:51:25,955 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 41 [2022-07-14 05:51:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:25,955 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2022-07-14 05:51:25,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-14 05:51:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2022-07-14 05:51:25,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 05:51:25,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:25,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:25,967 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-14 05:51:26,163 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-14 05:51:26,163 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:51:26,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:26,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1696634608, now seen corresponding path program 1 times [2022-07-14 05:51:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:26,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868767149] [2022-07-14 05:51:26,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:26,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:26,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:26,167 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-14 05:51:26,168 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-14 05:51:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:26,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 05:51:26,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 05:51:26,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:26,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:26,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868767149] [2022-07-14 05:51:26,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868767149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:26,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:26,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:51:26,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612723243] [2022-07-14 05:51:26,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:26,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:51:26,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:26,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:51:26,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:51:26,298 INFO L87 Difference]: Start difference. First operand 223 states and 253 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-14 05:51:26,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:26,320 INFO L93 Difference]: Finished difference Result 283 states and 317 transitions. [2022-07-14 05:51:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:51:26,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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 41 [2022-07-14 05:51:26,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:26,322 INFO L225 Difference]: With dead ends: 283 [2022-07-14 05:51:26,322 INFO L226 Difference]: Without dead ends: 283 [2022-07-14 05:51:26,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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-14 05:51:26,325 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 61 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:26,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 270 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:51:26,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-14 05:51:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 241. [2022-07-14 05:51:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 209 states have (on average 1.3014354066985645) internal successors, (272), 240 states have internal predecessors, (272), 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-14 05:51:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2022-07-14 05:51:26,329 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 41 [2022-07-14 05:51:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:26,329 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2022-07-14 05:51:26,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-14 05:51:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2022-07-14 05:51:26,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 05:51:26,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:26,330 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:26,337 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-14 05:51:26,536 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-14 05:51:26,537 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:51:26,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:26,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1584201975, now seen corresponding path program 1 times [2022-07-14 05:51:26,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:26,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275468550] [2022-07-14 05:51:26,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:26,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:26,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:26,539 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-14 05:51:26,563 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-14 05:51:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:26,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 05:51:26,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:26,663 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-14 05:51:26,688 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:26,689 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-14 05:51:26,708 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-14 05:51:26,713 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-14 05:51:26,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, 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-14 05:51:26,766 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 14 treesize of output 16 [2022-07-14 05:51:26,775 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 14 treesize of output 16 [2022-07-14 05:51:26,811 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-14 05:51:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:26,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:26,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-14 05:51:26,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-14 05:51:26,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-14 05:51:26,903 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:26,904 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 18 treesize of output 19 [2022-07-14 05:51:26,912 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:26,912 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 30 treesize of output 33 [2022-07-14 05:51:26,916 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 9 treesize of output 7 [2022-07-14 05:51:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:26,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:26,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275468550] [2022-07-14 05:51:26,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275468550] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:26,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:26,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-07-14 05:51:26,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394574344] [2022-07-14 05:51:26,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:26,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 05:51:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:26,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 05:51:26,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=130, Unknown=3, NotChecked=72, Total=240 [2022-07-14 05:51:26,974 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 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-14 05:51:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:27,748 INFO L93 Difference]: Finished difference Result 258 states and 284 transitions. [2022-07-14 05:51:27,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 05:51:27,749 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 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-14 05:51:27,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:27,750 INFO L225 Difference]: With dead ends: 258 [2022-07-14 05:51:27,750 INFO L226 Difference]: Without dead ends: 258 [2022-07-14 05:51:27,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=493, Unknown=3, NotChecked=150, Total=812 [2022-07-14 05:51:27,751 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 168 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 451 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:27,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 899 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 547 Invalid, 0 Unknown, 451 Unchecked, 0.5s Time] [2022-07-14 05:51:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-14 05:51:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 243. [2022-07-14 05:51:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 211 states have (on average 1.2985781990521328) internal successors, (274), 242 states have internal predecessors, (274), 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-14 05:51:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 274 transitions. [2022-07-14 05:51:27,757 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 274 transitions. Word has length 42 [2022-07-14 05:51:27,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:27,757 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 274 transitions. [2022-07-14 05:51:27,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 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-14 05:51:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 274 transitions. [2022-07-14 05:51:27,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 05:51:27,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:27,758 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-14 05:51:27,779 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-14 05:51:27,965 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-14 05:51:27,966 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:51:27,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:27,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1471647316, now seen corresponding path program 1 times [2022-07-14 05:51:27,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:27,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871002272] [2022-07-14 05:51:27,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:27,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:27,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:27,968 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-14 05:51:27,969 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-14 05:51:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:28,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 05:51:28,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:28,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:28,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:28,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871002272] [2022-07-14 05:51:28,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871002272] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:28,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:28,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:51:28,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178515114] [2022-07-14 05:51:28,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:28,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:51:28,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:28,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:51:28,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:51:28,087 INFO L87 Difference]: Start difference. First operand 243 states and 274 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-14 05:51:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:28,114 INFO L93 Difference]: Finished difference Result 256 states and 276 transitions. [2022-07-14 05:51:28,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:51:28,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-14 05:51:28,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:28,116 INFO L225 Difference]: With dead ends: 256 [2022-07-14 05:51:28,116 INFO L226 Difference]: Without dead ends: 256 [2022-07-14 05:51:28,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-14 05:51:28,116 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 46 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:28,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 357 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:51:28,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-14 05:51:28,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 237. [2022-07-14 05:51:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 205 states have (on average 1.273170731707317) internal successors, (261), 236 states have internal predecessors, (261), 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-14 05:51:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 261 transitions. [2022-07-14 05:51:28,120 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 261 transitions. Word has length 42 [2022-07-14 05:51:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:28,120 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 261 transitions. [2022-07-14 05:51:28,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-14 05:51:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 261 transitions. [2022-07-14 05:51:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 05:51:28,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:28,121 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:28,138 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-14 05:51:28,327 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-14 05:51:28,328 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:51:28,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:28,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1095816814, now seen corresponding path program 1 times [2022-07-14 05:51:28,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:28,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207275256] [2022-07-14 05:51:28,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:28,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:28,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:28,347 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-14 05:51:28,350 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-14 05:51:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:28,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 05:51:28,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:28,479 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-14 05:51:28,503 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:28,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 05:51:28,525 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:51:28,602 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:28,603 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 30 treesize of output 28 [2022-07-14 05:51:28,625 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:28,626 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 30 treesize of output 28 [2022-07-14 05:51:28,674 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:28,674 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-14 05:51:28,703 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 05:51:28,704 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 1 case distinctions, treesize of input 35 treesize of output 26 [2022-07-14 05:51:28,821 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 05:51:28,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2022-07-14 05:51:28,830 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-14 05:51:28,912 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-14 05:51:28,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 55 [2022-07-14 05:51:28,925 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 16 treesize of output 12 [2022-07-14 05:51:28,978 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 24 treesize of output 12 [2022-07-14 05:51:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:28,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:29,026 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 05:51:29,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 05:51:29,040 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-14 05:51:29,048 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 05:51:29,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_28| (_ BitVec 32))) (or (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_28|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_28| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_28|))))) is different from false [2022-07-14 05:51:29,092 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:29,092 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 05:51:29,099 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse0)))))) is different from false [2022-07-14 05:51:29,117 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse0)))))) is different from false [2022-07-14 05:51:29,125 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.offset_75| (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 |v_ULTIMATE.start_main_~item~0#1.offset_75|))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_arrayElimArr_13) .cse0 v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select |c_#valid| .cse0) (_ bv0 1)))))) is different from false [2022-07-14 05:51:29,138 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:29,139 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 24 treesize of output 25 [2022-07-14 05:51:29,148 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:29,148 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 73 treesize of output 76 [2022-07-14 05:51:29,157 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:29,158 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 69 treesize of output 65 [2022-07-14 05:51:29,162 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 50 treesize of output 46 [2022-07-14 05:51:29,173 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 05:51:29,173 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 13 treesize of output 12 [2022-07-14 05:51:29,276 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-14 05:51:29,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:29,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207275256] [2022-07-14 05:51:29,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207275256] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:29,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:29,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-07-14 05:51:29,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122665284] [2022-07-14 05:51:29,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:29,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-14 05:51:29,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:29,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-14 05:51:29,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=247, Unknown=8, NotChecked=312, Total=650 [2022-07-14 05:51:29,278 INFO L87 Difference]: Start difference. First operand 237 states and 261 transitions. Second operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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-14 05:51:30,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:30,070 INFO L93 Difference]: Finished difference Result 294 states and 322 transitions. [2022-07-14 05:51:30,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 05:51:30,071 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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-14 05:51:30,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:30,072 INFO L225 Difference]: With dead ends: 294 [2022-07-14 05:51:30,072 INFO L226 Difference]: Without dead ends: 294 [2022-07-14 05:51:30,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 8 IntricatePredicates, 3 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=604, Unknown=8, NotChecked=472, Total=1260 [2022-07-14 05:51:30,072 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 237 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 2058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1601 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:30,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 929 Invalid, 2058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 428 Invalid, 0 Unknown, 1601 Unchecked, 0.4s Time] [2022-07-14 05:51:30,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-14 05:51:30,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 259. [2022-07-14 05:51:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 227 states have (on average 1.251101321585903) internal successors, (284), 258 states have internal predecessors, (284), 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-14 05:51:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 284 transitions. [2022-07-14 05:51:30,076 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 284 transitions. Word has length 42 [2022-07-14 05:51:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:30,076 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 284 transitions. [2022-07-14 05:51:30,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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-14 05:51:30,076 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 284 transitions. [2022-07-14 05:51:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 05:51:30,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:30,076 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-14 05:51:30,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-14 05:51:30,284 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-14 05:51:30,284 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:51:30,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:30,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1865620530, now seen corresponding path program 1 times [2022-07-14 05:51:30,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:30,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116880645] [2022-07-14 05:51:30,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:30,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:30,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:30,286 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-14 05:51:30,287 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-14 05:51:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:30,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 05:51:30,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:30,405 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-14 05:51:30,430 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:30,431 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-14 05:51:30,453 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-14 05:51:30,532 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:30,532 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 29 treesize of output 27 [2022-07-14 05:51:30,552 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 05:51:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 05:51:30,633 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 23 treesize of output 11 [2022-07-14 05:51:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:30,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:30,799 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_805 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-14 05:51:30,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:30,849 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 18 treesize of output 19 [2022-07-14 05:51:30,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:30,858 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 30 treesize of output 33 [2022-07-14 05:51:30,861 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 9 treesize of output 7 [2022-07-14 05:51:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:30,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:30,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116880645] [2022-07-14 05:51:30,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116880645] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:51:30,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 05:51:30,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-07-14 05:51:30,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093502664] [2022-07-14 05:51:30,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 05:51:30,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 05:51:30,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:30,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 05:51:30,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=216, Unknown=12, NotChecked=30, Total=306 [2022-07-14 05:51:30,953 INFO L87 Difference]: Start difference. First operand 259 states and 284 transitions. Second operand has 18 states, 17 states have (on average 4.470588235294118) internal successors, (76), 18 states have internal predecessors, (76), 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-14 05:51:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:31,923 INFO L93 Difference]: Finished difference Result 266 states and 287 transitions. [2022-07-14 05:51:31,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 05:51:31,924 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.470588235294118) internal successors, (76), 18 states have internal predecessors, (76), 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 43 [2022-07-14 05:51:31,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:31,924 INFO L225 Difference]: With dead ends: 266 [2022-07-14 05:51:31,924 INFO L226 Difference]: Without dead ends: 266 [2022-07-14 05:51:31,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=751, Unknown=20, NotChecked=60, Total=1056 [2022-07-14 05:51:31,925 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 281 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:31,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 792 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 417 Invalid, 0 Unknown, 355 Unchecked, 0.5s Time] [2022-07-14 05:51:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-14 05:51:31,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2022-07-14 05:51:31,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 228 states have (on average 1.25) internal successors, (285), 259 states have internal predecessors, (285), 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-14 05:51:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2022-07-14 05:51:31,928 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 43 [2022-07-14 05:51:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:31,928 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2022-07-14 05:51:31,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.470588235294118) internal successors, (76), 18 states have internal predecessors, (76), 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-14 05:51:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2022-07-14 05:51:31,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 05:51:31,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:31,929 INFO L195 NwaCegarLoop]: trace histogram [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-14 05:51:31,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-14 05:51:32,129 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-14 05:51:32,129 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:51:32,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:32,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1999661141, now seen corresponding path program 1 times [2022-07-14 05:51:32,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:32,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738312452] [2022-07-14 05:51:32,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:32,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:32,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:32,131 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-14 05:51:32,133 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-14 05:51:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:32,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 05:51:32,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 05:51:32,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 05:51:32,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 05:51:32,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738312452] [2022-07-14 05:51:32,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738312452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:51:32,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:51:32,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:51:32,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182142359] [2022-07-14 05:51:32,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:51:32,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:51:32,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 05:51:32,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:51:32,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:51:32,257 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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-14 05:51:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:51:32,424 INFO L93 Difference]: Finished difference Result 260 states and 284 transitions. [2022-07-14 05:51:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:51:32,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2022-07-14 05:51:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:51:32,425 INFO L225 Difference]: With dead ends: 260 [2022-07-14 05:51:32,425 INFO L226 Difference]: Without dead ends: 260 [2022-07-14 05:51:32,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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-14 05:51:32,425 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 109 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:51:32,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 172 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:51:32,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-14 05:51:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2022-07-14 05:51:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 222 states have (on average 1.2522522522522523) internal successors, (278), 252 states have internal predecessors, (278), 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-14 05:51:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 278 transitions. [2022-07-14 05:51:32,428 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 278 transitions. Word has length 44 [2022-07-14 05:51:32,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:51:32,428 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 278 transitions. [2022-07-14 05:51:32,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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-14 05:51:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 278 transitions. [2022-07-14 05:51:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 05:51:32,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:51:32,429 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:51:32,441 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-14 05:51:32,629 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-14 05:51:32,629 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-14 05:51:32,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:51:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash -433899271, now seen corresponding path program 1 times [2022-07-14 05:51:32,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 05:51:32,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694377026] [2022-07-14 05:51:32,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:51:32,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 05:51:32,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 05:51:32,631 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-14 05:51:32,633 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-14 05:51:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:51:32,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 05:51:32,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:51:32,763 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-14 05:51:32,786 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 05:51:32,786 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-14 05:51:32,801 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-14 05:51:32,865 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 05:51:32,865 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 27 treesize of output 22 [2022-07-14 05:51:32,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:51:32,873 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 19 treesize of output 18 [2022-07-14 05:51:32,934 INFO L356 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2022-07-14 05:51:32,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 70 [2022-07-14 05:51:32,947 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-14 05:51:32,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2022-07-14 05:51:33,201 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-14 05:51:33,201 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-07-14 05:51:33,204 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-07-14 05:51:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:51:33,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:51:50,186 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:51:50,186 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 2809 treesize of output 1959