./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 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-optional-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:13:58,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:13:58,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:13:58,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:13:58,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:13:58,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:13:58,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:13:58,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:13:58,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:13:58,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:13:58,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:13:58,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:13:58,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:13:58,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:13:58,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:13:58,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:13:58,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:13:58,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:13:58,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:13:58,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:13:58,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:13:58,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:13:58,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:13:58,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:13:58,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:13:58,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:13:58,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:13:58,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:13:58,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:13:58,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:13:58,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:13:58,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:13:58,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:13:58,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:13:58,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:13:58,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:13:58,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:13:58,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:13:58,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:13:58,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:13:58,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:13:58,404 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:13:58,442 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:13:58,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:13:58,443 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:13:58,443 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:13:58,444 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:13:58,444 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:13:58,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:13:58,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:13:58,445 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:13:58,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:13:58,446 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:13:58,446 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:13:58,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:13:58,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:13:58,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:13:58,447 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:13:58,447 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:13:58,447 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:13:58,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:13:58,448 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:13:58,448 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:13:58,448 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:13:58,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:13:58,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:13:58,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:13:58,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:13:58,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:13:58,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:13:58,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:13:58,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:13:58,450 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:13:58,450 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:13:58,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:13:58,450 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:13:58,451 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2023-02-15 13:13:58,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:13:58,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:13:58,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:13:58,749 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:13:58,750 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:13:58,751 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-1.i [2023-02-15 13:13:59,863 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:14:00,124 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:14:00,134 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2023-02-15 13:14:00,148 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b09eb5aa/a59f49f985274f769ef6bf86c22c4c97/FLAG45b5065a1 [2023-02-15 13:14:00,163 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b09eb5aa/a59f49f985274f769ef6bf86c22c4c97 [2023-02-15 13:14:00,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:14:00,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:14:00,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:14:00,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:14:00,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:14:00,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:14:00" (1/1) ... [2023-02-15 13:14:00,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da33150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:00, skipping insertion in model container [2023-02-15 13:14:00,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:14:00" (1/1) ... [2023-02-15 13:14:00,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:14:00,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:14:00,407 WARN L237 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-optional-1.i[22753,22766] [2023-02-15 13:14:00,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:14:00,431 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:14:00,488 WARN L237 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-optional-1.i[22753,22766] [2023-02-15 13:14:00,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:14:00,535 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:14:00,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:00 WrapperNode [2023-02-15 13:14:00,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:14:00,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:14:00,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:14:00,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:14:00,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:00" (1/1) ... [2023-02-15 13:14:00,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:00" (1/1) ... [2023-02-15 13:14:00,594 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 140 [2023-02-15 13:14:00,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:14:00,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:14:00,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:14:00,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:14:00,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:00" (1/1) ... [2023-02-15 13:14:00,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:00" (1/1) ... [2023-02-15 13:14:00,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:00" (1/1) ... [2023-02-15 13:14:00,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:00" (1/1) ... [2023-02-15 13:14:00,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:00" (1/1) ... [2023-02-15 13:14:00,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:00" (1/1) ... [2023-02-15 13:14:00,623 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:00" (1/1) ... [2023-02-15 13:14:00,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:00" (1/1) ... [2023-02-15 13:14:00,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:14:00,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:14:00,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:14:00,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:14:00,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:00" (1/1) ... [2023-02-15 13:14:00,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:14:00,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:14:00,659 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) [2023-02-15 13:14:00,690 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 [2023-02-15 13:14:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:14:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:14:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:14:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:14:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:14:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:14:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:14:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:14:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:14:00,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:14:00,828 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:14:00,829 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:14:01,334 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:14:01,340 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:14:01,348 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 13:14:01,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:14:01 BoogieIcfgContainer [2023-02-15 13:14:01,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:14:01,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:14:01,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:14:01,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:14:01,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:14:00" (1/3) ... [2023-02-15 13:14:01,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b00248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:14:01, skipping insertion in model container [2023-02-15 13:14:01,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:00" (2/3) ... [2023-02-15 13:14:01,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b00248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:14:01, skipping insertion in model container [2023-02-15 13:14:01,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:14:01" (3/3) ... [2023-02-15 13:14:01,358 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2023-02-15 13:14:01,379 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:14:01,393 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2023-02-15 13:14:01,452 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:14:01,459 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@323c81ca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:14:01,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2023-02-15 13:14:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 80 states have (on average 2.1125) internal successors, (169), 152 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) [2023-02-15 13:14:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:14:01,469 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:01,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:14:01,470 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:01,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 13:14:01,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:01,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751521952] [2023-02-15 13:14:01,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:01,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:01,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:01,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751521952] [2023-02-15 13:14:01,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751521952] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:01,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:01,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:14:01,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624792846] [2023-02-15 13:14:01,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:01,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:14:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:01,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:14:01,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:14:01,666 INFO L87 Difference]: Start difference. First operand has 153 states, 80 states have (on average 2.1125) internal successors, (169), 152 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) 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) [2023-02-15 13:14:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:01,870 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2023-02-15 13:14:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:14:01,872 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 [2023-02-15 13:14:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:01,885 INFO L225 Difference]: With dead ends: 154 [2023-02-15 13:14:01,886 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 13:14:01,887 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 [2023-02-15 13:14:01,890 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:01,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 87 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 13:14:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2023-02-15 13:14:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 82 states have (on average 1.9024390243902438) internal successors, (156), 143 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2023-02-15 13:14:01,945 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 3 [2023-02-15 13:14:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:01,946 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2023-02-15 13:14:01,947 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) [2023-02-15 13:14:01,947 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2023-02-15 13:14:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:14:01,947 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:01,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:14:01,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:14:01,948 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:01,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:01,949 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 13:14:01,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:01,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875541820] [2023-02-15 13:14:01,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:01,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:02,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:02,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875541820] [2023-02-15 13:14:02,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875541820] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:02,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:02,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:14:02,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874798913] [2023-02-15 13:14:02,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:02,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:14:02,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:02,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:14:02,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:14:02,085 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:02,195 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2023-02-15 13:14:02,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:14:02,196 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 [2023-02-15 13:14:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:02,201 INFO L225 Difference]: With dead ends: 139 [2023-02-15 13:14:02,202 INFO L226 Difference]: Without dead ends: 139 [2023-02-15 13:14:02,205 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 [2023-02-15 13:14:02,208 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 113 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:02,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 100 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:02,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-02-15 13:14:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2023-02-15 13:14:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 82 states have (on average 1.7926829268292683) internal successors, (147), 134 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2023-02-15 13:14:02,218 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 3 [2023-02-15 13:14:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:02,219 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2023-02-15 13:14:02,219 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) [2023-02-15 13:14:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2023-02-15 13:14:02,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:14:02,220 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:02,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:02,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:14:02,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:02,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:02,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656077, now seen corresponding path program 1 times [2023-02-15 13:14:02,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:02,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008462903] [2023-02-15 13:14:02,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:02,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:02,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:02,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008462903] [2023-02-15 13:14:02,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008462903] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:02,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:02,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:14:02,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151430145] [2023-02-15 13:14:02,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:02,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:14:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:02,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:14:02,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:14:02,421 INFO L87 Difference]: Start difference. First operand 135 states and 147 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) [2023-02-15 13:14:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:02,646 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2023-02-15 13:14:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:14:02,646 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 [2023-02-15 13:14:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:02,647 INFO L225 Difference]: With dead ends: 179 [2023-02-15 13:14:02,648 INFO L226 Difference]: Without dead ends: 179 [2023-02-15 13:14:02,648 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 [2023-02-15 13:14:02,649 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 52 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:02,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 330 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:14:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-15 13:14:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 134. [2023-02-15 13:14:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2023-02-15 13:14:02,661 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 12 [2023-02-15 13:14:02,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:02,662 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2023-02-15 13:14:02,662 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) [2023-02-15 13:14:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2023-02-15 13:14:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:14:02,663 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:02,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:02,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:14:02,663 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:02,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:02,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656076, now seen corresponding path program 1 times [2023-02-15 13:14:02,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:02,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97315208] [2023-02-15 13:14:02,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:02,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:02,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:02,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97315208] [2023-02-15 13:14:02,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97315208] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:02,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:02,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:14:02,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180019347] [2023-02-15 13:14:02,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:02,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:14:02,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:02,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:14:02,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:14:02,882 INFO L87 Difference]: Start difference. First operand 134 states and 146 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) [2023-02-15 13:14:03,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:03,052 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2023-02-15 13:14:03,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:14:03,053 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 [2023-02-15 13:14:03,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:03,054 INFO L225 Difference]: With dead ends: 133 [2023-02-15 13:14:03,054 INFO L226 Difference]: Without dead ends: 133 [2023-02-15 13:14:03,054 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 [2023-02-15 13:14:03,055 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 3 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:03,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 366 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:03,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-15 13:14:03,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-02-15 13:14:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.7682926829268293) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2023-02-15 13:14:03,062 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 12 [2023-02-15 13:14:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:03,062 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2023-02-15 13:14:03,062 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) [2023-02-15 13:14:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2023-02-15 13:14:03,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 13:14:03,063 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:03,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:03,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:14:03,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:03,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:03,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115696, now seen corresponding path program 1 times [2023-02-15 13:14:03,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:03,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399487854] [2023-02-15 13:14:03,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:03,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:03,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:03,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399487854] [2023-02-15 13:14:03,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399487854] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:03,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:03,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:14:03,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427947760] [2023-02-15 13:14:03,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:03,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:14:03,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:03,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:14:03,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:14:03,186 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:03,322 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2023-02-15 13:14:03,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:14:03,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 13:14:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:03,323 INFO L225 Difference]: With dead ends: 134 [2023-02-15 13:14:03,323 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 13:14:03,324 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 [2023-02-15 13:14:03,326 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 186 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:03,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 75 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 13:14:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2023-02-15 13:14:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.6136363636363635) 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) [2023-02-15 13:14:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2023-02-15 13:14:03,344 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 13 [2023-02-15 13:14:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:03,344 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2023-02-15 13:14:03,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2023-02-15 13:14:03,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 13:14:03,350 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:03,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:03,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:14:03,350 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:03,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:03,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115697, now seen corresponding path program 1 times [2023-02-15 13:14:03,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:03,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982724389] [2023-02-15 13:14:03,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:03,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:03,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:03,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982724389] [2023-02-15 13:14:03,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982724389] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:03,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:03,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:14:03,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279054041] [2023-02-15 13:14:03,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:03,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:14:03,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:03,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:14:03,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:14:03,485 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:03,640 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2023-02-15 13:14:03,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:14:03,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 13:14:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:03,642 INFO L225 Difference]: With dead ends: 182 [2023-02-15 13:14:03,642 INFO L226 Difference]: Without dead ends: 182 [2023-02-15 13:14:03,642 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 [2023-02-15 13:14:03,643 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 190 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:03,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 118 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:03,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-15 13:14:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 156. [2023-02-15 13:14:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 155 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2023-02-15 13:14:03,647 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 13 [2023-02-15 13:14:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:03,647 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2023-02-15 13:14:03,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2023-02-15 13:14:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:14:03,648 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:03,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:03,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 13:14:03,648 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:03,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash -288943149, now seen corresponding path program 1 times [2023-02-15 13:14:03,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:03,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765409266] [2023-02-15 13:14:03,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:03,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:03,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:03,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765409266] [2023-02-15 13:14:03,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765409266] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:03,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:03,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:14:03,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007238955] [2023-02-15 13:14:03,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:03,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:14:03,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:03,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:14:03,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:14:03,790 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand has 5 states, 4 states have (on average 4.0) 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) [2023-02-15 13:14:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:03,924 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2023-02-15 13:14:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:14:03,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) 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 [2023-02-15 13:14:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:03,925 INFO L225 Difference]: With dead ends: 155 [2023-02-15 13:14:03,926 INFO L226 Difference]: Without dead ends: 155 [2023-02-15 13:14:03,926 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 [2023-02-15 13:14:03,927 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 10 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 308 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 [2023-02-15 13:14:03,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 308 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-15 13:14:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2023-02-15 13:14:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 119 states have (on average 1.5210084033613445) internal successors, (181), 154 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2023-02-15 13:14:03,932 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 16 [2023-02-15 13:14:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:03,932 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2023-02-15 13:14:03,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) 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) [2023-02-15 13:14:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2023-02-15 13:14:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:14:03,933 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:03,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:03,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 13:14:03,934 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:03,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:03,935 INFO L85 PathProgramCache]: Analyzing trace with hash -288943148, now seen corresponding path program 1 times [2023-02-15 13:14:03,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:03,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129999090] [2023-02-15 13:14:03,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:03,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:04,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:04,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129999090] [2023-02-15 13:14:04,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129999090] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:04,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:04,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:14:04,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593569674] [2023-02-15 13:14:04,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:04,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:14:04,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:04,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:14:04,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:14:04,135 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand has 5 states, 4 states have (on average 4.0) 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) [2023-02-15 13:14:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:04,287 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2023-02-15 13:14:04,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:14:04,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) 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 [2023-02-15 13:14:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:04,289 INFO L225 Difference]: With dead ends: 154 [2023-02-15 13:14:04,289 INFO L226 Difference]: Without dead ends: 154 [2023-02-15 13:14:04,289 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 [2023-02-15 13:14:04,290 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 5 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:04,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 299 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-02-15 13:14:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2023-02-15 13:14:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.504201680672269) internal successors, (179), 153 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2023-02-15 13:14:04,293 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 16 [2023-02-15 13:14:04,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:04,293 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2023-02-15 13:14:04,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) 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) [2023-02-15 13:14:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2023-02-15 13:14:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 13:14:04,294 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:04,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:04,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 13:14:04,294 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:04,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:04,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1504363226, now seen corresponding path program 1 times [2023-02-15 13:14:04,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:04,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490715487] [2023-02-15 13:14:04,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:04,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:04,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:04,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490715487] [2023-02-15 13:14:04,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490715487] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:04,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:04,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:14:04,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853032265] [2023-02-15 13:14:04,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:04,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:14:04,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:04,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:14:04,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:14:04,336 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:04,446 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2023-02-15 13:14:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:14:04,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 13:14:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:04,448 INFO L225 Difference]: With dead ends: 173 [2023-02-15 13:14:04,448 INFO L226 Difference]: Without dead ends: 173 [2023-02-15 13:14:04,448 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 [2023-02-15 13:14:04,450 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 176 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:04,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 168 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-02-15 13:14:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2023-02-15 13:14:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.4873949579831933) internal successors, (177), 153 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) [2023-02-15 13:14:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2023-02-15 13:14:04,458 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 18 [2023-02-15 13:14:04,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:04,458 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2023-02-15 13:14:04,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2023-02-15 13:14:04,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 13:14:04,461 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:04,461 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] [2023-02-15 13:14:04,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 13:14:04,462 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:04,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:04,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394517, now seen corresponding path program 1 times [2023-02-15 13:14:04,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:04,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969900962] [2023-02-15 13:14:04,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:04,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:04,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:04,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969900962] [2023-02-15 13:14:04,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969900962] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:04,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:04,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:14:04,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347401863] [2023-02-15 13:14:04,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:04,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:14:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:04,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:14:04,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:14:04,677 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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) [2023-02-15 13:14:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:04,967 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2023-02-15 13:14:04,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:14:04,968 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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 [2023-02-15 13:14:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:04,969 INFO L225 Difference]: With dead ends: 155 [2023-02-15 13:14:04,969 INFO L226 Difference]: Without dead ends: 155 [2023-02-15 13:14:04,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:14:04,969 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 176 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:04,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 257 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:14:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-15 13:14:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2023-02-15 13:14:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 152 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2023-02-15 13:14:04,973 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 20 [2023-02-15 13:14:04,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:04,973 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2023-02-15 13:14:04,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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) [2023-02-15 13:14:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2023-02-15 13:14:04,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 13:14:04,973 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:04,973 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] [2023-02-15 13:14:04,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 13:14:04,974 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:04,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:04,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394518, now seen corresponding path program 1 times [2023-02-15 13:14:04,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:04,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478105197] [2023-02-15 13:14:04,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:04,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:05,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:05,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478105197] [2023-02-15 13:14:05,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478105197] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:05,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:05,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:14:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411162175] [2023-02-15 13:14:05,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:05,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:14:05,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:05,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:14:05,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:14:05,267 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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) [2023-02-15 13:14:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:05,739 INFO L93 Difference]: Finished difference Result 146 states and 167 transitions. [2023-02-15 13:14:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 13:14:05,740 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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 [2023-02-15 13:14:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:05,740 INFO L225 Difference]: With dead ends: 146 [2023-02-15 13:14:05,740 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 13:14:05,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-02-15 13:14:05,741 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 177 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:05,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 264 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:14:05,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 13:14:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2023-02-15 13:14:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 111 states have (on average 1.4054054054054055) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2023-02-15 13:14:05,745 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 20 [2023-02-15 13:14:05,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:05,745 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2023-02-15 13:14:05,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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) [2023-02-15 13:14:05,745 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2023-02-15 13:14:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 13:14:05,746 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:05,746 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] [2023-02-15 13:14:05,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 13:14:05,746 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:05,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:05,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1737058081, now seen corresponding path program 1 times [2023-02-15 13:14:05,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:05,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818330971] [2023-02-15 13:14:05,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:05,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:05,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:05,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818330971] [2023-02-15 13:14:05,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818330971] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:05,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:05,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:14:05,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906445018] [2023-02-15 13:14:05,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:05,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:14:05,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:05,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:14:05,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:14:05,787 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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) [2023-02-15 13:14:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:05,823 INFO L93 Difference]: Finished difference Result 160 states and 190 transitions. [2023-02-15 13:14:05,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:14:05,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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 [2023-02-15 13:14:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:05,824 INFO L225 Difference]: With dead ends: 160 [2023-02-15 13:14:05,825 INFO L226 Difference]: Without dead ends: 160 [2023-02-15 13:14:05,825 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 [2023-02-15 13:14:05,826 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 21 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:05,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 316 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:14:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-15 13:14:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 138. [2023-02-15 13:14:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 115 states have (on average 1.391304347826087) internal successors, (160), 137 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2023-02-15 13:14:05,830 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 21 [2023-02-15 13:14:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:05,830 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2023-02-15 13:14:05,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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) [2023-02-15 13:14:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2023-02-15 13:14:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 13:14:05,831 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:05,831 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] [2023-02-15 13:14:05,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 13:14:05,832 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:05,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:05,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1420838518, now seen corresponding path program 1 times [2023-02-15 13:14:05,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:05,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626401680] [2023-02-15 13:14:05,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:05,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:05,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:05,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626401680] [2023-02-15 13:14:05,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626401680] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:05,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:05,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:14:05,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544028445] [2023-02-15 13:14:05,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:05,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:14:05,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:05,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:14:05,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:14:05,861 INFO L87 Difference]: Start difference. First operand 138 states and 160 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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) [2023-02-15 13:14:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:05,871 INFO L93 Difference]: Finished difference Result 140 states and 162 transitions. [2023-02-15 13:14:05,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:14:05,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 [2023-02-15 13:14:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:05,873 INFO L225 Difference]: With dead ends: 140 [2023-02-15 13:14:05,873 INFO L226 Difference]: Without dead ends: 140 [2023-02-15 13:14:05,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:14:05,874 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:05,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:14:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-15 13:14:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-02-15 13:14:05,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 139 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2023-02-15 13:14:05,878 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 23 [2023-02-15 13:14:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:05,878 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2023-02-15 13:14:05,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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) [2023-02-15 13:14:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2023-02-15 13:14:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 13:14:05,879 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:05,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, 1, 1] [2023-02-15 13:14:05,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 13:14:05,880 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:05,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462334, now seen corresponding path program 1 times [2023-02-15 13:14:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:05,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384759212] [2023-02-15 13:14:05,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:05,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:06,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:06,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384759212] [2023-02-15 13:14:06,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384759212] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:06,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:06,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:14:06,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737995658] [2023-02-15 13:14:06,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:06,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:14:06,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:06,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:14:06,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:14:06,002 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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) [2023-02-15 13:14:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:06,241 INFO L93 Difference]: Finished difference Result 269 states and 312 transitions. [2023-02-15 13:14:06,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:14:06,241 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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 [2023-02-15 13:14:06,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:06,243 INFO L225 Difference]: With dead ends: 269 [2023-02-15 13:14:06,243 INFO L226 Difference]: Without dead ends: 269 [2023-02-15 13:14:06,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:14:06,243 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 160 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:06,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 334 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:14:06,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-15 13:14:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 154. [2023-02-15 13:14:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 153 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2023-02-15 13:14:06,247 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 23 [2023-02-15 13:14:06,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:06,247 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2023-02-15 13:14:06,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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) [2023-02-15 13:14:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2023-02-15 13:14:06,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 13:14:06,248 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:06,248 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] [2023-02-15 13:14:06,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 13:14:06,249 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:06,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:06,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462335, now seen corresponding path program 1 times [2023-02-15 13:14:06,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:06,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063860056] [2023-02-15 13:14:06,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:06,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:06,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:06,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063860056] [2023-02-15 13:14:06,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063860056] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:06,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:06,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:14:06,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880690100] [2023-02-15 13:14:06,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:06,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:14:06,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:06,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:14:06,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:14:06,398 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) [2023-02-15 13:14:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:06,739 INFO L93 Difference]: Finished difference Result 279 states and 325 transitions. [2023-02-15 13:14:06,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:14:06,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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 [2023-02-15 13:14:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:06,741 INFO L225 Difference]: With dead ends: 279 [2023-02-15 13:14:06,741 INFO L226 Difference]: Without dead ends: 279 [2023-02-15 13:14:06,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-02-15 13:14:06,741 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 166 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:06,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 469 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:14:06,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-02-15 13:14:06,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 150. [2023-02-15 13:14:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 149 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) [2023-02-15 13:14:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2023-02-15 13:14:06,745 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 23 [2023-02-15 13:14:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:06,745 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2023-02-15 13:14:06,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) [2023-02-15 13:14:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2023-02-15 13:14:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:14:06,746 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:06,746 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] [2023-02-15 13:14:06,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 13:14:06,747 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:06,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:06,747 INFO L85 PathProgramCache]: Analyzing trace with hash 375423567, now seen corresponding path program 1 times [2023-02-15 13:14:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:06,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941515300] [2023-02-15 13:14:06,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:06,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:06,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:06,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941515300] [2023-02-15 13:14:06,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941515300] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:06,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:06,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:14:06,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526437983] [2023-02-15 13:14:06,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:06,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:14:06,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:06,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:14:06,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:14:06,950 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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) [2023-02-15 13:14:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:07,214 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2023-02-15 13:14:07,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:14:07,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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 [2023-02-15 13:14:07,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:07,215 INFO L225 Difference]: With dead ends: 225 [2023-02-15 13:14:07,215 INFO L226 Difference]: Without dead ends: 225 [2023-02-15 13:14:07,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:14:07,216 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 235 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:07,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 360 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:14:07,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-15 13:14:07,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 156. [2023-02-15 13:14:07,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 133 states have (on average 1.3609022556390977) internal successors, (181), 155 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 181 transitions. [2023-02-15 13:14:07,219 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 181 transitions. Word has length 25 [2023-02-15 13:14:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:07,220 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 181 transitions. [2023-02-15 13:14:07,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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) [2023-02-15 13:14:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 181 transitions. [2023-02-15 13:14:07,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 13:14:07,221 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:07,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:07,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 13:14:07,221 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:07,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:07,222 INFO L85 PathProgramCache]: Analyzing trace with hash 729704446, now seen corresponding path program 1 times [2023-02-15 13:14:07,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:07,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81303936] [2023-02-15 13:14:07,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:07,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:07,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:07,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81303936] [2023-02-15 13:14:07,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81303936] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:07,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:07,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:14:07,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589024827] [2023-02-15 13:14:07,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:07,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:14:07,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:07,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:14:07,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:14:07,405 INFO L87 Difference]: Start difference. First operand 156 states and 181 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:07,859 INFO L93 Difference]: Finished difference Result 318 states and 365 transitions. [2023-02-15 13:14:07,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 13:14:07,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 13:14:07,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:07,861 INFO L225 Difference]: With dead ends: 318 [2023-02-15 13:14:07,862 INFO L226 Difference]: Without dead ends: 318 [2023-02-15 13:14:07,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:14:07,863 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 360 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:07,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 459 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:14:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2023-02-15 13:14:07,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 169. [2023-02-15 13:14:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.356164383561644) internal successors, (198), 168 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2023-02-15 13:14:07,867 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 27 [2023-02-15 13:14:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:07,868 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2023-02-15 13:14:07,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2023-02-15 13:14:07,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 13:14:07,869 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:07,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:07,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 13:14:07,870 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:07,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:07,870 INFO L85 PathProgramCache]: Analyzing trace with hash 729704447, now seen corresponding path program 1 times [2023-02-15 13:14:07,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:07,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722276974] [2023-02-15 13:14:07,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:07,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:08,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:08,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722276974] [2023-02-15 13:14:08,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722276974] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:08,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:08,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:14:08,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081860529] [2023-02-15 13:14:08,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:08,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:14:08,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:08,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:14:08,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:14:08,248 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:08,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:08,707 INFO L93 Difference]: Finished difference Result 251 states and 287 transitions. [2023-02-15 13:14:08,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:14:08,707 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 13:14:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:08,708 INFO L225 Difference]: With dead ends: 251 [2023-02-15 13:14:08,708 INFO L226 Difference]: Without dead ends: 251 [2023-02-15 13:14:08,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:14:08,709 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 279 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:08,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 458 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:14:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-02-15 13:14:08,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 169. [2023-02-15 13:14:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 168 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2023-02-15 13:14:08,711 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 27 [2023-02-15 13:14:08,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:08,711 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2023-02-15 13:14:08,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2023-02-15 13:14:08,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 13:14:08,712 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:08,712 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] [2023-02-15 13:14:08,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 13:14:08,712 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:08,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:08,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1443803627, now seen corresponding path program 1 times [2023-02-15 13:14:08,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:08,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416050145] [2023-02-15 13:14:08,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:08,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:08,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:08,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416050145] [2023-02-15 13:14:08,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416050145] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:08,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:08,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:14:08,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159095131] [2023-02-15 13:14:08,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:08,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:14:08,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:08,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:14:08,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:14:08,753 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:08,769 INFO L93 Difference]: Finished difference Result 181 states and 210 transitions. [2023-02-15 13:14:08,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:14:08,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 13:14:08,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:08,770 INFO L225 Difference]: With dead ends: 181 [2023-02-15 13:14:08,770 INFO L226 Difference]: Without dead ends: 181 [2023-02-15 13:14:08,771 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 [2023-02-15 13:14:08,771 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 10 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:08,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 317 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:14:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-15 13:14:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2023-02-15 13:14:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 172 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 200 transitions. [2023-02-15 13:14:08,784 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 200 transitions. Word has length 27 [2023-02-15 13:14:08,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:08,785 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 200 transitions. [2023-02-15 13:14:08,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 200 transitions. [2023-02-15 13:14:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 13:14:08,786 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:08,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:08,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 13:14:08,786 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:08,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:08,787 INFO L85 PathProgramCache]: Analyzing trace with hash 17756513, now seen corresponding path program 1 times [2023-02-15 13:14:08,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:08,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615481934] [2023-02-15 13:14:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:08,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:08,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:08,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615481934] [2023-02-15 13:14:08,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615481934] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:08,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:08,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:14:08,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821001813] [2023-02-15 13:14:08,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:08,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:14:08,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:08,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:14:08,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:14:08,909 INFO L87 Difference]: Start difference. First operand 173 states and 200 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:09,040 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2023-02-15 13:14:09,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:14:09,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-15 13:14:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:09,042 INFO L225 Difference]: With dead ends: 182 [2023-02-15 13:14:09,042 INFO L226 Difference]: Without dead ends: 182 [2023-02-15 13:14:09,042 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 [2023-02-15 13:14:09,042 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 11 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:09,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 296 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-15 13:14:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2023-02-15 13:14:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.3266666666666667) internal successors, (199), 171 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 199 transitions. [2023-02-15 13:14:09,045 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 199 transitions. Word has length 28 [2023-02-15 13:14:09,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:09,046 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 199 transitions. [2023-02-15 13:14:09,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 199 transitions. [2023-02-15 13:14:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 13:14:09,046 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:09,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:09,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 13:14:09,046 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:09,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:09,047 INFO L85 PathProgramCache]: Analyzing trace with hash 17756514, now seen corresponding path program 1 times [2023-02-15 13:14:09,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:09,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160236420] [2023-02-15 13:14:09,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:09,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:09,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:09,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160236420] [2023-02-15 13:14:09,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160236420] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:09,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:09,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:14:09,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165516877] [2023-02-15 13:14:09,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:09,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:14:09,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:09,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:14:09,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:14:09,206 INFO L87 Difference]: Start difference. First operand 172 states and 199 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:09,326 INFO L93 Difference]: Finished difference Result 171 states and 198 transitions. [2023-02-15 13:14:09,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:14:09,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-15 13:14:09,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:09,327 INFO L225 Difference]: With dead ends: 171 [2023-02-15 13:14:09,327 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 13:14:09,327 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 [2023-02-15 13:14:09,328 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 3 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:09,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 282 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 13:14:09,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2023-02-15 13:14:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.32) internal successors, (198), 170 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2023-02-15 13:14:09,331 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 28 [2023-02-15 13:14:09,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:09,332 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2023-02-15 13:14:09,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2023-02-15 13:14:09,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 13:14:09,332 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:09,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:09,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 13:14:09,332 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:09,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:09,333 INFO L85 PathProgramCache]: Analyzing trace with hash -42480305, now seen corresponding path program 1 times [2023-02-15 13:14:09,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:09,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175917704] [2023-02-15 13:14:09,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:09,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:09,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:09,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175917704] [2023-02-15 13:14:09,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175917704] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:09,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:09,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:14:09,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165491018] [2023-02-15 13:14:09,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:09,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:14:09,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:09,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:14:09,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:14:09,533 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:10,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:10,023 INFO L93 Difference]: Finished difference Result 251 states and 281 transitions. [2023-02-15 13:14:10,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:14:10,025 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 13:14:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:10,026 INFO L225 Difference]: With dead ends: 251 [2023-02-15 13:14:10,026 INFO L226 Difference]: Without dead ends: 251 [2023-02-15 13:14:10,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:14:10,027 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 280 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:10,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 692 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:14:10,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-02-15 13:14:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 171. [2023-02-15 13:14:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 170 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 197 transitions. [2023-02-15 13:14:10,030 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 197 transitions. Word has length 29 [2023-02-15 13:14:10,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:10,030 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 197 transitions. [2023-02-15 13:14:10,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:10,030 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 197 transitions. [2023-02-15 13:14:10,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 13:14:10,030 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:10,030 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:10,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 13:14:10,031 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:10,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:10,031 INFO L85 PathProgramCache]: Analyzing trace with hash 439757914, now seen corresponding path program 1 times [2023-02-15 13:14:10,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:10,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010292331] [2023-02-15 13:14:10,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:10,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:10,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:10,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010292331] [2023-02-15 13:14:10,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010292331] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:14:10,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768865106] [2023-02-15 13:14:10,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:10,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:10,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:14:10,253 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) [2023-02-15 13:14:10,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 13:14:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:10,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 13:14:10,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:14:10,475 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:10,479 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:10,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:10,505 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:10,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:10,513 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:10,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:10,541 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:10,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:10,547 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:10,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:10,559 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:10,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:10,569 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:10,711 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:14:10,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:14:10,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:14:10,720 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:10,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2023-02-15 13:14:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:10,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:14:11,155 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 13:14:11,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-02-15 13:14:11,171 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 13:14:11,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:11,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768865106] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:14:11,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:14:11,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2023-02-15 13:14:11,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941530641] [2023-02-15 13:14:11,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:14:11,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:14:11,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:11,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:14:11,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:14:11,190 INFO L87 Difference]: Start difference. First operand 171 states and 197 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:11,545 INFO L93 Difference]: Finished difference Result 212 states and 241 transitions. [2023-02-15 13:14:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:14:11,545 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 13:14:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:11,546 INFO L225 Difference]: With dead ends: 212 [2023-02-15 13:14:11,546 INFO L226 Difference]: Without dead ends: 212 [2023-02-15 13:14:11,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-02-15 13:14:11,547 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 354 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:11,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 378 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:14:11,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-02-15 13:14:11,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 184. [2023-02-15 13:14:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 163 states have (on average 1.3006134969325154) internal successors, (212), 183 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 212 transitions. [2023-02-15 13:14:11,550 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 212 transitions. Word has length 29 [2023-02-15 13:14:11,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:11,550 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 212 transitions. [2023-02-15 13:14:11,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 212 transitions. [2023-02-15 13:14:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 13:14:11,551 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:11,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:11,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 13:14:11,757 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,SelfDestructingSolverStorable22 [2023-02-15 13:14:11,757 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:11,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:11,757 INFO L85 PathProgramCache]: Analyzing trace with hash -469775188, now seen corresponding path program 1 times [2023-02-15 13:14:11,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:11,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612595480] [2023-02-15 13:14:11,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:11,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:11,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:11,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:11,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612595480] [2023-02-15 13:14:11,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612595480] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:11,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:11,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:14:11,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656667031] [2023-02-15 13:14:11,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:11,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:14:11,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:11,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:14:11,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:14:11,917 INFO L87 Difference]: Start difference. First operand 184 states and 212 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:12,219 INFO L93 Difference]: Finished difference Result 232 states and 263 transitions. [2023-02-15 13:14:12,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:14:12,220 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 13:14:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:12,221 INFO L225 Difference]: With dead ends: 232 [2023-02-15 13:14:12,221 INFO L226 Difference]: Without dead ends: 232 [2023-02-15 13:14:12,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:14:12,222 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 58 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:12,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 507 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:14:12,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-15 13:14:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 190. [2023-02-15 13:14:12,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.2958579881656804) internal successors, (219), 189 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 219 transitions. [2023-02-15 13:14:12,225 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 219 transitions. Word has length 31 [2023-02-15 13:14:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:12,225 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 219 transitions. [2023-02-15 13:14:12,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 219 transitions. [2023-02-15 13:14:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 13:14:12,226 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:12,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:12,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-15 13:14:12,226 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:12,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash 605010984, now seen corresponding path program 1 times [2023-02-15 13:14:12,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:12,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749215906] [2023-02-15 13:14:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:12,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:12,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:12,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749215906] [2023-02-15 13:14:12,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749215906] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:12,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:12,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 13:14:12,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994694199] [2023-02-15 13:14:12,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:12,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:14:12,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:12,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:14:12,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:14:12,593 INFO L87 Difference]: Start difference. First operand 190 states and 219 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:13,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:13,278 INFO L93 Difference]: Finished difference Result 228 states and 254 transitions. [2023-02-15 13:14:13,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 13:14:13,278 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-15 13:14:13,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:13,279 INFO L225 Difference]: With dead ends: 228 [2023-02-15 13:14:13,279 INFO L226 Difference]: Without dead ends: 228 [2023-02-15 13:14:13,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2023-02-15 13:14:13,280 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 204 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:13,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 743 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:14:13,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-02-15 13:14:13,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 187. [2023-02-15 13:14:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 186 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 214 transitions. [2023-02-15 13:14:13,283 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 214 transitions. Word has length 34 [2023-02-15 13:14:13,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:13,283 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 214 transitions. [2023-02-15 13:14:13,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:13,284 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2023-02-15 13:14:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 13:14:13,284 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:13,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:13,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-15 13:14:13,284 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:13,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:13,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1443725027, now seen corresponding path program 1 times [2023-02-15 13:14:13,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:13,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700757641] [2023-02-15 13:14:13,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:13,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:14:13,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:13,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700757641] [2023-02-15 13:14:13,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700757641] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:13,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:13,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:14:13,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064535627] [2023-02-15 13:14:13,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:13,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:14:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:13,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:14:13,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:14:13,448 INFO L87 Difference]: Start difference. First operand 187 states and 214 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:13,635 INFO L93 Difference]: Finished difference Result 234 states and 265 transitions. [2023-02-15 13:14:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:14:13,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-02-15 13:14:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:13,636 INFO L225 Difference]: With dead ends: 234 [2023-02-15 13:14:13,636 INFO L226 Difference]: Without dead ends: 234 [2023-02-15 13:14:13,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:14:13,637 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 149 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:13,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 335 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:14:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-02-15 13:14:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 204. [2023-02-15 13:14:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.2677595628415301) internal successors, (232), 203 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2023-02-15 13:14:13,641 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 36 [2023-02-15 13:14:13,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:13,641 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2023-02-15 13:14:13,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2023-02-15 13:14:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 13:14:13,641 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:13,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:13,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-15 13:14:13,642 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:13,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:13,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1443714042, now seen corresponding path program 1 times [2023-02-15 13:14:13,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:13,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701274884] [2023-02-15 13:14:13,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:13,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:14:13,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:13,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701274884] [2023-02-15 13:14:13,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701274884] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:13,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:13,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:14:13,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877698179] [2023-02-15 13:14:13,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:13,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:14:13,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:13,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:14:13,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:14:13,697 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:13,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:13,805 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2023-02-15 13:14:13,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:14:13,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-02-15 13:14:13,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:13,806 INFO L225 Difference]: With dead ends: 221 [2023-02-15 13:14:13,806 INFO L226 Difference]: Without dead ends: 221 [2023-02-15 13:14:13,807 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 [2023-02-15 13:14:13,807 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 125 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:13,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 136 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:13,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-02-15 13:14:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 206. [2023-02-15 13:14:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.2648648648648648) internal successors, (234), 205 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 234 transitions. [2023-02-15 13:14:13,810 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 234 transitions. Word has length 36 [2023-02-15 13:14:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:13,811 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 234 transitions. [2023-02-15 13:14:13,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 234 transitions. [2023-02-15 13:14:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:14:13,811 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:13,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:13,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-15 13:14:13,812 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:13,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:13,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1805802628, now seen corresponding path program 1 times [2023-02-15 13:14:13,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:13,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255498051] [2023-02-15 13:14:13,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:13,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:14,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:14,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255498051] [2023-02-15 13:14:14,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255498051] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:14:14,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379430298] [2023-02-15 13:14:14,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:14,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:14,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:14:14,161 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) [2023-02-15 13:14:14,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 13:14:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:14,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 13:14:14,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:14:14,285 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:14,303 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:14,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:14:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:14,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:14:14,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-02-15 13:14:14,996 INFO L350 Elim1Store]: Elim1 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 46 treesize of output 42 [2023-02-15 13:14:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:15,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379430298] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 13:14:15,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:14:15,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 8] total 22 [2023-02-15 13:14:15,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82815576] [2023-02-15 13:14:15,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:15,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:14:15,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:15,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:14:15,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:14:15,035 INFO L87 Difference]: Start difference. First operand 206 states and 234 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:15,338 INFO L93 Difference]: Finished difference Result 219 states and 247 transitions. [2023-02-15 13:14:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:14:15,339 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 13:14:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:15,339 INFO L225 Difference]: With dead ends: 219 [2023-02-15 13:14:15,340 INFO L226 Difference]: Without dead ends: 219 [2023-02-15 13:14:15,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2023-02-15 13:14:15,341 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 243 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:15,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 327 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:14:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-15 13:14:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 204. [2023-02-15 13:14:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.2622950819672132) internal successors, (231), 203 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 231 transitions. [2023-02-15 13:14:15,344 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 231 transitions. Word has length 37 [2023-02-15 13:14:15,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:15,344 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 231 transitions. [2023-02-15 13:14:15,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:15,344 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 231 transitions. [2023-02-15 13:14:15,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 13:14:15,345 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:15,345 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:15,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 13:14:15,552 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,SelfDestructingSolverStorable27 [2023-02-15 13:14:15,553 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:15,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:15,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1898858598, now seen corresponding path program 1 times [2023-02-15 13:14:15,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:15,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446211654] [2023-02-15 13:14:15,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:15,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:16,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:16,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446211654] [2023-02-15 13:14:16,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446211654] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:14:16,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869596049] [2023-02-15 13:14:16,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:16,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:16,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:14:16,192 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) [2023-02-15 13:14:16,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 13:14:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:16,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 13:14:16,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:14:16,335 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:16,355 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:16,414 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:14:16,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 13:14:16,468 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:14:16,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2023-02-15 13:14:16,602 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:14:16,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2023-02-15 13:14:16,769 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:14:16,769 INFO L350 Elim1Store]: Elim1 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 73 treesize of output 63 [2023-02-15 13:14:16,857 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:14:16,857 INFO L350 Elim1Store]: Elim1 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 73 treesize of output 63 [2023-02-15 13:14:16,889 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:14:16,890 INFO L350 Elim1Store]: Elim1 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 73 treesize of output 63 [2023-02-15 13:14:17,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:17,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 36 [2023-02-15 13:14:17,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:17,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:14:17,239 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-02-15 13:14:17,295 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int))) (= (select |c_#valid| (select (select (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_1039) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-02-15 13:14:17,310 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1036))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1039)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-02-15 13:14:17,318 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (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_1036))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1039)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-02-15 13:14:17,377 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8| 1))) (or (not (= (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 0)) (= (select .cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_1036))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1039)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)))) is different from false [2023-02-15 13:14:17,405 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8| 1))) (or (not (= (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 0)) (= (select .cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_1036))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1039)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)))) is different from false [2023-02-15 13:14:17,432 INFO L321 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2023-02-15 13:14:17,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 46 [2023-02-15 13:14:17,441 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:14:17,441 INFO L350 Elim1Store]: Elim1 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 177 treesize of output 117 [2023-02-15 13:14:17,447 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 90 [2023-02-15 13:14:17,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:17,456 INFO L350 Elim1Store]: Elim1 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 90 treesize of output 88 [2023-02-15 13:14:25,583 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 20 DAG size of output: 13 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:14:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 13:14:25,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869596049] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:14:25,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:14:25,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 34 [2023-02-15 13:14:25,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549392102] [2023-02-15 13:14:25,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:14:25,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 13:14:25,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:25,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 13:14:25,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=675, Unknown=9, NotChecked=354, Total=1190 [2023-02-15 13:14:25,609 INFO L87 Difference]: Start difference. First operand 204 states and 231 transitions. Second operand has 35 states, 34 states have (on average 3.088235294117647) internal successors, (105), 35 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:35,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:14:40,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:40,851 INFO L93 Difference]: Finished difference Result 503 states and 564 transitions. [2023-02-15 13:14:40,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-15 13:14:40,851 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.088235294117647) internal successors, (105), 35 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-15 13:14:40,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:40,853 INFO L225 Difference]: With dead ends: 503 [2023-02-15 13:14:40,853 INFO L226 Difference]: Without dead ends: 503 [2023-02-15 13:14:40,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 58 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=755, Invalid=3137, Unknown=38, NotChecked=762, Total=4692 [2023-02-15 13:14:40,855 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 644 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 80 mSolverCounterUnsat, 33 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 3545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 33 IncrementalHoareTripleChecker+Unknown, 1744 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:40,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1485 Invalid, 3545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1688 Invalid, 33 Unknown, 1744 Unchecked, 3.4s Time] [2023-02-15 13:14:40,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-02-15 13:14:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 247. [2023-02-15 13:14:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 226 states have (on average 1.252212389380531) internal successors, (283), 246 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 283 transitions. [2023-02-15 13:14:40,860 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 283 transitions. Word has length 38 [2023-02-15 13:14:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:40,860 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 283 transitions. [2023-02-15 13:14:40,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.088235294117647) internal successors, (105), 35 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 283 transitions. [2023-02-15 13:14:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 13:14:40,861 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:40,862 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:40,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 13:14:41,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 13:14:41,067 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:14:41,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:41,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1898858599, now seen corresponding path program 1 times [2023-02-15 13:14:41,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:41,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048540964] [2023-02-15 13:14:41,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:41,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:41,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:41,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048540964] [2023-02-15 13:14:41,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048540964] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:14:41,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129374860] [2023-02-15 13:14:41,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:41,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:41,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:14:41,699 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) [2023-02-15 13:14:41,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 13:14:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:41,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-15 13:14:41,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:14:41,859 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:41,884 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:41,891 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:41,974 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:14:41,975 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:42,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:42,022 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:42,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:42,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2023-02-15 13:14:42,147 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:14:42,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2023-02-15 13:14:42,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 13:14:42,309 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:14:42,309 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 22 [2023-02-15 13:14:42,315 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 13:14:42,333 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:14:42,333 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:42,424 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:14:42,425 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 22 [2023-02-15 13:14:42,430 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 13:14:42,445 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:14:42,446 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:42,499 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:14:42,500 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:42,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 13:14:42,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 13:14:42,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:42,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:42,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2023-02-15 13:14:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:42,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:14:42,852 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1171 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1172 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2023-02-15 13:14:42,880 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1171 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1171) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2023-02-15 13:14:42,971 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1165))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1171)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1166) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1165) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-15 13:14:42,983 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1165))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1171)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1166) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1165) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) is different from false [2023-02-15 13:14:43,007 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1165))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1171)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1164 Int) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1164)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1166) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1165) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-15 13:14:49,265 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:14:49,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:49,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2023-02-15 13:14:49,275 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:14:49,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:49,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 164 [2023-02-15 13:14:49,282 INFO L350 Elim1Store]: Elim1 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 146 treesize of output 130 [2023-02-15 13:14:49,285 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:14:49,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 110 [2023-02-15 13:14:49,363 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:14:49,366 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:14:49,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2023-02-15 13:14:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:49,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129374860] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:14:49,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:14:49,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 38 [2023-02-15 13:14:49,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422334800] [2023-02-15 13:14:49,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:14:49,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 13:14:49,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:49,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 13:14:49,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=942, Unknown=14, NotChecked=330, Total=1406 [2023-02-15 13:14:49,409 INFO L87 Difference]: Start difference. First operand 247 states and 283 transitions. Second operand has 38 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 38 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:51,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:14:53,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:14:55,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:15:05,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 13:15:18,339 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) |c_ULTIMATE.start_main_~x~0#1.offset|) (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1165))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1171)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1166) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1165) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 1) (= (select .cse4 .cse0) |c_ULTIMATE.start_main_~x~0#1.base|)))) is different from false [2023-02-15 13:15:18,588 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse8 (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_11| Int)) (or (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_11|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1165))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1171)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_11|) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (= (select .cse3 .cse4) |c_ULTIMATE.start_main_~x~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_11| Int)) (or (forall ((v_ArrVal_1164 Int) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_66| v_ArrVal_1164)) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1166) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse5 |v_ULTIMATE.start_main_~x~0#1.offset_66| |v_ULTIMATE.start_main_#t~malloc7#1.base_11|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1165) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_66|) v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_11|) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_66| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_66| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_66| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_11| Int)) (or (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse5 |v_ULTIMATE.start_main_~x~0#1.offset_66| |v_ULTIMATE.start_main_#t~malloc7#1.base_11|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1165))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_66|) v_ArrVal_1171)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_11|) 0)))))) (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1165))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1171)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1166) (select (select (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1165) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)) 1) (= (select .cse1 .cse4) |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_11| Int)) (or (forall ((v_ArrVal_1164 Int) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1164)) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1166) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_11|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1165) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_11|) 0))))))) is different from false [2023-02-15 13:15:19,528 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) |c_ULTIMATE.start_main_~x~0#1.offset|) (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1165))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1171)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1166) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1165) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 1) (= (select .cse4 .cse0) |c_ULTIMATE.start_main_~x~0#1.base|)))) is different from false [2023-02-15 13:15:19,829 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) |c_ULTIMATE.start_main_~x~0#1.offset|) (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1165))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1171)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1166) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1165) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (select .cse4 .cse0) |c_ULTIMATE.start_main_~x~0#1.base|)))) is different from false [2023-02-15 13:15:21,407 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1171 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1171) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1171 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1171) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-02-15 13:15:24,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:15:29,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:15:29,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:15:29,978 INFO L93 Difference]: Finished difference Result 739 states and 816 transitions. [2023-02-15 13:15:29,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2023-02-15 13:15:29,980 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 38 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-15 13:15:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:15:29,982 INFO L225 Difference]: With dead ends: 739 [2023-02-15 13:15:29,982 INFO L226 Difference]: Without dead ends: 739 [2023-02-15 13:15:29,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 124 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 4339 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=2076, Invalid=11242, Unknown=62, NotChecked=2370, Total=15750 [2023-02-15 13:15:29,986 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 1673 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 2517 mSolverCounterSat, 214 mSolverCounterUnsat, 107 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 4253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 2517 IncrementalHoareTripleChecker+Invalid, 107 IncrementalHoareTripleChecker+Unknown, 1415 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:15:29,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 1790 Invalid, 4253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 2517 Invalid, 107 Unknown, 1415 Unchecked, 18.2s Time] [2023-02-15 13:15:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2023-02-15 13:15:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 275. [2023-02-15 13:15:29,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 254 states have (on average 1.2322834645669292) internal successors, (313), 274 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 313 transitions. [2023-02-15 13:15:29,999 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 313 transitions. Word has length 38 [2023-02-15 13:15:30,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:15:30,000 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 313 transitions. [2023-02-15 13:15:30,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 38 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 313 transitions. [2023-02-15 13:15:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:15:30,005 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:15:30,005 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:15:30,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:15:30,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:30,212 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:15:30,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:15:30,212 INFO L85 PathProgramCache]: Analyzing trace with hash 117734209, now seen corresponding path program 1 times [2023-02-15 13:15:30,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:15:30,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962913525] [2023-02-15 13:15:30,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:30,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:15:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:30,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:15:30,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962913525] [2023-02-15 13:15:30,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962913525] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:15:30,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752621478] [2023-02-15 13:15:30,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:30,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:30,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:15:30,549 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:15:30,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 13:15:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:30,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-15 13:15:30,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:15:31,415 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:15:31,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:15:31,423 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:15:31,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:31,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2023-02-15 13:15:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:31,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:15:32,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:32,054 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 45 [2023-02-15 13:15:32,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:32,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2023-02-15 13:15:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:32,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752621478] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:15:32,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:15:32,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2023-02-15 13:15:32,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482027393] [2023-02-15 13:15:32,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:15:32,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 13:15:32,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:15:32,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 13:15:32,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-02-15 13:15:32,609 INFO L87 Difference]: Start difference. First operand 275 states and 313 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:15:34,433 INFO L93 Difference]: Finished difference Result 352 states and 389 transitions. [2023-02-15 13:15:34,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:15:34,434 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-15 13:15:34,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:15:34,436 INFO L225 Difference]: With dead ends: 352 [2023-02-15 13:15:34,436 INFO L226 Difference]: Without dead ends: 352 [2023-02-15 13:15:34,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2023-02-15 13:15:34,437 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 608 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 61 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:15:34,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 740 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 745 Invalid, 3 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 13:15:34,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-02-15 13:15:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 294. [2023-02-15 13:15:34,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 273 states have (on average 1.2380952380952381) internal successors, (338), 293 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:34,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 338 transitions. [2023-02-15 13:15:34,444 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 338 transitions. Word has length 39 [2023-02-15 13:15:34,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:15:34,444 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 338 transitions. [2023-02-15 13:15:34,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 338 transitions. [2023-02-15 13:15:34,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:15:34,445 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:15:34,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:15:34,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 13:15:34,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:34,649 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:15:34,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:15:34,649 INFO L85 PathProgramCache]: Analyzing trace with hash -645207573, now seen corresponding path program 1 times [2023-02-15 13:15:34,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:15:34,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062389137] [2023-02-15 13:15:34,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:34,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:15:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:15:34,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:15:34,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062389137] [2023-02-15 13:15:34,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062389137] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:15:34,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716009211] [2023-02-15 13:15:34,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:34,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:34,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:15:34,797 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:15:34,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 13:15:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:34,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:15:34,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:15:35,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:15:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:15:35,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:15:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:15:35,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716009211] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:15:35,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:15:35,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-15 13:15:35,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079319689] [2023-02-15 13:15:35,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:15:35,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:15:35,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:15:35,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:15:35,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:15:35,321 INFO L87 Difference]: Start difference. First operand 294 states and 338 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:35,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:15:35,799 INFO L93 Difference]: Finished difference Result 300 states and 343 transitions. [2023-02-15 13:15:35,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:15:35,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-15 13:15:35,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:15:35,800 INFO L225 Difference]: With dead ends: 300 [2023-02-15 13:15:35,800 INFO L226 Difference]: Without dead ends: 265 [2023-02-15 13:15:35,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:15:35,801 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 31 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:15:35,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 294 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:15:35,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-02-15 13:15:35,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2023-02-15 13:15:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 244 states have (on average 1.2540983606557377) internal successors, (306), 264 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 306 transitions. [2023-02-15 13:15:35,806 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 306 transitions. Word has length 40 [2023-02-15 13:15:35,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:15:35,806 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 306 transitions. [2023-02-15 13:15:35,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 306 transitions. [2023-02-15 13:15:35,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:15:35,807 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:15:35,807 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:15:35,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:15:36,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:36,013 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:15:36,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:15:36,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1766771785, now seen corresponding path program 1 times [2023-02-15 13:15:36,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:15:36,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198695089] [2023-02-15 13:15:36,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:36,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:15:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:38,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:15:38,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198695089] [2023-02-15 13:15:38,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198695089] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:15:38,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578317247] [2023-02-15 13:15:38,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:38,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:38,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:15:38,144 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:15:38,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 13:15:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:38,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-15 13:15:38,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:15:38,320 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:38,448 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:38,463 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:38,687 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:15:38,687 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:38,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:15:38,786 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:38,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:15:38,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2023-02-15 13:15:39,023 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:15:39,024 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:39,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2023-02-15 13:15:39,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:15:39,325 INFO L350 Elim1Store]: Elim1 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 23 [2023-02-15 13:15:39,356 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:15:39,357 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:39,523 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:15:39,523 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:39,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:15:39,534 INFO L350 Elim1Store]: Elim1 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 23 [2023-02-15 13:15:39,595 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:15:39,595 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:39,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2023-02-15 13:15:40,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:15:40,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-02-15 13:15:40,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:15:40,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2023-02-15 13:15:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:40,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:15:40,327 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1414 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1415 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2023-02-15 13:15:40,597 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1415 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1415) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1414 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1414) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) is different from false [2023-02-15 13:15:40,629 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1409 (Array Int Int)) (v_ArrVal_1408 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1408) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1409) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1415) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1409))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1414)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-02-15 13:15:40,649 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1409))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1414)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1409 (Array Int Int)) (v_ArrVal_1408 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1408) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1409) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1415) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-15 13:15:45,246 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:15:45,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:45,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 54 [2023-02-15 13:15:45,265 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:15:45,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:45,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2023-02-15 13:15:45,292 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:15:45,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2023-02-15 13:15:45,301 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:15:45,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:45,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 168 [2023-02-15 13:15:45,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 118 [2023-02-15 13:15:45,320 INFO L350 Elim1Store]: Elim1 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 140 treesize of output 120 [2023-02-15 13:15:45,328 INFO L350 Elim1Store]: Elim1 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 102 treesize of output 90 [2023-02-15 13:15:45,388 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:15:45,389 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:15:45,392 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:15:45,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2023-02-15 13:15:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:45,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578317247] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:15:45,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:15:45,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 15] total 38 [2023-02-15 13:15:45,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772651402] [2023-02-15 13:15:45,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:15:45,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 13:15:45,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:15:45,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 13:15:45,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=930, Unknown=36, NotChecked=268, Total=1406 [2023-02-15 13:15:45,501 INFO L87 Difference]: Start difference. First operand 265 states and 306 transitions. Second operand has 38 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 38 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:51,840 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1415 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1415) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_1414 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1))) is different from false [2023-02-15 13:15:59,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:15:59,200 INFO L93 Difference]: Finished difference Result 611 states and 693 transitions. [2023-02-15 13:15:59,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-15 13:15:59,201 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 38 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-15 13:15:59,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:15:59,203 INFO L225 Difference]: With dead ends: 611 [2023-02-15 13:15:59,203 INFO L226 Difference]: Without dead ends: 611 [2023-02-15 13:15:59,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=869, Invalid=3625, Unknown=82, NotChecked=680, Total=5256 [2023-02-15 13:15:59,206 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 798 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 2087 mSolverCounterSat, 118 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 3202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2087 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 961 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:15:59,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1791 Invalid, 3202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2087 Invalid, 36 Unknown, 961 Unchecked, 4.5s Time] [2023-02-15 13:15:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2023-02-15 13:15:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 265. [2023-02-15 13:15:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 244 states have (on average 1.2540983606557377) internal successors, (306), 264 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 306 transitions. [2023-02-15 13:15:59,220 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 306 transitions. Word has length 40 [2023-02-15 13:15:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:15:59,221 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 306 transitions. [2023-02-15 13:15:59,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 38 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 306 transitions. [2023-02-15 13:15:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 13:15:59,222 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:15:59,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:15:59,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 13:15:59,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:59,428 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:15:59,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:15:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1739978080, now seen corresponding path program 1 times [2023-02-15 13:15:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:15:59,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119932385] [2023-02-15 13:15:59,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:59,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:15:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:59,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:15:59,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119932385] [2023-02-15 13:15:59,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119932385] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:15:59,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:15:59,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:15:59,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837408773] [2023-02-15 13:15:59,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:15:59,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:15:59,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:15:59,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:15:59,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:15:59,824 INFO L87 Difference]: Start difference. First operand 265 states and 306 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:00,695 INFO L93 Difference]: Finished difference Result 294 states and 334 transitions. [2023-02-15 13:16:00,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:16:00,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-15 13:16:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:00,696 INFO L225 Difference]: With dead ends: 294 [2023-02-15 13:16:00,696 INFO L226 Difference]: Without dead ends: 289 [2023-02-15 13:16:00,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2023-02-15 13:16:00,697 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 185 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:00,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 368 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 13:16:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-15 13:16:00,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 261. [2023-02-15 13:16:00,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 240 states have (on average 1.2541666666666667) internal successors, (301), 260 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 301 transitions. [2023-02-15 13:16:00,701 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 301 transitions. Word has length 42 [2023-02-15 13:16:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:00,701 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 301 transitions. [2023-02-15 13:16:00,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 301 transitions. [2023-02-15 13:16:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 13:16:00,702 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:00,702 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:00,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-02-15 13:16:00,702 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:16:00,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:00,703 INFO L85 PathProgramCache]: Analyzing trace with hash 25746790, now seen corresponding path program 1 times [2023-02-15 13:16:00,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:00,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054678796] [2023-02-15 13:16:00,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:00,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:16:01,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054678796] [2023-02-15 13:16:01,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054678796] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:16:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410573014] [2023-02-15 13:16:01,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:01,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:16:01,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:16:01,827 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:16:01,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 13:16:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:01,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-15 13:16:01,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:16:01,979 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:02,046 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:16:02,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 13:16:02,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:16:02,197 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:16:02,198 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 35 [2023-02-15 13:16:02,351 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2023-02-15 13:16:02,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2023-02-15 13:16:02,478 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:16:02,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-02-15 13:16:02,838 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:16:02,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 79 [2023-02-15 13:16:03,348 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:16:03,348 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 100 [2023-02-15 13:16:03,590 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:16:03,590 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 100 [2023-02-15 13:16:03,652 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:16:03,653 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 100 [2023-02-15 13:16:04,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-02-15 13:16:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:16:04,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:16:04,220 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1593 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1593) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-02-15 13:16:04,408 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1593 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1590))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1593)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-02-15 13:16:04,418 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1593 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (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_1590))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1593)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-02-15 13:16:04,622 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1593 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_19| Int) (v_ArrVal_1590 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_19| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_19| v_ArrVal_1590))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1593)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|) 0)))) is different from false [2023-02-15 13:16:04,646 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1593 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_19| Int) (v_ArrVal_1590 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_19| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_19| v_ArrVal_1590))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1593)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|) 0)))) is different from false [2023-02-15 13:16:04,671 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1593 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_19| Int) (v_ArrVal_1590 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_19| 1) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1586))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_19| v_ArrVal_1590))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1593)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2023-02-15 13:16:04,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:16:04,771 INFO L350 Elim1Store]: Elim1 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 95 treesize of output 66 [2023-02-15 13:16:04,775 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:16:04,779 INFO L350 Elim1Store]: Elim1 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 96 treesize of output 92 [2023-02-15 13:16:04,789 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 47 [2023-02-15 13:16:04,801 INFO L350 Elim1Store]: Elim1 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 61 treesize of output 53 [2023-02-15 13:16:04,808 INFO L350 Elim1Store]: Elim1 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 96 treesize of output 88 [2023-02-15 13:16:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 13:16:07,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410573014] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:16:07,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:16:07,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 38 [2023-02-15 13:16:07,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407352830] [2023-02-15 13:16:07,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:16:07,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 13:16:07,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:07,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 13:16:07,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=862, Unknown=39, NotChecked=402, Total=1482 [2023-02-15 13:16:07,402 INFO L87 Difference]: Start difference. First operand 261 states and 301 transitions. Second operand has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:10,838 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= (select |c_#valid| (select .cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) 1) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) 1) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1593 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1590))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1593)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) 1)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~x~0#1.offset| .cse1)) (= (select |c_#valid| (select .cse0 .cse1)) 1))) is different from false [2023-02-15 13:16:32,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:16:36,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:16:39,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:16:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:48,962 INFO L93 Difference]: Finished difference Result 656 states and 751 transitions. [2023-02-15 13:16:48,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-02-15 13:16:48,963 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-15 13:16:48,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:48,965 INFO L225 Difference]: With dead ends: 656 [2023-02-15 13:16:48,965 INFO L226 Difference]: Without dead ends: 656 [2023-02-15 13:16:48,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 78 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 1672 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=818, Invalid=4392, Unknown=74, NotChecked=1036, Total=6320 [2023-02-15 13:16:48,968 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 621 mSDsluCounter, 1799 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 90 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 4022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 1683 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:48,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 1907 Invalid, 4022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2236 Invalid, 13 Unknown, 1683 Unchecked, 21.8s Time] [2023-02-15 13:16:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-02-15 13:16:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 304. [2023-02-15 13:16:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 283 states have (on average 1.2473498233215548) internal successors, (353), 303 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 353 transitions. [2023-02-15 13:16:48,976 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 353 transitions. Word has length 42 [2023-02-15 13:16:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:48,976 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 353 transitions. [2023-02-15 13:16:48,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 353 transitions. [2023-02-15 13:16:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 13:16:48,977 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:48,977 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:48,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 13:16:49,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-02-15 13:16:49,184 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-15 13:16:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash 25746791, now seen corresponding path program 1 times [2023-02-15 13:16:49,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:49,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884877668] [2023-02-15 13:16:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:49,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:16:56,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:56,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884877668] [2023-02-15 13:16:56,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884877668] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:16:56,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846458797] [2023-02-15 13:16:56,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:56,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:16:56,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:16:56,127 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:16:56,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 13:16:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:56,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 71 conjunts are in the unsatisfiable core [2023-02-15 13:16:56,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:16:56,296 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:56,863 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:16:56,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 13:16:56,949 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:57,291 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:57,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:16:58,386 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:16:58,387 INFO L350 Elim1Store]: Elim1 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 57 treesize of output 54 [2023-02-15 13:16:58,447 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 24 [2023-02-15 13:16:59,220 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-02-15 13:16:59,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:16:59,441 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-02-15 13:16:59,442 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 24 [2023-02-15 13:17:00,038 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-15 13:17:00,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:17:00,216 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:17:00,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-02-15 13:17:01,838 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:01,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 87 [2023-02-15 13:17:01,885 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2023-02-15 13:17:04,027 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:04,027 INFO L350 Elim1Store]: Elim1 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 125 treesize of output 107 [2023-02-15 13:17:04,108 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:04,109 INFO L350 Elim1Store]: Elim1 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 134 treesize of output 134 [2023-02-15 13:17:05,110 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:05,110 INFO L350 Elim1Store]: Elim1 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 125 treesize of output 107 [2023-02-15 13:17:05,196 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:05,196 INFO L350 Elim1Store]: Elim1 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 134 treesize of output 134 [2023-02-15 13:17:05,501 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:05,501 INFO L350 Elim1Store]: Elim1 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 125 treesize of output 107 [2023-02-15 13:17:05,592 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:05,592 INFO L350 Elim1Store]: Elim1 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 134 treesize of output 134 [2023-02-15 13:17:07,945 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:07,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-02-15 13:17:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:08,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:17:09,655 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2023-02-15 13:17:09,849 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2023-02-15 13:17:09,900 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) is different from false [2023-02-15 13:17:09,983 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1740) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1741) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1741))) (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| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1740) .cse1 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))))) is different from false [2023-02-15 13:17:10,048 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1741))) (let ((.cse1 (select (select .cse3 |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_1740) .cse1 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1740) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1741) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) is different from false [2023-02-15 13:17:10,160 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1741))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1740) .cse1 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1747 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1740) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1741) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) is different from false [2023-02-15 13:17:22,034 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:22,035 INFO L350 Elim1Store]: Elim1 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 90 treesize of output 81 [2023-02-15 13:17:22,076 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:22,076 INFO L350 Elim1Store]: Elim1 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 70 treesize of output 61 [2023-02-15 13:17:22,104 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:17:22,122 INFO L350 Elim1Store]: Elim1 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 160 treesize of output 156 [2023-02-15 13:17:22,133 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:17:22,143 INFO L350 Elim1Store]: Elim1 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 126 treesize of output 120 [2023-02-15 13:17:22,192 INFO L350 Elim1Store]: Elim1 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 67 treesize of output 63 [2023-02-15 13:17:22,210 INFO L350 Elim1Store]: Elim1 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 122 treesize of output 114 [2023-02-15 13:17:22,245 INFO L350 Elim1Store]: Elim1 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 73 treesize of output 65 [2023-02-15 13:17:22,499 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:22,500 INFO L350 Elim1Store]: Elim1 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 184 treesize of output 175 [2023-02-15 13:17:22,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:22,537 INFO L350 Elim1Store]: Elim1 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 164 treesize of output 115 [2023-02-15 13:17:22,565 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:17:22,574 INFO L350 Elim1Store]: Elim1 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 376 treesize of output 372 [2023-02-15 13:17:22,584 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:17:22,593 INFO L350 Elim1Store]: Elim1 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 320 treesize of output 310 [2023-02-15 13:17:22,611 INFO L350 Elim1Store]: Elim1 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 388 treesize of output 368 [2023-02-15 13:17:22,630 INFO L350 Elim1Store]: Elim1 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 442 treesize of output 426 [2023-02-15 13:17:22,649 INFO L350 Elim1Store]: Elim1 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 426 treesize of output 394 [2023-02-15 13:17:22,684 INFO L350 Elim1Store]: Elim1 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 264 treesize of output 244 [2023-02-15 13:17:22,721 INFO L350 Elim1Store]: Elim1 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 254 treesize of output 238 [2023-02-15 13:17:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:27,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846458797] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:17:27,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:17:27,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 45 [2023-02-15 13:17:27,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929037485] [2023-02-15 13:17:27,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:17:27,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 13:17:27,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:27,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 13:17:27,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1383, Unknown=16, NotChecked=486, Total=2070 [2023-02-15 13:17:27,466 INFO L87 Difference]: Start difference. First operand 304 states and 353 transitions. Second operand has 46 states, 45 states have (on average 2.7555555555555555) internal successors, (124), 46 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) [2023-02-15 13:17:35,559 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) (.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse8 (select |c_#length| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse7 (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse10 (select .cse4 .cse2))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1741))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1740) .cse1 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (<= 16 (select |c_#length| .cse5)) (forall ((v_ArrVal_1747 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1740) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1741) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |c_#valid| .cse5) 1) (= (select .cse0 .cse6) |c_ULTIMATE.start_main_~x~0#1.offset|) (= (select .cse0 .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse7 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (<= .cse8 16) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse9 |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (<= 16 (select |c_#length| (select .cse4 .cse6))) (not (<= (+ |c_ULTIMATE.start_main_~head~0#1.offset| 1) |c_ULTIMATE.start_main_~x~0#1.offset|)) (= (select .cse9 .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|) (<= 16 .cse8) (<= 16 (select |c_#length| .cse10)) (= |c_ULTIMATE.start_main_#t~malloc7#1.offset| .cse7) (= (select |c_#valid| .cse10) 1)))) is different from false [2023-02-15 13:17:40,276 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse13 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) (.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (let ((.cse7 (select |c_#length| .cse5)) (.cse9 (select .cse11 .cse2)) (.cse10 (select |c_#length| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse6 (select .cse4 .cse13)) (.cse8 (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse12 (select .cse4 .cse2))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1741))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1740) .cse1 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (not (= .cse5 |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= .cse6 |c_ULTIMATE.start_main_~x~0#1.base|)) (<= 16 .cse7) (forall ((v_ArrVal_1747 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1740) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1741) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |c_#valid| .cse5) 1) (not (= .cse5 |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= (select .cse0 .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse8 0) (= 16 .cse7) (= (select |c_#length| .cse6) 16) (= |c_ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= .cse9 0) (<= .cse10 16) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#length| |c_ULTIMATE.start_main_#t~malloc7#1.base|) 16) (= (select .cse11 |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (not (<= (+ |c_ULTIMATE.start_main_~head~0#1.offset| 1) |c_ULTIMATE.start_main_~x~0#1.offset|)) (= .cse9 |c_ULTIMATE.start_main_~head~0#1.offset|) (<= 16 .cse10) (exists ((v_arrayElimCell_108 Int)) (and (not (= .cse6 v_arrayElimCell_108)) (= 16 (select |c_#length| v_arrayElimCell_108)) (not (= v_arrayElimCell_108 |c_ULTIMATE.start_main_~x~0#1.base|)))) (<= 16 (select |c_#length| .cse12)) (= (select .cse0 .cse13) 0) (= |c_ULTIMATE.start_main_#t~malloc7#1.offset| .cse8) (= (select |c_#valid| .cse12) 1))))) is different from false [2023-02-15 13:18:13,338 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1))) is different from false