./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9d8386495cfc7d925686020c12a2509d702f4bf2aed1f5dea2d7da468cac3b6e --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:59:48,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:59:48,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:59:48,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:59:48,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:59:48,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:59:48,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:59:48,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:59:48,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:59:48,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:59:48,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:59:48,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:59:48,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:59:48,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:59:48,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:59:48,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:59:48,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:59:48,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:59:48,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:59:48,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:59:48,588 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:59:48,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:59:48,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:59:48,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:59:48,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:59:48,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:59:48,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:59:48,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:59:48,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:59:48,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:59:48,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:59:48,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:59:48,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:59:48,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:59:48,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:59:48,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:59:48,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:59:48,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:59:48,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:59:48,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:59:48,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:59:48,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:59:48,601 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:59:48,624 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:59:48,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:59:48,625 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:59:48,626 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:59:48,627 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:59:48,627 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:59:48,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:59:48,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:59:48,628 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:59:48,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:59:48,629 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:59:48,629 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:59:48,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:59:48,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:59:48,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:59:48,630 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:59:48,631 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:59:48,631 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:59:48,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:59:48,631 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:59:48,631 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:59:48,632 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:59:48,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:59:48,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:59:48,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:59:48,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:59:48,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:59:48,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:59:48,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:59:48,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:59:48,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9d8386495cfc7d925686020c12a2509d702f4bf2aed1f5dea2d7da468cac3b6e [2022-07-12 18:59:48,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:59:48,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:59:48,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:59:48,854 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:59:48,855 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:59:48,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i [2022-07-12 18:59:48,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9df9fca/28bf3a0b57664b9eab7128d0246fb6f2/FLAGabecd5cc4 [2022-07-12 18:59:49,292 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:59:49,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i [2022-07-12 18:59:49,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9df9fca/28bf3a0b57664b9eab7128d0246fb6f2/FLAGabecd5cc4 [2022-07-12 18:59:49,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9df9fca/28bf3a0b57664b9eab7128d0246fb6f2 [2022-07-12 18:59:49,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:59:49,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:59:49,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:59:49,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:59:49,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:59:49,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:59:49" (1/1) ... [2022-07-12 18:59:49,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a3613e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:49, skipping insertion in model container [2022-07-12 18:59:49,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:59:49" (1/1) ... [2022-07-12 18:59:49,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:59:49,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:59:50,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i[22778,22791] [2022-07-12 18:59:50,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:59:50,030 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:59:50,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i[22778,22791] [2022-07-12 18:59:50,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:59:50,085 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:59:50,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:50 WrapperNode [2022-07-12 18:59:50,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:59:50,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:59:50,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:59:50,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:59:50,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:50" (1/1) ... [2022-07-12 18:59:50,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:50" (1/1) ... [2022-07-12 18:59:50,138 INFO L137 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2022-07-12 18:59:50,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:59:50,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:59:50,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:59:50,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:59:50,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:50" (1/1) ... [2022-07-12 18:59:50,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:50" (1/1) ... [2022-07-12 18:59:50,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:50" (1/1) ... [2022-07-12 18:59:50,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:50" (1/1) ... [2022-07-12 18:59:50,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:50" (1/1) ... [2022-07-12 18:59:50,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:50" (1/1) ... [2022-07-12 18:59:50,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:50" (1/1) ... [2022-07-12 18:59:50,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:59:50,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:59:50,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:59:50,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:59:50,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:50" (1/1) ... [2022-07-12 18:59:50,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:59:50,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:50,227 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-12 18:59:50,249 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-12 18:59:50,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 18:59:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:59:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:59:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:59:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:59:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:59:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:59:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:59:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:59:50,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:59:50,335 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:59:50,336 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:59:50,622 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:59:50,627 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:59:50,627 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-12 18:59:50,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:59:50 BoogieIcfgContainer [2022-07-12 18:59:50,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:59:50,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:59:50,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:59:50,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:59:50,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:59:49" (1/3) ... [2022-07-12 18:59:50,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9f8740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:59:50, skipping insertion in model container [2022-07-12 18:59:50,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:50" (2/3) ... [2022-07-12 18:59:50,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9f8740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:59:50, skipping insertion in model container [2022-07-12 18:59:50,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:59:50" (3/3) ... [2022-07-12 18:59:50,637 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-2.i [2022-07-12 18:59:50,645 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:59:50,646 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2022-07-12 18:59:50,692 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:59:50,698 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@ca54, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1651f3c1 [2022-07-12 18:59:50,698 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2022-07-12 18:59:50,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 63 states have (on average 2.2063492063492065) internal successors, (139), 122 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:59:50,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:50,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:59:50,705 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:50,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:50,710 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 18:59:50,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:50,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309243435] [2022-07-12 18:59:50,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:50,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:50,822 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-12 18:59:50,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:50,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309243435] [2022-07-12 18:59:50,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309243435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:50,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:50,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:59:50,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614563916] [2022-07-12 18:59:50,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:50,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:59:50,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:50,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:59:50,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:50,849 INFO L87 Difference]: Start difference. First operand has 123 states, 63 states have (on average 2.2063492063492065) internal successors, (139), 122 states have internal predecessors, (139), 0 states have call successors, (0), 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-12 18:59:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:50,980 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2022-07-12 18:59:50,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:59:50,982 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-12 18:59:50,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:50,989 INFO L225 Difference]: With dead ends: 150 [2022-07-12 18:59:50,989 INFO L226 Difference]: Without dead ends: 146 [2022-07-12 18:59:50,990 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-12 18:59:50,996 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 109 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:50,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 120 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-12 18:59:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 117. [2022-07-12 18:59:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 116 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2022-07-12 18:59:51,031 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 3 [2022-07-12 18:59:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:51,031 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2022-07-12 18:59:51,031 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-12 18:59:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2022-07-12 18:59:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:59:51,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:51,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:59:51,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:59:51,033 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:51,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:51,033 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 18:59:51,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:51,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972788287] [2022-07-12 18:59:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:51,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:51,063 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-12 18:59:51,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:51,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972788287] [2022-07-12 18:59:51,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972788287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:51,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:51,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:59:51,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288107243] [2022-07-12 18:59:51,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:51,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:59:51,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:51,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:59:51,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:51,066 INFO L87 Difference]: Start difference. First operand 117 states and 124 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-12 18:59:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:51,157 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2022-07-12 18:59:51,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:59:51,157 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-12 18:59:51,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:51,160 INFO L225 Difference]: With dead ends: 143 [2022-07-12 18:59:51,160 INFO L226 Difference]: Without dead ends: 143 [2022-07-12 18:59:51,163 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-12 18:59:51,164 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 104 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:51,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 116 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:51,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-12 18:59:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 114. [2022-07-12 18:59:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 113 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2022-07-12 18:59:51,179 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 3 [2022-07-12 18:59:51,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:51,180 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2022-07-12 18:59:51,180 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-12 18:59:51,181 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2022-07-12 18:59:51,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 18:59:51,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:51,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:51,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:59:51,183 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:51,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:51,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2022-07-12 18:59:51,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:51,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541094894] [2022-07-12 18:59:51,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:51,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:51,240 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-12 18:59:51,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:51,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541094894] [2022-07-12 18:59:51,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541094894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:51,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:51,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:59:51,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467172597] [2022-07-12 18:59:51,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:51,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:59:51,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:51,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:59:51,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:59:51,242 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:51,359 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2022-07-12 18:59:51,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:59:51,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 18:59:51,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:51,360 INFO L225 Difference]: With dead ends: 114 [2022-07-12 18:59:51,361 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 18:59:51,361 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-12 18:59:51,362 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 161 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:51,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 47 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:51,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 18:59:51,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-07-12 18:59:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 69 states have (on average 1.7246376811594204) internal successors, (119), 105 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-07-12 18:59:51,366 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 9 [2022-07-12 18:59:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:51,366 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-07-12 18:59:51,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-07-12 18:59:51,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 18:59:51,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:51,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:51,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:59:51,367 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:51,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:51,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2022-07-12 18:59:51,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:51,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93697561] [2022-07-12 18:59:51,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:51,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:51,472 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-12 18:59:51,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:51,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93697561] [2022-07-12 18:59:51,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93697561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:51,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:51,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:59:51,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865912133] [2022-07-12 18:59:51,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:51,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:59:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:51,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:59:51,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:59:51,479 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:51,653 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2022-07-12 18:59:51,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:59:51,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 18:59:51,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:51,654 INFO L225 Difference]: With dead ends: 149 [2022-07-12 18:59:51,654 INFO L226 Difference]: Without dead ends: 149 [2022-07-12 18:59:51,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:59:51,655 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 349 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:51,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 62 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-12 18:59:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 126. [2022-07-12 18:59:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 92 states have (on average 1.565217391304348) internal successors, (144), 125 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2022-07-12 18:59:51,659 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 9 [2022-07-12 18:59:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:51,659 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2022-07-12 18:59:51,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2022-07-12 18:59:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:59:51,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:51,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:51,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:59:51,660 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:51,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:51,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-07-12 18:59:51,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:51,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402722411] [2022-07-12 18:59:51,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:51,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:51,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-12 18:59:51,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:51,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402722411] [2022-07-12 18:59:51,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402722411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:51,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:51,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:59:51,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523305548] [2022-07-12 18:59:51,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:51,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:59:51,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:51,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:59:51,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:51,720 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:51,838 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2022-07-12 18:59:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:59:51,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 18:59:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:51,840 INFO L225 Difference]: With dead ends: 125 [2022-07-12 18:59:51,840 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 18:59:51,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:59:51,841 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 6 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:51,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 216 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 18:59:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-12 18:59:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 92 states have (on average 1.5434782608695652) internal successors, (142), 124 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2022-07-12 18:59:51,844 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 12 [2022-07-12 18:59:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:51,844 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2022-07-12 18:59:51,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2022-07-12 18:59:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:59:51,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:51,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:51,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:59:51,845 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:51,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:51,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-07-12 18:59:51,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:51,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043498854] [2022-07-12 18:59:51,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:51,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:51,877 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-12 18:59:51,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:51,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043498854] [2022-07-12 18:59:51,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043498854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:51,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:51,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:59:51,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549864885] [2022-07-12 18:59:51,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:51,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:59:51,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:51,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:59:51,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:51,889 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:51,991 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2022-07-12 18:59:51,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:59:51,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 18:59:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:51,992 INFO L225 Difference]: With dead ends: 124 [2022-07-12 18:59:51,992 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 18:59:51,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:59:51,992 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 7 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:51,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 226 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:51,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 18:59:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-12 18:59:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 92 states have (on average 1.5217391304347827) internal successors, (140), 123 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2022-07-12 18:59:51,995 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 12 [2022-07-12 18:59:51,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:51,995 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2022-07-12 18:59:51,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2022-07-12 18:59:51,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:59:51,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:51,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:51,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:59:51,996 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:51,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:51,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1478309260, now seen corresponding path program 1 times [2022-07-12 18:59:51,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:51,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572895058] [2022-07-12 18:59:51,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:51,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:52,043 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-12 18:59:52,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:52,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572895058] [2022-07-12 18:59:52,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572895058] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:52,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:52,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:59:52,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791999459] [2022-07-12 18:59:52,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:52,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:59:52,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:52,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:59:52,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:52,044 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:52,135 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-07-12 18:59:52,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:59:52,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:59:52,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:52,136 INFO L225 Difference]: With dead ends: 132 [2022-07-12 18:59:52,136 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 18:59:52,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:59:52,138 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 17 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:52,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 266 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:52,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 18:59:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2022-07-12 18:59:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 96 states have (on average 1.5104166666666667) internal successors, (145), 127 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-12 18:59:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2022-07-12 18:59:52,148 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 16 [2022-07-12 18:59:52,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:52,148 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2022-07-12 18:59:52,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:52,149 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2022-07-12 18:59:52,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:59:52,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:52,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:52,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:59:52,150 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:52,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:52,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-07-12 18:59:52,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:52,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625032312] [2022-07-12 18:59:52,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:52,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:52,259 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-12 18:59:52,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:52,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625032312] [2022-07-12 18:59:52,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625032312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:52,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:52,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:59:52,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155954681] [2022-07-12 18:59:52,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:52,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:59:52,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:52,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:59:52,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:59:52,261 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:52,508 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2022-07-12 18:59:52,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:59:52,508 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:59:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:52,509 INFO L225 Difference]: With dead ends: 132 [2022-07-12 18:59:52,509 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 18:59:52,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:59:52,509 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 148 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:52,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 167 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:52,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 18:59:52,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2022-07-12 18:59:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 96 states have (on average 1.5) internal successors, (144), 126 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2022-07-12 18:59:52,512 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 16 [2022-07-12 18:59:52,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:52,512 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2022-07-12 18:59:52,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2022-07-12 18:59:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:59:52,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:52,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:52,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:59:52,513 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:52,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:52,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-07-12 18:59:52,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:52,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015583815] [2022-07-12 18:59:52,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:52,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:52,635 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-12 18:59:52,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:52,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015583815] [2022-07-12 18:59:52,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015583815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:52,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:52,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:59:52,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215489222] [2022-07-12 18:59:52,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:52,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:59:52,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:52,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:59:52,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:59:52,637 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:52,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:52,992 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2022-07-12 18:59:52,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:59:52,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:59:52,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:52,993 INFO L225 Difference]: With dead ends: 128 [2022-07-12 18:59:52,993 INFO L226 Difference]: Without dead ends: 128 [2022-07-12 18:59:52,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:59:52,994 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 151 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:52,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 182 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-12 18:59:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2022-07-12 18:59:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 90 states have (on average 1.4777777777777779) internal successors, (133), 115 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 133 transitions. [2022-07-12 18:59:52,996 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 133 transitions. Word has length 16 [2022-07-12 18:59:52,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:52,996 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 133 transitions. [2022-07-12 18:59:52,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2022-07-12 18:59:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:59:52,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:52,997 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-12 18:59:52,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:59:52,997 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:52,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:52,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1695296497, now seen corresponding path program 1 times [2022-07-12 18:59:52,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:52,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916786749] [2022-07-12 18:59:52,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:52,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:53,067 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-12 18:59:53,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:53,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916786749] [2022-07-12 18:59:53,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916786749] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:53,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647330983] [2022-07-12 18:59:53,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:53,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:53,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:53,070 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-12 18:59:53,083 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-12 18:59:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:53,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 18:59:53,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:53,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:59:53,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:53,274 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-12 18:59:53,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:53,297 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 23 treesize of output 22 [2022-07-12 18:59:53,372 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:53,372 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 19 treesize of output 19 [2022-07-12 18:59:53,409 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-12 18:59:53,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:59:53,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647330983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:53,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:59:53,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2022-07-12 18:59:53,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787884862] [2022-07-12 18:59:53,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:53,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:59:53,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:53,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:59:53,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:59:53,419 INFO L87 Difference]: Start difference. First operand 116 states and 133 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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-12 18:59:53,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:53,473 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2022-07-12 18:59:53,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:59:53,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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-12 18:59:53,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:53,474 INFO L225 Difference]: With dead ends: 122 [2022-07-12 18:59:53,474 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 18:59:53,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:59:53,475 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:53,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 190 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 42 Unchecked, 0.0s Time] [2022-07-12 18:59:53,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 18:59:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-07-12 18:59:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 118 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2022-07-12 18:59:53,478 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 20 [2022-07-12 18:59:53,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:53,478 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2022-07-12 18:59:53,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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-12 18:59:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2022-07-12 18:59:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:59:53,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:53,481 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-12 18:59:53,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 18:59:53,698 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,SelfDestructingSolverStorable9 [2022-07-12 18:59:53,698 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:53,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1116806667, now seen corresponding path program 1 times [2022-07-12 18:59:53,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:53,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630063728] [2022-07-12 18:59:53,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:53,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:53,743 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-12 18:59:53,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:53,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630063728] [2022-07-12 18:59:53,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630063728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:53,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:53,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:59:53,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533002189] [2022-07-12 18:59:53,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:53,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:59:53,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:53,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:59:53,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:59:53,745 INFO L87 Difference]: Start difference. First operand 119 states and 136 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-12 18:59:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:53,873 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2022-07-12 18:59:53,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:59:53,874 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-12 18:59:53,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:53,874 INFO L225 Difference]: With dead ends: 185 [2022-07-12 18:59:53,875 INFO L226 Difference]: Without dead ends: 185 [2022-07-12 18:59:53,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:59:53,875 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 51 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:53,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 416 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-12 18:59:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 132. [2022-07-12 18:59:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 131 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2022-07-12 18:59:53,878 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 20 [2022-07-12 18:59:53,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:53,878 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2022-07-12 18:59:53,878 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-12 18:59:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2022-07-12 18:59:53,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:59:53,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:53,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:53,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:59:53,879 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:53,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:53,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1012953034, now seen corresponding path program 1 times [2022-07-12 18:59:53,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:53,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677302285] [2022-07-12 18:59:53,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:53,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:53,939 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-12 18:59:53,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:53,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677302285] [2022-07-12 18:59:53,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677302285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:53,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:53,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:59:53,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566973736] [2022-07-12 18:59:53,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:53,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:59:53,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:53,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:59:53,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:59:53,941 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:54,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:54,126 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2022-07-12 18:59:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:59:54,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 18:59:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:54,127 INFO L225 Difference]: With dead ends: 161 [2022-07-12 18:59:54,127 INFO L226 Difference]: Without dead ends: 161 [2022-07-12 18:59:54,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:59:54,128 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 213 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:54,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 119 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-12 18:59:54,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 133. [2022-07-12 18:59:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 132 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2022-07-12 18:59:54,132 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 21 [2022-07-12 18:59:54,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:54,133 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2022-07-12 18:59:54,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2022-07-12 18:59:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:59:54,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:54,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:54,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 18:59:54,135 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:54,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:54,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1012953035, now seen corresponding path program 1 times [2022-07-12 18:59:54,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:54,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993275238] [2022-07-12 18:59:54,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:54,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:54,249 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-12 18:59:54,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:54,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993275238] [2022-07-12 18:59:54,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993275238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:54,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:54,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:59:54,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697551325] [2022-07-12 18:59:54,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:54,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:59:54,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:54,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:59:54,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:59:54,251 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:54,601 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2022-07-12 18:59:54,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:59:54,601 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 18:59:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:54,602 INFO L225 Difference]: With dead ends: 192 [2022-07-12 18:59:54,602 INFO L226 Difference]: Without dead ends: 192 [2022-07-12 18:59:54,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:59:54,602 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 359 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:54,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 190 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-12 18:59:54,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 135. [2022-07-12 18:59:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 110 states have (on average 1.4272727272727272) internal successors, (157), 134 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-12 18:59:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2022-07-12 18:59:54,604 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 21 [2022-07-12 18:59:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:54,604 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2022-07-12 18:59:54,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2022-07-12 18:59:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:59:54,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:54,605 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-12 18:59:54,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 18:59:54,605 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:54,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1509706513, now seen corresponding path program 1 times [2022-07-12 18:59:54,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:54,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714438275] [2022-07-12 18:59:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:54,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:54,748 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-12 18:59:54,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:54,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714438275] [2022-07-12 18:59:54,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714438275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:54,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:54,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 18:59:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589644754] [2022-07-12 18:59:54,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:54,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:59:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:54,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:59:54,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:59:54,750 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:55,135 INFO L93 Difference]: Finished difference Result 202 states and 226 transitions. [2022-07-12 18:59:55,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:59:55,135 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 18:59:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:55,136 INFO L225 Difference]: With dead ends: 202 [2022-07-12 18:59:55,136 INFO L226 Difference]: Without dead ends: 202 [2022-07-12 18:59:55,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-07-12 18:59:55,136 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 147 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:55,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 409 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:59:55,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-12 18:59:55,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 147. [2022-07-12 18:59:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.3934426229508197) internal successors, (170), 146 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2022-07-12 18:59:55,139 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 23 [2022-07-12 18:59:55,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:55,139 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2022-07-12 18:59:55,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:55,139 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2022-07-12 18:59:55,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:59:55,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:55,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:55,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 18:59:55,139 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:55,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:55,139 INFO L85 PathProgramCache]: Analyzing trace with hash 442909652, now seen corresponding path program 1 times [2022-07-12 18:59:55,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:55,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818580438] [2022-07-12 18:59:55,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:55,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:55,163 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-12 18:59:55,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:55,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818580438] [2022-07-12 18:59:55,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818580438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:55,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:55,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:59:55,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124800924] [2022-07-12 18:59:55,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:55,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:59:55,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:55,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:59:55,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:59:55,165 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:55,242 INFO L93 Difference]: Finished difference Result 172 states and 192 transitions. [2022-07-12 18:59:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:59:55,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-12 18:59:55,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:55,243 INFO L225 Difference]: With dead ends: 172 [2022-07-12 18:59:55,243 INFO L226 Difference]: Without dead ends: 172 [2022-07-12 18:59:55,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-12 18:59:55,244 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 156 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:55,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 102 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:55,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-12 18:59:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 147. [2022-07-12 18:59:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 146 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-12 18:59:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2022-07-12 18:59:55,246 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 24 [2022-07-12 18:59:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:55,246 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2022-07-12 18:59:55,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2022-07-12 18:59:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 18:59:55,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:55,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:55,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:59:55,247 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:55,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:55,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1972392122, now seen corresponding path program 1 times [2022-07-12 18:59:55,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:55,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256025141] [2022-07-12 18:59:55,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:55,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:55,305 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-12 18:59:55,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:55,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256025141] [2022-07-12 18:59:55,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256025141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:55,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:55,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:59:55,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247896074] [2022-07-12 18:59:55,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:55,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:59:55,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:55,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:59:55,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:59:55,307 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:55,482 INFO L93 Difference]: Finished difference Result 207 states and 229 transitions. [2022-07-12 18:59:55,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:59:55,482 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-12 18:59:55,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:55,483 INFO L225 Difference]: With dead ends: 207 [2022-07-12 18:59:55,483 INFO L226 Difference]: Without dead ends: 207 [2022-07-12 18:59:55,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:59:55,483 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 169 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:55,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 292 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-12 18:59:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 151. [2022-07-12 18:59:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 126 states have (on average 1.373015873015873) internal successors, (173), 150 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-12 18:59:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions. [2022-07-12 18:59:55,485 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 25 [2022-07-12 18:59:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:55,485 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions. [2022-07-12 18:59:55,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions. [2022-07-12 18:59:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:59:55,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:55,486 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-12 18:59:55,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 18:59:55,486 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:55,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash 435867832, now seen corresponding path program 1 times [2022-07-12 18:59:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:55,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248108256] [2022-07-12 18:59:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:55,511 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-12 18:59:55,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:55,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248108256] [2022-07-12 18:59:55,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248108256] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:55,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:55,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:59:55,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758445350] [2022-07-12 18:59:55,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:55,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:59:55,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:55,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:59:55,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:59:55,512 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:55,591 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2022-07-12 18:59:55,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:59:55,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 18:59:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:55,592 INFO L225 Difference]: With dead ends: 169 [2022-07-12 18:59:55,592 INFO L226 Difference]: Without dead ends: 169 [2022-07-12 18:59:55,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-12 18:59:55,593 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 151 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:55,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 93 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-12 18:59:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2022-07-12 18:59:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 151 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2022-07-12 18:59:55,595 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 26 [2022-07-12 18:59:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:55,595 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2022-07-12 18:59:55,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:55,596 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2022-07-12 18:59:55,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:59:55,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:55,596 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] [2022-07-12 18:59:55,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 18:59:55,596 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:55,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:55,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1248965482, now seen corresponding path program 1 times [2022-07-12 18:59:55,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:55,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029157346] [2022-07-12 18:59:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:55,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:55,708 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-12 18:59:55,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:55,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029157346] [2022-07-12 18:59:55,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029157346] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:55,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472429798] [2022-07-12 18:59:55,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:55,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:55,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:55,710 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-12 18:59:55,755 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-12 18:59:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:55,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-12 18:59:55,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:55,811 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-12 18:59:55,826 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-12 18:59:55,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:59:55,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:55,851 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-12 18:59:55,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:55,855 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-12 18:59:55,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:55,878 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-12 18:59:55,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:55,884 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-12 18:59:55,912 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:59:55,912 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-12 18:59:55,934 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-12 18:59:55,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 14 treesize of output 16 [2022-07-12 18:59:55,951 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-12 18:59:55,958 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 23 treesize of output 22 [2022-07-12 18:59:55,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:55,986 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 18:59:55,986 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-07-12 18:59:55,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:55,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 18:59:56,232 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 18:59:56,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 42 [2022-07-12 18:59:56,240 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 18:59:56,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 19 [2022-07-12 18:59:56,248 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-12 18:59:56,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:56,468 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-12 18:59:56,468 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 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-12 18:59:56,484 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-12 18:59:56,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-12 18:59:56,778 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:56,778 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-12 18:59:56,783 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 30 treesize of output 22 [2022-07-12 18:59:56,796 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-07-12 18:59:56,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2022-07-12 18:59:56,808 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 18:59:56,808 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-12 18:59:56,833 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-12 18:59:56,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472429798] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:56,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:59:56,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11, 13] total 29 [2022-07-12 18:59:56,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819939982] [2022-07-12 18:59:56,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:56,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:59:56,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:56,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:59:56,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=705, Unknown=1, NotChecked=0, Total=812 [2022-07-12 18:59:56,835 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:57,359 INFO L93 Difference]: Finished difference Result 167 states and 189 transitions. [2022-07-12 18:59:57,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 18:59:57,360 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 18:59:57,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:57,360 INFO L225 Difference]: With dead ends: 167 [2022-07-12 18:59:57,360 INFO L226 Difference]: Without dead ends: 167 [2022-07-12 18:59:57,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=1240, Unknown=1, NotChecked=0, Total=1406 [2022-07-12 18:59:57,361 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:57,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 483 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 469 Invalid, 0 Unknown, 68 Unchecked, 0.3s Time] [2022-07-12 18:59:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-12 18:59:57,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 155. [2022-07-12 18:59:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 154 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2022-07-12 18:59:57,363 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 26 [2022-07-12 18:59:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:57,363 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2022-07-12 18:59:57,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:57,364 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2022-07-12 18:59:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:59:57,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:57,364 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-12 18:59:57,382 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-12 18:59:57,575 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,SelfDestructingSolverStorable17 [2022-07-12 18:59:57,576 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:57,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:57,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1016244459, now seen corresponding path program 1 times [2022-07-12 18:59:57,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:57,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563678818] [2022-07-12 18:59:57,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:57,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:57,679 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-12 18:59:57,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:57,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563678818] [2022-07-12 18:59:57,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563678818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:57,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:57,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:59:57,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055925491] [2022-07-12 18:59:57,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:57,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:59:57,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:57,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:59:57,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:59:57,681 INFO L87 Difference]: Start difference. First operand 155 states and 177 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:57,937 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-07-12 18:59:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:59:57,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 18:59:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:57,938 INFO L225 Difference]: With dead ends: 191 [2022-07-12 18:59:57,938 INFO L226 Difference]: Without dead ends: 191 [2022-07-12 18:59:57,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:59:57,939 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 68 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:57,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 373 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-12 18:59:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 160. [2022-07-12 18:59:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 135 states have (on average 1.348148148148148) internal successors, (182), 159 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 182 transitions. [2022-07-12 18:59:57,941 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 182 transitions. Word has length 26 [2022-07-12 18:59:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:57,941 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 182 transitions. [2022-07-12 18:59:57,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 182 transitions. [2022-07-12 18:59:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:59:57,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:57,942 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] [2022-07-12 18:59:57,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 18:59:57,942 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:57,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1528828450, now seen corresponding path program 1 times [2022-07-12 18:59:57,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:57,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756202924] [2022-07-12 18:59:57,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:57,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:58,082 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-12 18:59:58,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:58,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756202924] [2022-07-12 18:59:58,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756202924] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:58,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772779793] [2022-07-12 18:59:58,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:58,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:58,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:58,084 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-12 18:59:58,107 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-12 18:59:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:58,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 18:59:58,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:58,200 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-12 18:59:58,240 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:59:58,241 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-12 18:59:58,262 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-12 18:59:58,313 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:59:58,314 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 19 treesize of output 22 [2022-07-12 18:59:58,362 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:59:58,362 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-12 18:59:58,392 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:59:58,393 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-12 18:59:58,453 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-12 18:59:58,457 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-12 18:59:58,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:58,471 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2022-07-12 18:59:58,477 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-12 18:59:58,477 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 19 treesize of output 18 [2022-07-12 18:59:58,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) is different from false [2022-07-12 18:59:58,483 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem5#1.base|)) is different from false [2022-07-12 18:59:58,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 18:59:58,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_797))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse1)))) is different from false [2022-07-12 18:59:58,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_797 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_797))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 18:59:58,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:58,502 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 51 treesize of output 36 [2022-07-12 18:59:58,509 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:58,510 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 408 treesize of output 343 [2022-07-12 18:59:58,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:58,518 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 328 treesize of output 300 [2022-07-12 18:59:58,522 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 292 treesize of output 276 [2022-07-12 18:59:58,736 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-12 18:59:58,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772779793] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:59:58,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:59:58,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 31 [2022-07-12 18:59:58,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491601944] [2022-07-12 18:59:58,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:58,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 18:59:58,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:58,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 18:59:58,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=576, Unknown=6, NotChecked=318, Total=992 [2022-07-12 18:59:58,738 INFO L87 Difference]: Start difference. First operand 160 states and 182 transitions. Second operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:59,720 INFO L93 Difference]: Finished difference Result 316 states and 354 transitions. [2022-07-12 18:59:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 18:59:59,721 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 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-12 18:59:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:59,721 INFO L225 Difference]: With dead ends: 316 [2022-07-12 18:59:59,722 INFO L226 Difference]: Without dead ends: 316 [2022-07-12 18:59:59,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=352, Invalid=1558, Unknown=6, NotChecked=534, Total=2450 [2022-07-12 18:59:59,723 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 451 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 3127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1560 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:59,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 662 Invalid, 3127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1457 Invalid, 0 Unknown, 1560 Unchecked, 0.6s Time] [2022-07-12 18:59:59,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-07-12 18:59:59,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 179. [2022-07-12 18:59:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 178 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:59,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 206 transitions. [2022-07-12 18:59:59,725 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 206 transitions. Word has length 27 [2022-07-12 18:59:59,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:59,726 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 206 transitions. [2022-07-12 18:59:59,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:59,726 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 206 transitions. [2022-07-12 18:59:59,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:59:59,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:59,726 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] [2022-07-12 18:59:59,761 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-12 18:59:59,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:59,935 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 18:59:59,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:59,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1528828449, now seen corresponding path program 1 times [2022-07-12 18:59:59,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:59,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383558276] [2022-07-12 18:59:59,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:59,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:00,096 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-12 19:00:00,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:00:00,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383558276] [2022-07-12 19:00:00,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383558276] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:00:00,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300484677] [2022-07-12 19:00:00,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:00,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:00:00,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:00:00,100 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-12 19:00:00,129 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-12 19:00:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:00,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-12 19:00:00,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:00,211 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-12 19:00:00,259 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:00:00,260 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-12 19:00:00,264 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-12 19:00:00,291 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-12 19:00:00,302 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-12 19:00:00,368 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:00:00,369 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-12 19:00:00,372 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-12 19:00:00,447 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:00:00,447 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-12 19:00:00,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:00,454 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-12 19:00:00,465 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:00:00,466 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-12 19:00:00,468 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-12 19:00:00,549 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-12 19:00:00,551 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-12 19:00:00,588 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-12 19:00:00,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:00,693 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_902) |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_~x~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_902 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 19:00:00,707 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_902 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_902) |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~mem5#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 19:00:00,714 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_902) |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_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_902 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 19:00:00,726 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_898))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_899) .cse0 v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_899) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 19:00:00,734 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_898))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_899) .cse1 v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int))) (<= 0 (select (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_899) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_898) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_902)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 19:00:00,746 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:00,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-07-12 19:00:00,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:00,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-07-12 19:00:00,757 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:00,758 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 632 treesize of output 567 [2022-07-12 19:00:00,770 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:00,771 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 1872 treesize of output 1783 [2022-07-12 19:00:00,814 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 1768 treesize of output 1736 [2022-07-12 19:00:00,823 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 1736 treesize of output 1656 [2022-07-12 19:00:00,832 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 1656 treesize of output 1576 [2022-07-12 19:00:00,847 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:00,847 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 1576 treesize of output 1436