./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0504.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae 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/memsafety/test-0504.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 cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:14:46,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:14:46,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:14:46,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:14:46,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:14:46,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:14:46,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:14:46,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:14:46,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:14:46,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:14:46,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:14:46,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:14:46,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:14:46,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:14:46,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:14:46,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:14:46,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:14:46,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:14:46,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:14:46,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:14:46,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:14:46,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:14:46,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:14:46,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:14:46,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:14:46,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:14:46,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:14:46,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:14:46,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:14:46,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:14:46,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:14:46,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:14:46,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:14:46,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:14:46,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:14:46,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:14:46,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:14:46,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:14:46,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:14:46,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:14:46,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:14:46,746 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:14:46,768 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:14:46,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:14:46,769 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:14:46,769 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:14:46,770 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:14:46,770 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:14:46,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:14:46,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:14:46,771 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:14:46,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:14:46,771 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:14:46,772 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:14:46,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:14:46,772 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:14:46,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:14:46,772 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:14:46,772 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:14:46,772 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:14:46,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:14:46,773 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:14:46,773 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:14:46,773 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:14:46,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:14:46,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:14:46,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:14:46,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:14:46,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:14:46,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:14:46,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:14:46,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:14:46,774 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:14:46,775 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:14:46,775 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:14:46,775 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:14:46,775 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 -> cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 [2023-02-16 03:14:46,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:14:46,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:14:46,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:14:46,967 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:14:46,967 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:14:46,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0504.i [2023-02-16 03:14:48,053 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:14:48,253 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:14:48,254 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0504.i [2023-02-16 03:14:48,265 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b75a32f/dd64a07f29f648f0905496f13c49f7e1/FLAG9e43dba07 [2023-02-16 03:14:48,278 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b75a32f/dd64a07f29f648f0905496f13c49f7e1 [2023-02-16 03:14:48,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:14:48,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:14:48,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:14:48,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:14:48,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:14:48,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:14:48" (1/1) ... [2023-02-16 03:14:48,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a4a956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:48, skipping insertion in model container [2023-02-16 03:14:48,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:14:48" (1/1) ... [2023-02-16 03:14:48,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:14:48,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:14:48,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:14:48,549 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:14:48,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:14:48,600 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:14:48,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:48 WrapperNode [2023-02-16 03:14:48,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:14:48,601 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:14:48,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:14:48,601 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:14:48,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:48" (1/1) ... [2023-02-16 03:14:48,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:48" (1/1) ... [2023-02-16 03:14:48,633 INFO L138 Inliner]: procedures = 123, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2023-02-16 03:14:48,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:14:48,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:14:48,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:14:48,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:14:48,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:48" (1/1) ... [2023-02-16 03:14:48,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:48" (1/1) ... [2023-02-16 03:14:48,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:48" (1/1) ... [2023-02-16 03:14:48,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:48" (1/1) ... [2023-02-16 03:14:48,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:48" (1/1) ... [2023-02-16 03:14:48,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:48" (1/1) ... [2023-02-16 03:14:48,661 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:48" (1/1) ... [2023-02-16 03:14:48,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:48" (1/1) ... [2023-02-16 03:14:48,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:14:48,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:14:48,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:14:48,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:14:48,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:48" (1/1) ... [2023-02-16 03:14:48,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:14:48,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:14:48,700 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-16 03:14:48,733 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-16 03:14:48,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 03:14:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:14:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:14:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:14:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:14:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:14:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:14:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:14:48,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:14:48,825 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:14:48,826 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:14:49,041 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:14:49,046 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:14:49,046 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-16 03:14:49,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:14:49 BoogieIcfgContainer [2023-02-16 03:14:49,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:14:49,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:14:49,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:14:49,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:14:49,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:14:48" (1/3) ... [2023-02-16 03:14:49,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7429ca88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:14:49, skipping insertion in model container [2023-02-16 03:14:49,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:48" (2/3) ... [2023-02-16 03:14:49,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7429ca88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:14:49, skipping insertion in model container [2023-02-16 03:14:49,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:14:49" (3/3) ... [2023-02-16 03:14:49,053 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0504.i [2023-02-16 03:14:49,065 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:14:49,065 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-02-16 03:14:49,104 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:14:49,115 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;@4665d8fa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:14:49,115 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-02-16 03:14:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 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-16 03:14:49,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-16 03:14:49,121 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:49,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-16 03:14:49,122 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:49,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:49,125 INFO L85 PathProgramCache]: Analyzing trace with hash 28780379, now seen corresponding path program 1 times [2023-02-16 03:14:49,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:49,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326234388] [2023-02-16 03:14:49,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:49,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:49,206 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-16 03:14:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:49,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326234388] [2023-02-16 03:14:49,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326234388] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:49,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:49,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:14:49,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277081121] [2023-02-16 03:14:49,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:49,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 03:14:49,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:49,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 03:14:49,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 03:14:49,245 INFO L87 Difference]: Start difference. First operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-16 03:14:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:49,262 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2023-02-16 03:14:49,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 03:14:49,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-02-16 03:14:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:49,270 INFO L225 Difference]: With dead ends: 87 [2023-02-16 03:14:49,270 INFO L226 Difference]: Without dead ends: 85 [2023-02-16 03:14:49,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 03:14:49,275 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:49,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:14:49,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-16 03:14:49,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-16 03:14:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 44 states have (on average 2.022727272727273) internal successors, (89), 84 states have internal predecessors, (89), 0 states have call successors, (0), 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-16 03:14:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2023-02-16 03:14:49,303 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 5 [2023-02-16 03:14:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:49,304 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2023-02-16 03:14:49,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-16 03:14:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2023-02-16 03:14:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:14:49,304 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:49,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:14:49,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:14:49,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:49,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:49,306 INFO L85 PathProgramCache]: Analyzing trace with hash 889572104, now seen corresponding path program 1 times [2023-02-16 03:14:49,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:49,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401595473] [2023-02-16 03:14:49,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:49,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:49,362 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-16 03:14:49,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:49,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401595473] [2023-02-16 03:14:49,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401595473] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:49,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:49,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:14:49,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566220926] [2023-02-16 03:14:49,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:49,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:14:49,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:49,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:14:49,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:14:49,365 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-16 03:14:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:49,385 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2023-02-16 03:14:49,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:14:49,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-02-16 03:14:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:49,386 INFO L225 Difference]: With dead ends: 133 [2023-02-16 03:14:49,386 INFO L226 Difference]: Without dead ends: 133 [2023-02-16 03:14:49,386 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-16 03:14:49,387 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 49 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:49,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:14:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-16 03:14:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2023-02-16 03:14:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 108 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 139 transitions. [2023-02-16 03:14:49,395 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 139 transitions. Word has length 6 [2023-02-16 03:14:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:49,395 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 139 transitions. [2023-02-16 03:14:49,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-16 03:14:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 139 transitions. [2023-02-16 03:14:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:14:49,396 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:49,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:14:49,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:14:49,397 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:49,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:49,399 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2023-02-16 03:14:49,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:49,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031750796] [2023-02-16 03:14:49,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:49,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:49,456 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-16 03:14:49,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:49,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031750796] [2023-02-16 03:14:49,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031750796] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:49,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:49,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:14:49,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746612266] [2023-02-16 03:14:49,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:49,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:14:49,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:49,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:14:49,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:14:49,459 INFO L87 Difference]: Start difference. First operand 109 states and 139 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-16 03:14:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:49,524 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2023-02-16 03:14:49,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:14:49,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-02-16 03:14:49,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:49,525 INFO L225 Difference]: With dead ends: 130 [2023-02-16 03:14:49,525 INFO L226 Difference]: Without dead ends: 130 [2023-02-16 03:14:49,526 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-16 03:14:49,527 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 74 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:49,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-16 03:14:49,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2023-02-16 03:14:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.8235294117647058) internal successors, (124), 100 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-16 03:14:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2023-02-16 03:14:49,533 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 6 [2023-02-16 03:14:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:49,534 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2023-02-16 03:14:49,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-16 03:14:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2023-02-16 03:14:49,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:14:49,534 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:49,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:14:49,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:14:49,535 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:49,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:49,535 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2023-02-16 03:14:49,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:49,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612480794] [2023-02-16 03:14:49,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:49,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:49,596 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-16 03:14:49,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:49,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612480794] [2023-02-16 03:14:49,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612480794] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:49,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:49,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:14:49,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165639664] [2023-02-16 03:14:49,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:49,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:14:49,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:49,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:14:49,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:14:49,599 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-16 03:14:49,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:49,691 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2023-02-16 03:14:49,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:14:49,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-02-16 03:14:49,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:49,693 INFO L225 Difference]: With dead ends: 138 [2023-02-16 03:14:49,693 INFO L226 Difference]: Without dead ends: 138 [2023-02-16 03:14:49,694 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-16 03:14:49,694 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 47 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:49,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 102 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:49,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-02-16 03:14:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2023-02-16 03:14:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 100 states have internal predecessors, (123), 0 states have call successors, (0), 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-16 03:14:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2023-02-16 03:14:49,701 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 6 [2023-02-16 03:14:49,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:49,701 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2023-02-16 03:14:49,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-16 03:14:49,702 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2023-02-16 03:14:49,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-16 03:14:49,702 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:49,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:49,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:14:49,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:49,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:49,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1806930847, now seen corresponding path program 1 times [2023-02-16 03:14:49,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:49,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064743989] [2023-02-16 03:14:49,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:49,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:49,729 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-16 03:14:49,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:49,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064743989] [2023-02-16 03:14:49,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064743989] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:49,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:49,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:14:49,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155764195] [2023-02-16 03:14:49,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:49,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:14:49,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:49,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:14:49,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:14:49,732 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:49,771 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2023-02-16 03:14:49,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:14:49,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-16 03:14:49,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:49,774 INFO L225 Difference]: With dead ends: 103 [2023-02-16 03:14:49,775 INFO L226 Difference]: Without dead ends: 100 [2023-02-16 03:14:49,775 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-16 03:14:49,785 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:49,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:14:49,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-16 03:14:49,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-02-16 03:14:49,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 99 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2023-02-16 03:14:49,796 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 7 [2023-02-16 03:14:49,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:49,796 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2023-02-16 03:14:49,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2023-02-16 03:14:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 03:14:49,797 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:49,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:49,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:14:49,797 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:49,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:49,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1857997403, now seen corresponding path program 1 times [2023-02-16 03:14:49,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:49,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394020433] [2023-02-16 03:14:49,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:49,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:50,020 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-16 03:14:50,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:50,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394020433] [2023-02-16 03:14:50,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394020433] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:50,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:50,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:14:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298885890] [2023-02-16 03:14:50,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:50,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:14:50,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:50,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:14:50,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:14:50,024 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:50,131 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2023-02-16 03:14:50,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:14:50,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-16 03:14:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:50,133 INFO L225 Difference]: With dead ends: 126 [2023-02-16 03:14:50,133 INFO L226 Difference]: Without dead ends: 126 [2023-02-16 03:14:50,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:14:50,135 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 144 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:50,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 68 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:50,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-16 03:14:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2023-02-16 03:14:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 91 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 03:14:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2023-02-16 03:14:50,156 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 15 [2023-02-16 03:14:50,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:50,156 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2023-02-16 03:14:50,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:50,157 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2023-02-16 03:14:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:14:50,157 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:50,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:50,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 03:14:50,158 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:50,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:50,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344638, now seen corresponding path program 1 times [2023-02-16 03:14:50,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:50,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062504561] [2023-02-16 03:14:50,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:50,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:50,240 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-16 03:14:50,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:50,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062504561] [2023-02-16 03:14:50,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062504561] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:50,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:50,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:14:50,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813088614] [2023-02-16 03:14:50,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:50,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:14:50,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:50,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:14:50,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:14:50,243 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-16 03:14:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:50,280 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2023-02-16 03:14:50,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:14:50,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-16 03:14:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:50,281 INFO L225 Difference]: With dead ends: 88 [2023-02-16 03:14:50,281 INFO L226 Difference]: Without dead ends: 88 [2023-02-16 03:14:50,282 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-16 03:14:50,283 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:50,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:14:50,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-16 03:14:50,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-16 03:14:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 87 states have internal predecessors, (99), 0 states have call successors, (0), 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-16 03:14:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2023-02-16 03:14:50,299 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 16 [2023-02-16 03:14:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:50,299 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2023-02-16 03:14:50,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-16 03:14:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2023-02-16 03:14:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:14:50,301 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:50,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:50,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 03:14:50,301 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:50,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:50,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344639, now seen corresponding path program 1 times [2023-02-16 03:14:50,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:50,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146918340] [2023-02-16 03:14:50,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:50,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:50,406 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-16 03:14:50,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:50,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146918340] [2023-02-16 03:14:50,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146918340] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:50,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:50,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:14:50,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057007035] [2023-02-16 03:14:50,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:50,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:14:50,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:50,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:14:50,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:14:50,409 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-16 03:14:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:50,437 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2023-02-16 03:14:50,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:14:50,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-16 03:14:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:50,438 INFO L225 Difference]: With dead ends: 84 [2023-02-16 03:14:50,438 INFO L226 Difference]: Without dead ends: 84 [2023-02-16 03:14:50,439 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-16 03:14:50,440 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:50,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:14:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-16 03:14:50,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-16 03:14:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 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-16 03:14:50,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2023-02-16 03:14:50,446 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2023-02-16 03:14:50,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:50,446 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2023-02-16 03:14:50,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-16 03:14:50,446 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2023-02-16 03:14:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 03:14:50,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:50,458 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:50,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 03:14:50,459 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:50,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:50,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864768, now seen corresponding path program 1 times [2023-02-16 03:14:50,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:50,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046406820] [2023-02-16 03:14:50,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:50,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:50,498 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-16 03:14:50,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:50,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046406820] [2023-02-16 03:14:50,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046406820] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:50,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:50,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:14:50,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401965214] [2023-02-16 03:14:50,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:50,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:14:50,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:50,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:14:50,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:14:50,501 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 4 states, 3 states have (on average 6.0) 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-16 03:14:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:50,573 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2023-02-16 03:14:50,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:14:50,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) 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-16 03:14:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:50,574 INFO L225 Difference]: With dead ends: 114 [2023-02-16 03:14:50,574 INFO L226 Difference]: Without dead ends: 114 [2023-02-16 03:14:50,574 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-16 03:14:50,575 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 83 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:50,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 84 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-16 03:14:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 86. [2023-02-16 03:14:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 85 states have internal predecessors, (95), 0 states have call successors, (0), 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-16 03:14:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2023-02-16 03:14:50,577 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2023-02-16 03:14:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:50,577 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2023-02-16 03:14:50,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) 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-16 03:14:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2023-02-16 03:14:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 03:14:50,578 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:50,578 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:50,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 03:14:50,579 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:50,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:50,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864767, now seen corresponding path program 1 times [2023-02-16 03:14:50,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:50,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483617698] [2023-02-16 03:14:50,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:50,660 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-16 03:14:50,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:50,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483617698] [2023-02-16 03:14:50,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483617698] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:50,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:50,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:14:50,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848855633] [2023-02-16 03:14:50,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:50,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:14:50,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:50,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:14:50,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:14:50,662 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 4 states, 3 states have (on average 6.0) 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-16 03:14:50,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:50,736 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2023-02-16 03:14:50,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:14:50,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) 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-16 03:14:50,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:50,736 INFO L225 Difference]: With dead ends: 153 [2023-02-16 03:14:50,737 INFO L226 Difference]: Without dead ends: 153 [2023-02-16 03:14:50,737 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-16 03:14:50,737 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 72 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:50,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 118 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-16 03:14:50,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 109. [2023-02-16 03:14:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 108 states have internal predecessors, (127), 0 states have call successors, (0), 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-16 03:14:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2023-02-16 03:14:50,739 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 18 [2023-02-16 03:14:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:50,739 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2023-02-16 03:14:50,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) 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-16 03:14:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2023-02-16 03:14:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 03:14:50,740 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:50,740 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:50,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 03:14:50,740 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:50,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash -874266265, now seen corresponding path program 1 times [2023-02-16 03:14:50,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:50,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887559894] [2023-02-16 03:14:50,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:50,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:50,811 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-16 03:14:50,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:50,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887559894] [2023-02-16 03:14:50,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887559894] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:50,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:50,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:14:50,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696385764] [2023-02-16 03:14:50,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:50,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:14:50,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:50,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:14:50,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:14:50,812 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:50,843 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2023-02-16 03:14:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:14:50,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-16 03:14:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:50,845 INFO L225 Difference]: With dead ends: 113 [2023-02-16 03:14:50,845 INFO L226 Difference]: Without dead ends: 113 [2023-02-16 03:14:50,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:14:50,846 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 89 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:50,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 108 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:14:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-16 03:14:50,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2023-02-16 03:14:50,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 105 states have internal predecessors, (118), 0 states have call successors, (0), 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-16 03:14:50,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2023-02-16 03:14:50,850 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 19 [2023-02-16 03:14:50,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:50,851 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2023-02-16 03:14:50,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2023-02-16 03:14:50,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 03:14:50,852 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:50,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:50,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-16 03:14:50,857 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:50,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash 55140128, now seen corresponding path program 1 times [2023-02-16 03:14:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:50,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323313659] [2023-02-16 03:14:50,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:50,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:51,062 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-16 03:14:51,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:51,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323313659] [2023-02-16 03:14:51,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323313659] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:51,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:51,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:14:51,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594801030] [2023-02-16 03:14:51,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:51,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:14:51,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:51,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:14:51,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:14:51,064 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:51,172 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2023-02-16 03:14:51,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:14:51,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-16 03:14:51,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:51,174 INFO L225 Difference]: With dead ends: 170 [2023-02-16 03:14:51,174 INFO L226 Difference]: Without dead ends: 170 [2023-02-16 03:14:51,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:14:51,175 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:51,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 183 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:51,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-02-16 03:14:51,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2023-02-16 03:14:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 119 states have internal predecessors, (135), 0 states have call successors, (0), 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-16 03:14:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2023-02-16 03:14:51,178 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 19 [2023-02-16 03:14:51,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:51,178 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2023-02-16 03:14:51,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2023-02-16 03:14:51,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 03:14:51,181 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:51,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:51,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 03:14:51,181 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:51,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:51,182 INFO L85 PathProgramCache]: Analyzing trace with hash 55140129, now seen corresponding path program 1 times [2023-02-16 03:14:51,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:51,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125938142] [2023-02-16 03:14:51,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:51,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:51,536 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-16 03:14:51,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:51,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125938142] [2023-02-16 03:14:51,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125938142] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:51,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:51,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 03:14:51,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348980317] [2023-02-16 03:14:51,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:51,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:14:51,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:51,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:14:51,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:14:51,538 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:51,786 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2023-02-16 03:14:51,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:14:51,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-16 03:14:51,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:51,787 INFO L225 Difference]: With dead ends: 184 [2023-02-16 03:14:51,787 INFO L226 Difference]: Without dead ends: 184 [2023-02-16 03:14:51,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2023-02-16 03:14:51,788 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 177 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:51,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 199 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:14:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-16 03:14:51,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 120. [2023-02-16 03:14:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 119 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2023-02-16 03:14:51,790 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 19 [2023-02-16 03:14:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:51,790 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2023-02-16 03:14:51,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:51,790 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2023-02-16 03:14:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 03:14:51,791 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:51,791 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:51,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-16 03:14:51,791 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:51,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:51,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429407, now seen corresponding path program 1 times [2023-02-16 03:14:51,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:51,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53872380] [2023-02-16 03:14:51,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:51,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:14:51,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:51,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53872380] [2023-02-16 03:14:51,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53872380] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:51,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:51,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:14:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255379387] [2023-02-16 03:14:51,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:51,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:14:51,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:51,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:14:51,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:14:51,825 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:51,885 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2023-02-16 03:14:51,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:14:51,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-16 03:14:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:51,886 INFO L225 Difference]: With dead ends: 135 [2023-02-16 03:14:51,886 INFO L226 Difference]: Without dead ends: 135 [2023-02-16 03:14:51,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 03:14:51,887 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:51,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-16 03:14:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2023-02-16 03:14:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 122 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2023-02-16 03:14:51,889 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 20 [2023-02-16 03:14:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:51,889 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2023-02-16 03:14:51,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2023-02-16 03:14:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 03:14:51,890 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:51,890 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:51,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-16 03:14:51,890 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:51,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:51,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429406, now seen corresponding path program 1 times [2023-02-16 03:14:51,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:51,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693881324] [2023-02-16 03:14:51,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:51,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:52,024 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-16 03:14:52,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:52,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693881324] [2023-02-16 03:14:52,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693881324] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:52,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:52,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:14:52,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836491622] [2023-02-16 03:14:52,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:52,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:14:52,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:52,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:14:52,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:14:52,026 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:52,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:52,172 INFO L93 Difference]: Finished difference Result 194 states and 217 transitions. [2023-02-16 03:14:52,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:14:52,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-16 03:14:52,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:52,174 INFO L225 Difference]: With dead ends: 194 [2023-02-16 03:14:52,174 INFO L226 Difference]: Without dead ends: 194 [2023-02-16 03:14:52,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:14:52,176 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 111 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:52,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 132 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-16 03:14:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 135. [2023-02-16 03:14:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 134 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2023-02-16 03:14:52,179 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 20 [2023-02-16 03:14:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:52,179 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2023-02-16 03:14:52,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2023-02-16 03:14:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:14:52,181 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:52,181 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] [2023-02-16 03:14:52,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-16 03:14:52,181 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:52,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:52,182 INFO L85 PathProgramCache]: Analyzing trace with hash -316635569, now seen corresponding path program 1 times [2023-02-16 03:14:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:52,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100164294] [2023-02-16 03:14:52,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:52,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:52,362 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-16 03:14:52,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:52,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100164294] [2023-02-16 03:14:52,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100164294] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:52,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:52,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:14:52,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277789759] [2023-02-16 03:14:52,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:52,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:14:52,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:52,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:14:52,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:14:52,365 INFO L87 Difference]: Start difference. First operand 135 states and 158 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-16 03:14:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:52,558 INFO L93 Difference]: Finished difference Result 195 states and 225 transitions. [2023-02-16 03:14:52,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:14:52,558 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-16 03:14:52,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:52,559 INFO L225 Difference]: With dead ends: 195 [2023-02-16 03:14:52,559 INFO L226 Difference]: Without dead ends: 195 [2023-02-16 03:14:52,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:14:52,560 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:52,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 236 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-02-16 03:14:52,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 143. [2023-02-16 03:14:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 127 states have (on average 1.31496062992126) internal successors, (167), 142 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2023-02-16 03:14:52,562 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 23 [2023-02-16 03:14:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:52,562 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2023-02-16 03:14:52,562 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-16 03:14:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2023-02-16 03:14:52,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 03:14:52,562 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:52,563 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] [2023-02-16 03:14:52,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-16 03:14:52,563 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:52,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:52,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1225769432, now seen corresponding path program 1 times [2023-02-16 03:14:52,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:52,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461977138] [2023-02-16 03:14:52,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:52,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:52,615 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-16 03:14:52,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:52,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461977138] [2023-02-16 03:14:52,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461977138] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:52,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:52,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:14:52,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599697735] [2023-02-16 03:14:52,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:52,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:14:52,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:52,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:14:52,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:14:52,618 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:52,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:52,712 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2023-02-16 03:14:52,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:14:52,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-16 03:14:52,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:52,714 INFO L225 Difference]: With dead ends: 167 [2023-02-16 03:14:52,714 INFO L226 Difference]: Without dead ends: 167 [2023-02-16 03:14:52,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:14:52,715 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 113 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:52,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 148 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-16 03:14:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2023-02-16 03:14:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 156 states have internal predecessors, (191), 0 states have call successors, (0), 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-16 03:14:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2023-02-16 03:14:52,718 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 24 [2023-02-16 03:14:52,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:52,718 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2023-02-16 03:14:52,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2023-02-16 03:14:52,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:14:52,719 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:52,719 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:52,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-16 03:14:52,719 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:52,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:52,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1085033438, now seen corresponding path program 1 times [2023-02-16 03:14:52,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:52,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955403244] [2023-02-16 03:14:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:52,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:53,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:53,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955403244] [2023-02-16 03:14:53,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955403244] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:14:53,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554901384] [2023-02-16 03:14:53,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:53,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:14:53,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:14:53,056 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-16 03:14:53,057 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-16 03:14:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:53,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-16 03:14:53,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:14:53,198 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-16 03:14:53,202 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-16 03:14:53,214 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-16 03:14:53,221 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-16 03:14:53,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:14:53,233 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-16 03:14:53,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:14:53,238 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-16 03:14:53,250 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-16 03:14:53,255 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-16 03:14:53,266 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-16 03:14:53,271 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-16 03:14:53,321 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-16 03:14:53,323 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-16 03:14:53,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:53,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:14:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:53,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554901384] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:14:53,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:14:53,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 9 [2023-02-16 03:14:53,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80648313] [2023-02-16 03:14:53,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:14:53,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:14:53,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:53,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:14:53,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:14:53,433 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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-16 03:14:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:53,608 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2023-02-16 03:14:53,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:14:53,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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 27 [2023-02-16 03:14:53,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:53,609 INFO L225 Difference]: With dead ends: 186 [2023-02-16 03:14:53,609 INFO L226 Difference]: Without dead ends: 186 [2023-02-16 03:14:53,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:14:53,610 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 187 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:53,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 266 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:53,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-16 03:14:53,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 161. [2023-02-16 03:14:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 145 states have (on average 1.3448275862068966) internal successors, (195), 160 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 195 transitions. [2023-02-16 03:14:53,612 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 195 transitions. Word has length 27 [2023-02-16 03:14:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:53,613 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 195 transitions. [2023-02-16 03:14:53,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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-16 03:14:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 195 transitions. [2023-02-16 03:14:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:14:53,614 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:53,614 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-16 03:14:53,626 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-16 03:14:53,819 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,SelfDestructingSolverStorable17 [2023-02-16 03:14:53,821 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:53,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:53,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846143, now seen corresponding path program 1 times [2023-02-16 03:14:53,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:53,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725435228] [2023-02-16 03:14:53,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:53,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:53,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:53,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725435228] [2023-02-16 03:14:53,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725435228] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:14:53,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041057065] [2023-02-16 03:14:53,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:53,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:14:53,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:14:53,906 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-16 03:14:53,908 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-16 03:14:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:53,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:14:54,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:14:54,003 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-16 03:14:54,029 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:14:54,029 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-16 03:14:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:54,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:14:54,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:54,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041057065] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:14:54,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:14:54,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2023-02-16 03:14:54,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105899716] [2023-02-16 03:14:54,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:14:54,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:14:54,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:54,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:14:54,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:14:54,152 INFO L87 Difference]: Start difference. First operand 161 states and 195 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:54,260 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2023-02-16 03:14:54,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:14:54,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-16 03:14:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:54,261 INFO L225 Difference]: With dead ends: 181 [2023-02-16 03:14:54,261 INFO L226 Difference]: Without dead ends: 181 [2023-02-16 03:14:54,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:14:54,261 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 156 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:54,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 141 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-16 03:14:54,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2023-02-16 03:14:54,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 159 states have internal predecessors, (193), 0 states have call successors, (0), 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-16 03:14:54,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2023-02-16 03:14:54,265 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 27 [2023-02-16 03:14:54,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:54,265 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2023-02-16 03:14:54,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2023-02-16 03:14:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:14:54,266 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:54,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-16 03:14:54,273 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-16 03:14:54,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:14:54,471 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:54,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:54,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846144, now seen corresponding path program 1 times [2023-02-16 03:14:54,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:54,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018457145] [2023-02-16 03:14:54,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:54,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:54,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:54,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018457145] [2023-02-16 03:14:54,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018457145] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:14:54,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636251823] [2023-02-16 03:14:54,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:54,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:14:54,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:14:54,602 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-16 03:14:54,603 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-16 03:14:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:54,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 03:14:54,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:14:54,699 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-16 03:14:54,701 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-16 03:14:54,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:14:54,786 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 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:14:54,791 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:14:54,791 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-16 03:14:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:54,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:14:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:55,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636251823] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:14:55,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:14:55,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2023-02-16 03:14:55,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701738249] [2023-02-16 03:14:55,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:14:55,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:14:55,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:55,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:14:55,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:14:55,103 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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-16 03:14:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:55,234 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2023-02-16 03:14:55,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:14:55,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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-16 03:14:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:55,235 INFO L225 Difference]: With dead ends: 180 [2023-02-16 03:14:55,235 INFO L226 Difference]: Without dead ends: 180 [2023-02-16 03:14:55,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:14:55,236 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 301 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:55,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 123 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:55,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-02-16 03:14:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 159. [2023-02-16 03:14:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.3172413793103448) internal successors, (191), 158 states have internal predecessors, (191), 0 states have call successors, (0), 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-16 03:14:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 191 transitions. [2023-02-16 03:14:55,243 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 191 transitions. Word has length 27 [2023-02-16 03:14:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:55,244 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 191 transitions. [2023-02-16 03:14:55,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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-16 03:14:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 191 transitions. [2023-02-16 03:14:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 03:14:55,244 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:55,244 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] [2023-02-16 03:14:55,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 03:14:55,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:14:55,450 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash 723701189, now seen corresponding path program 1 times [2023-02-16 03:14:55,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:55,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626070580] [2023-02-16 03:14:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:55,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:55,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626070580] [2023-02-16 03:14:55,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626070580] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:14:55,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979889959] [2023-02-16 03:14:55,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:55,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:14:55,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:14:55,543 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-16 03:14:55,546 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-16 03:14:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:55,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:14:55,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:14:55,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 15 treesize of output 14 [2023-02-16 03:14:55,702 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~1#1.base| Int)) (let ((.cse0 (select |c_#valid| |ULTIMATE.start_main_~x~1#1.base|))) (and (= 0 (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~x~1#1.base|)) (= .cse0 0) (= (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~x~1#1.base| .cse0) |c_#valid|)))) is different from true [2023-02-16 03:14:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-16 03:14:55,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:14:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:55,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979889959] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:14:55,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:14:55,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2023-02-16 03:14:55,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747970003] [2023-02-16 03:14:55,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:14:55,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:14:55,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:55,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:14:55,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-16 03:14:55,799 INFO L87 Difference]: Start difference. First operand 159 states and 191 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:55,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:55,948 INFO L93 Difference]: Finished difference Result 161 states and 192 transitions. [2023-02-16 03:14:55,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:14:55,948 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-16 03:14:55,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:55,949 INFO L225 Difference]: With dead ends: 161 [2023-02-16 03:14:55,949 INFO L226 Difference]: Without dead ends: 149 [2023-02-16 03:14:55,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=77, Unknown=1, NotChecked=18, Total=132 [2023-02-16 03:14:55,949 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:55,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 156 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 66 Unchecked, 0.1s Time] [2023-02-16 03:14:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-02-16 03:14:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2023-02-16 03:14:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 148 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-16 03:14:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 180 transitions. [2023-02-16 03:14:55,952 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 180 transitions. Word has length 28 [2023-02-16 03:14:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:55,952 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 180 transitions. [2023-02-16 03:14:55,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 180 transitions. [2023-02-16 03:14:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:14:55,952 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:55,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:55,963 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-16 03:14:56,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:14:56,158 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:56,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:56,158 INFO L85 PathProgramCache]: Analyzing trace with hash -28804244, now seen corresponding path program 1 times [2023-02-16 03:14:56,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:56,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169061587] [2023-02-16 03:14:56,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:56,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:56,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:56,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169061587] [2023-02-16 03:14:56,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169061587] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:14:56,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068421368] [2023-02-16 03:14:56,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:56,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:14:56,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:14:56,530 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-16 03:14:56,532 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-16 03:14:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:56,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-16 03:14:56,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:14:56,638 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-16 03:14:56,644 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-16 03:14:56,662 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-16 03:14:56,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:14:56,674 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-16 03:14:56,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:14:56,691 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-16 03:14:56,721 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:14:56,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:14:56,733 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:14:56,733 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-16 03:14:56,797 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 18 [2023-02-16 03:14:56,844 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 19 treesize of output 7 [2023-02-16 03:14:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:56,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:14:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:57,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068421368] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:14:57,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:14:57,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 4] total 17 [2023-02-16 03:14:57,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298049243] [2023-02-16 03:14:57,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:14:57,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 03:14:57,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:57,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 03:14:57,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:14:57,023 INFO L87 Difference]: Start difference. First operand 149 states and 180 transitions. Second operand has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 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-16 03:14:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:57,466 INFO L93 Difference]: Finished difference Result 269 states and 318 transitions. [2023-02-16 03:14:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 03:14:57,468 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 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-16 03:14:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:57,469 INFO L225 Difference]: With dead ends: 269 [2023-02-16 03:14:57,469 INFO L226 Difference]: Without dead ends: 269 [2023-02-16 03:14:57,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2023-02-16 03:14:57,470 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 309 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:57,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 449 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:14:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-16 03:14:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 166. [2023-02-16 03:14:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 152 states have (on average 1.3092105263157894) internal successors, (199), 165 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-16 03:14:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 199 transitions. [2023-02-16 03:14:57,473 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 199 transitions. Word has length 31 [2023-02-16 03:14:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:57,473 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 199 transitions. [2023-02-16 03:14:57,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 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-16 03:14:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 199 transitions. [2023-02-16 03:14:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 03:14:57,474 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:57,474 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:57,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-16 03:14:57,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-16 03:14:57,675 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:57,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:57,675 INFO L85 PathProgramCache]: Analyzing trace with hash 36474197, now seen corresponding path program 1 times [2023-02-16 03:14:57,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:57,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186804639] [2023-02-16 03:14:57,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:57,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:57,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:57,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:57,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186804639] [2023-02-16 03:14:57,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186804639] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:14:57,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157950499] [2023-02-16 03:14:57,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:57,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:14:57,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:14:57,889 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-16 03:14:57,892 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-16 03:14:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:58,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 03:14:58,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:14:58,009 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-16 03:14:58,020 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-16 03:14:58,034 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-16 03:14:58,034 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 21 treesize of output 29 [2023-02-16 03:14:58,069 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 03:14:58,070 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 33 treesize of output 24 [2023-02-16 03:14:58,091 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 25 treesize of output 13 [2023-02-16 03:14:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:58,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:14:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:58,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157950499] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:14:58,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:14:58,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-16 03:14:58,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197682104] [2023-02-16 03:14:58,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:14:58,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:14:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:58,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:14:58,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:14:58,186 INFO L87 Difference]: Start difference. First operand 166 states and 199 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:58,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:58,383 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2023-02-16 03:14:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:14:58,384 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-16 03:14:58,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:58,384 INFO L225 Difference]: With dead ends: 184 [2023-02-16 03:14:58,384 INFO L226 Difference]: Without dead ends: 184 [2023-02-16 03:14:58,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2023-02-16 03:14:58,385 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 79 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:58,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 270 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-16 03:14:58,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2023-02-16 03:14:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 152 states have (on average 1.2960526315789473) internal successors, (197), 164 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-16 03:14:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 197 transitions. [2023-02-16 03:14:58,387 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 197 transitions. Word has length 32 [2023-02-16 03:14:58,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:58,387 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 197 transitions. [2023-02-16 03:14:58,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 197 transitions. [2023-02-16 03:14:58,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 03:14:58,389 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:58,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:58,404 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-16 03:14:58,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:14:58,594 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:14:58,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:58,594 INFO L85 PathProgramCache]: Analyzing trace with hash 36474198, now seen corresponding path program 1 times [2023-02-16 03:14:58,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:58,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240227191] [2023-02-16 03:14:58,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:58,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:58,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:58,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240227191] [2023-02-16 03:14:58,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240227191] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:14:58,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787121070] [2023-02-16 03:14:58,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:58,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:14:58,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:14:58,901 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-16 03:14:58,951 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-16 03:14:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:59,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-16 03:14:59,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:14:59,072 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-16 03:14:59,075 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-16 03:14:59,118 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-16 03:14:59,124 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-16 03:14:59,151 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-16 03:14:59,152 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 15 treesize of output 15 [2023-02-16 03:14:59,157 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 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:14:59,212 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 03:14:59,213 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 23 treesize of output 18 [2023-02-16 03:14:59,225 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 03:14:59,225 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 33 treesize of output 24 [2023-02-16 03:14:59,268 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:14:59,268 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 26 treesize of output 10 [2023-02-16 03:14:59,273 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:14:59,273 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 36 treesize of output 16 [2023-02-16 03:14:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:14:59,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:15:05,484 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:15:11,600 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:15:11,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:11,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787121070] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:15:11,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:15:11,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2023-02-16 03:15:11,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617099422] [2023-02-16 03:15:11,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:15:11,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 03:15:11,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:11,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 03:15:11,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2023-02-16 03:15:11,687 INFO L87 Difference]: Start difference. First operand 165 states and 197 transitions. Second operand has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:12,423 INFO L93 Difference]: Finished difference Result 239 states and 283 transitions. [2023-02-16 03:15:12,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 03:15:12,424 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-16 03:15:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:12,424 INFO L225 Difference]: With dead ends: 239 [2023-02-16 03:15:12,424 INFO L226 Difference]: Without dead ends: 239 [2023-02-16 03:15:12,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2023-02-16 03:15:12,425 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 130 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:12,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 517 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:15:12,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-02-16 03:15:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 150. [2023-02-16 03:15:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 149 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-16 03:15:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2023-02-16 03:15:12,428 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 32 [2023-02-16 03:15:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:12,428 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2023-02-16 03:15:12,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2023-02-16 03:15:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:15:12,428 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:12,428 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:12,449 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-16 03:15:12,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:15:12,634 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:15:12,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:12,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1911073267, now seen corresponding path program 1 times [2023-02-16 03:15:12,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:12,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066490871] [2023-02-16 03:15:12,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:12,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:13,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:13,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066490871] [2023-02-16 03:15:13,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066490871] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:15:13,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824182179] [2023-02-16 03:15:13,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:13,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:15:13,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:15:13,022 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-16 03:15:13,034 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-16 03:15:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:13,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:15:13,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:15:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:15:13,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:15:13,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824182179] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:15:13,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:15:13,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2023-02-16 03:15:13,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061587817] [2023-02-16 03:15:13,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:15:13,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:15:13,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:13,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:15:13,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:15:13,232 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:13,339 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2023-02-16 03:15:13,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:15:13,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-16 03:15:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:13,340 INFO L225 Difference]: With dead ends: 164 [2023-02-16 03:15:13,340 INFO L226 Difference]: Without dead ends: 164 [2023-02-16 03:15:13,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2023-02-16 03:15:13,340 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 118 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:13,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 95 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:15:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-16 03:15:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2023-02-16 03:15:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 138 states have (on average 1.2971014492753623) internal successors, (179), 149 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-16 03:15:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 179 transitions. [2023-02-16 03:15:13,343 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 179 transitions. Word has length 33 [2023-02-16 03:15:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:13,343 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 179 transitions. [2023-02-16 03:15:13,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 179 transitions. [2023-02-16 03:15:13,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 03:15:13,343 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:13,343 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:13,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-16 03:15:13,543 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,SelfDestructingSolverStorable24 [2023-02-16 03:15:13,544 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:15:13,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:13,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827474, now seen corresponding path program 1 times [2023-02-16 03:15:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:13,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268972132] [2023-02-16 03:15:13,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:13,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:15:13,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:13,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268972132] [2023-02-16 03:15:13,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268972132] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:15:13,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:15:13,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:15:13,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647989176] [2023-02-16 03:15:13,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:15:13,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:15:13,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:13,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:15:13,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:15:13,589 INFO L87 Difference]: Start difference. First operand 150 states and 179 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:13,637 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2023-02-16 03:15:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:15:13,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-16 03:15:13,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:13,638 INFO L225 Difference]: With dead ends: 156 [2023-02-16 03:15:13,638 INFO L226 Difference]: Without dead ends: 156 [2023-02-16 03:15:13,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:15:13,639 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 105 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:13,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 97 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:15:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-16 03:15:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 121. [2023-02-16 03:15:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.275229357798165) internal successors, (139), 120 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2023-02-16 03:15:13,641 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 36 [2023-02-16 03:15:13,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:13,641 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2023-02-16 03:15:13,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2023-02-16 03:15:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 03:15:13,642 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:13,642 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:13,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-16 03:15:13,642 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:15:13,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:13,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827524, now seen corresponding path program 1 times [2023-02-16 03:15:13,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:13,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904566795] [2023-02-16 03:15:13,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:13,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:13,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:13,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904566795] [2023-02-16 03:15:13,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904566795] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:15:13,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:15:13,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:15:13,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431852577] [2023-02-16 03:15:13,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:15:13,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:15:13,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:13,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:15:13,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:15:13,759 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 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-16 03:15:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:13,920 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2023-02-16 03:15:13,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 03:15:13,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 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-16 03:15:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:13,921 INFO L225 Difference]: With dead ends: 155 [2023-02-16 03:15:13,921 INFO L226 Difference]: Without dead ends: 155 [2023-02-16 03:15:13,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:15:13,921 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 71 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:13,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 171 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:15:13,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-16 03:15:13,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 130. [2023-02-16 03:15:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 118 states have (on average 1.2796610169491525) internal successors, (151), 129 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 151 transitions. [2023-02-16 03:15:13,923 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 151 transitions. Word has length 36 [2023-02-16 03:15:13,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:13,923 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 151 transitions. [2023-02-16 03:15:13,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 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-16 03:15:13,924 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 151 transitions. [2023-02-16 03:15:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 03:15:13,924 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:13,924 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:13,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-16 03:15:13,924 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:15:13,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:13,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827525, now seen corresponding path program 1 times [2023-02-16 03:15:13,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:13,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042537326] [2023-02-16 03:15:13,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:13,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:14,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:14,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042537326] [2023-02-16 03:15:14,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042537326] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:15:14,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:15:14,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:15:14,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766742729] [2023-02-16 03:15:14,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:15:14,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:15:14,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:14,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:15:14,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:15:14,099 INFO L87 Difference]: Start difference. First operand 130 states and 151 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 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-16 03:15:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:14,324 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2023-02-16 03:15:14,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:15:14,324 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 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-16 03:15:14,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:14,325 INFO L225 Difference]: With dead ends: 206 [2023-02-16 03:15:14,325 INFO L226 Difference]: Without dead ends: 206 [2023-02-16 03:15:14,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:15:14,326 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 127 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:14,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 249 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:15:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-02-16 03:15:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 130. [2023-02-16 03:15:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 118 states have (on average 1.271186440677966) internal successors, (150), 129 states have internal predecessors, (150), 0 states have call successors, (0), 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-16 03:15:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2023-02-16 03:15:14,328 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 36 [2023-02-16 03:15:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:14,328 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2023-02-16 03:15:14,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 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-16 03:15:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2023-02-16 03:15:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:15:14,328 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:14,328 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:14,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-16 03:15:14,328 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:15:14,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:14,328 INFO L85 PathProgramCache]: Analyzing trace with hash 904979977, now seen corresponding path program 1 times [2023-02-16 03:15:14,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:14,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016598540] [2023-02-16 03:15:14,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:14,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:14,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:14,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016598540] [2023-02-16 03:15:14,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016598540] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:15:14,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229201818] [2023-02-16 03:15:14,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:14,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:15:14,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:15:14,857 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-16 03:15:14,860 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-16 03:15:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:14,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-16 03:15:14,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:15:15,002 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-16 03:15:15,013 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-16 03:15:15,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:15:15,030 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-16 03:15:15,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:15:15,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:15:15,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-16 03:15:15,119 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:15:15,120 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-16 03:15:15,160 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-16 03:15:15,180 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-16 03:15:15,208 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-16 03:15:15,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 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-16 03:15:15,243 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-16 03:15:15,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:15:15,331 INFO L321 Elim1Store]: treesize reduction 30, result has 49.2 percent of original size [2023-02-16 03:15:15,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 44 [2023-02-16 03:15:15,406 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 60 treesize of output 52 [2023-02-16 03:15:15,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:15:15,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 90 treesize of output 66 [2023-02-16 03:15:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:15,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:15:15,744 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|)))) is different from false [2023-02-16 03:15:20,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:15:20,085 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 47 treesize of output 40 [2023-02-16 03:15:20,089 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 90 treesize of output 86 [2023-02-16 03:15:20,093 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 55 treesize of output 51 [2023-02-16 03:15:20,096 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 47 treesize of output 45 [2023-02-16 03:15:20,098 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 92 treesize of output 88 [2023-02-16 03:15:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:22,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229201818] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:15:22,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:15:22,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2023-02-16 03:15:22,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466726041] [2023-02-16 03:15:22,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:15:22,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 03:15:22,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:22,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 03:15:22,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=770, Unknown=2, NotChecked=56, Total=930 [2023-02-16 03:15:22,160 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand has 31 states, 31 states have (on average 3.4516129032258065) internal successors, (107), 31 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 03:15:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:25,025 INFO L93 Difference]: Finished difference Result 242 states and 269 transitions. [2023-02-16 03:15:25,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-16 03:15:25,026 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4516129032258065) internal successors, (107), 31 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 03:15:25,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:25,026 INFO L225 Difference]: With dead ends: 242 [2023-02-16 03:15:25,026 INFO L226 Difference]: Without dead ends: 242 [2023-02-16 03:15:25,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=610, Invalid=3298, Unknown=2, NotChecked=122, Total=4032 [2023-02-16 03:15:25,028 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 332 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 58 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:25,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 639 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1084 Invalid, 4 Unknown, 110 Unchecked, 0.7s Time] [2023-02-16 03:15:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-02-16 03:15:25,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 173. [2023-02-16 03:15:25,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 161 states have (on average 1.236024844720497) internal successors, (199), 172 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-16 03:15:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 199 transitions. [2023-02-16 03:15:25,031 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 199 transitions. Word has length 38 [2023-02-16 03:15:25,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:25,031 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 199 transitions. [2023-02-16 03:15:25,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4516129032258065) internal successors, (107), 31 states have internal predecessors, (107), 0 states have call successors, (0), 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-16 03:15:25,031 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 199 transitions. [2023-02-16 03:15:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:15:25,032 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:25,032 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:25,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-16 03:15:25,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-16 03:15:25,237 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:15:25,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:25,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2113196924, now seen corresponding path program 1 times [2023-02-16 03:15:25,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:25,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143638894] [2023-02-16 03:15:25,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:25,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:25,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:25,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143638894] [2023-02-16 03:15:25,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143638894] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:15:25,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:15:25,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 03:15:25,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667811247] [2023-02-16 03:15:25,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:15:25,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:15:25,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:25,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:15:25,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:15:25,399 INFO L87 Difference]: Start difference. First operand 173 states and 199 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 03:15:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:25,670 INFO L93 Difference]: Finished difference Result 288 states and 322 transitions. [2023-02-16 03:15:25,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 03:15:25,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 03:15:25,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:25,671 INFO L225 Difference]: With dead ends: 288 [2023-02-16 03:15:25,671 INFO L226 Difference]: Without dead ends: 288 [2023-02-16 03:15:25,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2023-02-16 03:15:25,672 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 289 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:25,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 417 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:15:25,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-02-16 03:15:25,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 175. [2023-02-16 03:15:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 163 states have (on average 1.2331288343558282) internal successors, (201), 174 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2023-02-16 03:15:25,675 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 38 [2023-02-16 03:15:25,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:25,675 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2023-02-16 03:15:25,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 03:15:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2023-02-16 03:15:25,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 03:15:25,676 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:25,676 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:25,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-02-16 03:15:25,676 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:15:25,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:25,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1084595048, now seen corresponding path program 1 times [2023-02-16 03:15:25,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:25,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416850591] [2023-02-16 03:15:25,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:25,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:25,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:25,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416850591] [2023-02-16 03:15:25,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416850591] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:15:25,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:15:25,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 03:15:25,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154424450] [2023-02-16 03:15:25,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:15:25,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:15:25,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:25,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:15:25,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:15:25,794 INFO L87 Difference]: Start difference. First operand 175 states and 201 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:26,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:26,115 INFO L93 Difference]: Finished difference Result 287 states and 321 transitions. [2023-02-16 03:15:26,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 03:15:26,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-16 03:15:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:26,116 INFO L225 Difference]: With dead ends: 287 [2023-02-16 03:15:26,116 INFO L226 Difference]: Without dead ends: 287 [2023-02-16 03:15:26,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-02-16 03:15:26,117 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 194 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:26,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 347 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:15:26,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-02-16 03:15:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 176. [2023-02-16 03:15:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 164 states have (on average 1.2317073170731707) internal successors, (202), 175 states have internal predecessors, (202), 0 states have call successors, (0), 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-16 03:15:26,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 202 transitions. [2023-02-16 03:15:26,120 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 202 transitions. Word has length 39 [2023-02-16 03:15:26,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:26,120 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 202 transitions. [2023-02-16 03:15:26,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 202 transitions. [2023-02-16 03:15:26,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 03:15:26,121 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:26,121 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:26,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-16 03:15:26,121 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:15:26,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:26,121 INFO L85 PathProgramCache]: Analyzing trace with hash 693362007, now seen corresponding path program 1 times [2023-02-16 03:15:26,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:26,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84618704] [2023-02-16 03:15:26,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:26,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:26,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:26,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84618704] [2023-02-16 03:15:26,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84618704] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:15:26,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745217311] [2023-02-16 03:15:26,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:26,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:15:26,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:15:26,270 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:15:26,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-16 03:15:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:26,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-16 03:15:26,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:15:26,444 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-16 03:15:26,478 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:15:26,478 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-16 03:15:26,513 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 11 treesize of output 7 [2023-02-16 03:15:26,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:15:26,560 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 16 treesize of output 16 [2023-02-16 03:15:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:26,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:15:26,716 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 11 treesize of output 9 [2023-02-16 03:15:26,718 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 20 treesize of output 18 [2023-02-16 03:15:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:26,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745217311] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:15:26,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:15:26,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2023-02-16 03:15:26,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086151641] [2023-02-16 03:15:26,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:15:26,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-16 03:15:26,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:26,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-16 03:15:26,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2023-02-16 03:15:26,792 INFO L87 Difference]: Start difference. First operand 176 states and 202 transitions. Second operand has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 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-16 03:15:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:27,304 INFO L93 Difference]: Finished difference Result 269 states and 299 transitions. [2023-02-16 03:15:27,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 03:15:27,304 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 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-16 03:15:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:27,305 INFO L225 Difference]: With dead ends: 269 [2023-02-16 03:15:27,305 INFO L226 Difference]: Without dead ends: 269 [2023-02-16 03:15:27,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2023-02-16 03:15:27,306 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 311 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:27,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 618 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:15:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-16 03:15:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 176. [2023-02-16 03:15:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 164 states have (on average 1.225609756097561) internal successors, (201), 175 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:27,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 201 transitions. [2023-02-16 03:15:27,308 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 201 transitions. Word has length 40 [2023-02-16 03:15:27,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:27,308 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 201 transitions. [2023-02-16 03:15:27,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 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-16 03:15:27,309 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 201 transitions. [2023-02-16 03:15:27,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 03:15:27,309 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:27,309 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:27,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-16 03:15:27,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-02-16 03:15:27,509 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:15:27,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash 737292038, now seen corresponding path program 1 times [2023-02-16 03:15:27,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:27,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070355782] [2023-02-16 03:15:27,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:27,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:15:27,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:27,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070355782] [2023-02-16 03:15:27,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070355782] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:15:27,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:15:27,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:15:27,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256133602] [2023-02-16 03:15:27,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:15:27,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:15:27,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:27,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:15:27,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:15:27,556 INFO L87 Difference]: Start difference. First operand 176 states and 201 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 03:15:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:27,601 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2023-02-16 03:15:27,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:15:27,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 03:15:27,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:27,602 INFO L225 Difference]: With dead ends: 175 [2023-02-16 03:15:27,602 INFO L226 Difference]: Without dead ends: 175 [2023-02-16 03:15:27,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 03:15:27,604 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:27,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 103 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:15:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-16 03:15:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-02-16 03:15:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 164 states have (on average 1.2134146341463414) internal successors, (199), 174 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-16 03:15:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 199 transitions. [2023-02-16 03:15:27,607 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 199 transitions. Word has length 40 [2023-02-16 03:15:27,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:27,607 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 199 transitions. [2023-02-16 03:15:27,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 03:15:27,607 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 199 transitions. [2023-02-16 03:15:27,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:15:27,608 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:27,608 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:27,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-02-16 03:15:27,608 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:15:27,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:27,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179932, now seen corresponding path program 1 times [2023-02-16 03:15:27,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:27,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197105575] [2023-02-16 03:15:27,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:27,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:27,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:27,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197105575] [2023-02-16 03:15:27,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197105575] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:15:27,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835648758] [2023-02-16 03:15:27,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:27,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:15:27,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:15:27,939 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:15:27,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-16 03:15:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:28,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 75 conjunts are in the unsatisfiable core [2023-02-16 03:15:28,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:15:28,107 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-16 03:15:28,115 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-16 03:15:28,118 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-16 03:15:28,139 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-16 03:15:28,145 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-16 03:15:28,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:15:28,152 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-16 03:15:28,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:15:28,156 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-16 03:15:28,164 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-16 03:15:28,168 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-16 03:15:28,176 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-16 03:15:28,180 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-16 03:15:28,247 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:15:28,247 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-16 03:15:28,299 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 16 treesize of output 18 [2023-02-16 03:15:28,305 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 16 treesize of output 18 [2023-02-16 03:15:28,320 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 16 treesize of output 18 [2023-02-16 03:15:28,327 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 16 treesize of output 18 [2023-02-16 03:15:28,337 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 16 treesize of output 18 [2023-02-16 03:15:28,342 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 16 treesize of output 18 [2023-02-16 03:15:28,356 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 16 treesize of output 18 [2023-02-16 03:15:28,361 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 16 treesize of output 18 [2023-02-16 03:15:28,375 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 16 treesize of output 18 [2023-02-16 03:15:28,382 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 16 treesize of output 18 [2023-02-16 03:15:28,447 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-16 03:15:28,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 1 case distinctions, treesize of input 23 treesize of output 26 [2023-02-16 03:15:28,456 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-16 03:15:28,456 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 23 treesize of output 22 [2023-02-16 03:15:28,522 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 45 treesize of output 43 [2023-02-16 03:15:28,525 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 54 treesize of output 54 [2023-02-16 03:15:28,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:15:28,676 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 65 treesize of output 45 [2023-02-16 03:15:28,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:15:28,682 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 48 treesize of output 42 [2023-02-16 03:15:28,837 INFO L321 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2023-02-16 03:15:28,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 63 [2023-02-16 03:15:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:28,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:15:29,118 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_ArrVal_2276 Int) (v_ArrVal_2275 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2275) |c_ULTIMATE.start_main_~first~0#1.base|) .cse1))) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2276) .cse0) 1) (= .cse0 0)))) (or (forall ((v_ArrVal_2274 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2274) |c_ULTIMATE.start_main_~first~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2276 Int) (v_ArrVal_2275 (Array Int Int))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2276) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2275) |c_ULTIMATE.start_main_~first~0#1.base|) .cse1)) 1))))) is different from false [2023-02-16 03:16:06,452 INFO L321 Elim1Store]: treesize reduction 76, result has 54.8 percent of original size [2023-02-16 03:16:06,452 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 6 case distinctions, treesize of input 99 treesize of output 124 [2023-02-16 03:16:06,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:06,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 196 treesize of output 162 [2023-02-16 03:16:06,512 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 31 treesize of output 23 [2023-02-16 03:16:06,672 INFO L321 Elim1Store]: treesize reduction 76, result has 54.8 percent of original size [2023-02-16 03:16:06,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 112 [2023-02-16 03:16:06,728 INFO L321 Elim1Store]: treesize reduction 81, result has 51.8 percent of original size [2023-02-16 03:16:06,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 105 [2023-02-16 03:16:06,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:06,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 177 treesize of output 155 [2023-02-16 03:16:06,759 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 19 treesize of output 15 [2023-02-16 03:16:06,795 INFO L321 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2023-02-16 03:16:06,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 112 treesize of output 112 [2023-02-16 03:16:06,825 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-16 03:16:14,919 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:16:14,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835648758] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:16:14,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:16:14,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 16] total 37 [2023-02-16 03:16:14,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103901585] [2023-02-16 03:16:14,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:16:14,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-16 03:16:14,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:16:14,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-16 03:16:14,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1156, Unknown=20, NotChecked=70, Total=1406 [2023-02-16 03:16:14,920 INFO L87 Difference]: Start difference. First operand 175 states and 199 transitions. Second operand has 38 states, 37 states have (on average 3.2162162162162162) internal successors, (119), 38 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:16:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:16:18,571 INFO L93 Difference]: Finished difference Result 302 states and 334 transitions. [2023-02-16 03:16:18,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-16 03:16:18,572 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.2162162162162162) internal successors, (119), 38 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-16 03:16:18,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:16:18,586 INFO L225 Difference]: With dead ends: 302 [2023-02-16 03:16:18,586 INFO L226 Difference]: Without dead ends: 302 [2023-02-16 03:16:18,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 47.1s TimeCoverageRelationStatistics Valid=855, Invalid=3958, Unknown=21, NotChecked=136, Total=4970 [2023-02-16 03:16:18,588 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 724 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:16:18,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1015 Invalid, 1875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1605 Invalid, 0 Unknown, 162 Unchecked, 2.0s Time] [2023-02-16 03:16:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-02-16 03:16:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 223. [2023-02-16 03:16:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 212 states have (on average 1.2028301886792452) internal successors, (255), 222 states have internal predecessors, (255), 0 states have call successors, (0), 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-16 03:16:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 255 transitions. [2023-02-16 03:16:18,602 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 255 transitions. Word has length 42 [2023-02-16 03:16:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:16:18,602 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 255 transitions. [2023-02-16 03:16:18,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.2162162162162162) internal successors, (119), 38 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:16:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 255 transitions. [2023-02-16 03:16:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:16:18,603 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:16:18,603 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:16:18,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-16 03:16:18,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-02-16 03:16:18,803 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:16:18,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:16:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179933, now seen corresponding path program 1 times [2023-02-16 03:16:18,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:16:18,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523398136] [2023-02-16 03:16:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:16:18,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:16:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:16:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:16:19,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:16:19,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523398136] [2023-02-16 03:16:19,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523398136] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:16:19,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248467848] [2023-02-16 03:16:19,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:16:19,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:16:19,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:16:19,387 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:16:19,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-16 03:16:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:16:19,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-16 03:16:19,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:16:19,568 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-16 03:16:19,611 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-16 03:16:19,621 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:16:19,622 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-16 03:16:19,724 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 11 treesize of output 7 [2023-02-16 03:16:19,729 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 11 treesize of output 7 [2023-02-16 03:16:19,756 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:16:19,756 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-16 03:16:19,761 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 18 treesize of output 20 [2023-02-16 03:16:19,802 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-16 03:16:19,804 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 25 treesize of output 13 [2023-02-16 03:16:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:16:19,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:16:19,917 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2437 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2437) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2438) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)))) (forall ((v_ArrVal_2437 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2437) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 12))))) is different from false [2023-02-16 03:16:19,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:19,921 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 45 treesize of output 46 [2023-02-16 03:16:19,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:19,925 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 35 treesize of output 36 [2023-02-16 03:16:19,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:19,930 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 62 treesize of output 61 [2023-02-16 03:16:19,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:19,936 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 96 treesize of output 89 [2023-02-16 03:16:19,939 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 74 treesize of output 66 [2023-02-16 03:16:19,941 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 36 treesize of output 28 [2023-02-16 03:16:20,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:20,013 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 24 treesize of output 25 [2023-02-16 03:16:20,015 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:16:20,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:20,017 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-16 03:16:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:16:20,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248467848] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:16:20,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:16:20,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2023-02-16 03:16:20,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442616309] [2023-02-16 03:16:20,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:16:20,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 03:16:20,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:16:20,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 03:16:20,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=435, Unknown=1, NotChecked=42, Total=552 [2023-02-16 03:16:20,168 INFO L87 Difference]: Start difference. First operand 223 states and 255 transitions. Second operand has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 24 states have internal predecessors, (111), 0 states have call successors, (0), 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-16 03:16:21,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:16:21,008 INFO L93 Difference]: Finished difference Result 326 states and 366 transitions. [2023-02-16 03:16:21,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 03:16:21,009 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 24 states have internal predecessors, (111), 0 states have call successors, (0), 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-16 03:16:21,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:16:21,009 INFO L225 Difference]: With dead ends: 326 [2023-02-16 03:16:21,009 INFO L226 Difference]: Without dead ends: 326 [2023-02-16 03:16:21,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=1068, Unknown=1, NotChecked=70, Total=1406 [2023-02-16 03:16:21,010 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 283 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:16:21,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 541 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 739 Invalid, 0 Unknown, 122 Unchecked, 0.4s Time] [2023-02-16 03:16:21,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-02-16 03:16:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 272. [2023-02-16 03:16:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 261 states have (on average 1.2183908045977012) internal successors, (318), 271 states have internal predecessors, (318), 0 states have call successors, (0), 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-16 03:16:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 318 transitions. [2023-02-16 03:16:21,013 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 318 transitions. Word has length 42 [2023-02-16 03:16:21,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:16:21,013 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 318 transitions. [2023-02-16 03:16:21,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.826086956521739) internal successors, (111), 24 states have internal predecessors, (111), 0 states have call successors, (0), 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-16 03:16:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 318 transitions. [2023-02-16 03:16:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:16:21,014 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:16:21,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:16:21,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-16 03:16:21,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-02-16 03:16:21,222 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:16:21,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:16:21,223 INFO L85 PathProgramCache]: Analyzing trace with hash -131950583, now seen corresponding path program 1 times [2023-02-16 03:16:21,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:16:21,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174552374] [2023-02-16 03:16:21,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:16:21,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:16:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:16:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:16:21,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:16:21,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174552374] [2023-02-16 03:16:21,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174552374] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:16:21,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405224598] [2023-02-16 03:16:21,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:16:21,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:16:21,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:16:21,917 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:16:21,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-16 03:16:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:16:22,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 81 conjunts are in the unsatisfiable core [2023-02-16 03:16:22,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:16:22,096 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-16 03:16:22,098 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-16 03:16:22,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:22,105 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-16 03:16:22,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:22,109 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-16 03:16:22,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:22,116 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-16 03:16:22,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:22,119 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-16 03:16:22,197 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:16:22,197 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 23 treesize of output 18 [2023-02-16 03:16:22,209 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:16:22,209 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 23 treesize of output 18 [2023-02-16 03:16:22,296 INFO L321 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2023-02-16 03:16:22,296 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 46 [2023-02-16 03:16:22,312 INFO L321 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2023-02-16 03:16:22,312 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 23 treesize of output 39 [2023-02-16 03:16:22,316 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 5 treesize of output 3 [2023-02-16 03:16:22,323 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 5 treesize of output 3 [2023-02-16 03:16:22,328 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:16:22,335 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 24 treesize of output 18 [2023-02-16 03:16:22,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:22,401 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 33 treesize of output 32 [2023-02-16 03:16:22,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:22,404 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 33 treesize of output 32 [2023-02-16 03:16:22,412 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 31 treesize of output 30 [2023-02-16 03:16:22,414 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 31 treesize of output 30 [2023-02-16 03:16:22,448 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:16:22,448 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 26 treesize of output 32 [2023-02-16 03:16:22,457 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:16:22,457 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 29 treesize of output 32 [2023-02-16 03:16:22,473 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:16:22,647 INFO L321 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2023-02-16 03:16:22,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 54 [2023-02-16 03:16:22,662 INFO L321 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2023-02-16 03:16:22,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2023-02-16 03:16:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:16:22,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:16:23,006 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 6 treesize of output 4 [2023-02-16 03:16:23,348 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (forall ((v_ArrVal_2593 Int) (v_ArrVal_2598 (Array Int Int)) (v_ArrVal_2586 (Array Int Int)) (v_ArrVal_2588 Int)) (or (not (= 0 (select v_ArrVal_2598 |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2586))) (store .cse0 |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_2588) .cse2 v_ArrVal_2593))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2598) |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.offset|))) (forall ((v_ArrVal_2590 Int) (v_ArrVal_2595 Int) (v_ArrVal_2585 (Array Int Int))) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2585))) (store .cse4 |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_2590) .cse2 v_ArrVal_2595))))) (store .cse3 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|))) |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)))) is different from false [2023-02-16 03:16:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:16:24,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405224598] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:16:24,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:16:24,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 21] total 42 [2023-02-16 03:16:24,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929057844] [2023-02-16 03:16:24,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:16:24,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-16 03:16:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:16:24,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-16 03:16:24,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1308, Unknown=149, NotChecked=78, Total=1722 [2023-02-16 03:16:24,137 INFO L87 Difference]: Start difference. First operand 272 states and 318 transitions. Second operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 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-16 03:16:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:16:25,869 INFO L93 Difference]: Finished difference Result 505 states and 601 transitions. [2023-02-16 03:16:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-16 03:16:25,869 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 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 42 [2023-02-16 03:16:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:16:25,870 INFO L225 Difference]: With dead ends: 505 [2023-02-16 03:16:25,870 INFO L226 Difference]: Without dead ends: 505 [2023-02-16 03:16:25,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 56 SyntacticMatches, 11 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=471, Invalid=3371, Unknown=194, NotChecked=124, Total=4160 [2023-02-16 03:16:25,871 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 368 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:16:25,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 829 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1141 Invalid, 0 Unknown, 138 Unchecked, 0.7s Time] [2023-02-16 03:16:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2023-02-16 03:16:25,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 300. [2023-02-16 03:16:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 289 states have (on average 1.2041522491349481) internal successors, (348), 299 states have internal predecessors, (348), 0 states have call successors, (0), 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-16 03:16:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 348 transitions. [2023-02-16 03:16:25,876 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 348 transitions. Word has length 42 [2023-02-16 03:16:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:16:25,876 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 348 transitions. [2023-02-16 03:16:25,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 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-16 03:16:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 348 transitions. [2023-02-16 03:16:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 03:16:25,876 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:16:25,877 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:16:25,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-16 03:16:26,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-02-16 03:16:26,082 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:16:26,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:16:26,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1041969739, now seen corresponding path program 1 times [2023-02-16 03:16:26,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:16:26,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120503582] [2023-02-16 03:16:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:16:26,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:16:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:16:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:16:26,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:16:26,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120503582] [2023-02-16 03:16:26,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120503582] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:16:26,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890039849] [2023-02-16 03:16:26,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:16:26,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:16:26,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:16:26,314 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:16:26,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-16 03:16:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:16:26,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-16 03:16:26,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:16:26,517 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-16 03:16:26,562 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:16:26,564 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 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-16 03:16:26,637 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:16:26,661 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:16:26,661 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 27 treesize of output 28 [2023-02-16 03:16:26,690 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 24 treesize of output 12 [2023-02-16 03:16:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:16:26,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:16:26,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:26,741 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 23 treesize of output 24 [2023-02-16 03:16:26,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:26,750 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 39 treesize of output 38 [2023-02-16 03:16:26,751 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 22 treesize of output 18 [2023-02-16 03:16:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:16:26,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890039849] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:16:26,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:16:26,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2023-02-16 03:16:26,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394247947] [2023-02-16 03:16:26,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:16:26,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 03:16:26,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:16:26,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 03:16:26,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=246, Unknown=4, NotChecked=0, Total=306 [2023-02-16 03:16:26,879 INFO L87 Difference]: Start difference. First operand 300 states and 348 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 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-16 03:16:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:16:27,142 INFO L93 Difference]: Finished difference Result 329 states and 368 transitions. [2023-02-16 03:16:27,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:16:27,142 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-16 03:16:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:16:27,143 INFO L225 Difference]: With dead ends: 329 [2023-02-16 03:16:27,143 INFO L226 Difference]: Without dead ends: 329 [2023-02-16 03:16:27,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=532, Unknown=5, NotChecked=0, Total=702 [2023-02-16 03:16:27,144 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 277 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:16:27,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 413 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:16:27,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-02-16 03:16:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 300. [2023-02-16 03:16:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 289 states have (on average 1.1972318339100345) internal successors, (346), 299 states have internal predecessors, (346), 0 states have call successors, (0), 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-16 03:16:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 346 transitions. [2023-02-16 03:16:27,165 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 346 transitions. Word has length 43 [2023-02-16 03:16:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:16:27,166 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 346 transitions. [2023-02-16 03:16:27,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 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-16 03:16:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 346 transitions. [2023-02-16 03:16:27,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 03:16:27,168 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:16:27,168 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:16:27,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-16 03:16:27,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:16:27,369 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:16:27,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:16:27,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2058655426, now seen corresponding path program 1 times [2023-02-16 03:16:27,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:16:27,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274745159] [2023-02-16 03:16:27,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:16:27,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:16:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:16:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:16:27,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:16:27,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274745159] [2023-02-16 03:16:27,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274745159] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:16:27,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210006880] [2023-02-16 03:16:27,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:16:27,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:16:27,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:16:27,871 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:16:27,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-16 03:16:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:16:28,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-16 03:16:28,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:16:28,065 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-16 03:16:28,072 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-16 03:16:28,087 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-16 03:16:28,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:28,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:28,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-16 03:16:28,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-02-16 03:16:28,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-02-16 03:16:28,179 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:16:28,180 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-16 03:16:28,219 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 25 treesize of output 25 [2023-02-16 03:16:28,241 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 25 treesize of output 25 [2023-02-16 03:16:28,265 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 25 treesize of output 25 [2023-02-16 03:16:28,290 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 25 treesize of output 25 [2023-02-16 03:16:28,313 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 25 treesize of output 25 [2023-02-16 03:16:28,379 INFO L321 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-02-16 03:16:28,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-02-16 03:16:28,412 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 25 treesize of output 25 [2023-02-16 03:16:28,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:28,461 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 22 treesize of output 10 [2023-02-16 03:16:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:16:28,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:16:28,521 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:28,521 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 20 treesize of output 24 [2023-02-16 03:16:28,603 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2929 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2929) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) is different from false [2023-02-16 03:16:28,818 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2916 Int) (|v_ULTIMATE.start_main_~x~0#1.base_50| Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_50|))) (<= 0 (select (select (store (let ((.cse0 (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_2916)) |v_ULTIMATE.start_main_~x~0#1.base_50| v_ArrVal_2926))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) 0))) |v_ULTIMATE.start_main_~x~0#1.base_50| v_ArrVal_2929) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))))) is different from false [2023-02-16 03:16:28,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:28,855 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 48 treesize of output 39 [2023-02-16 03:16:28,858 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 80 treesize of output 76 [2023-02-16 03:16:28,861 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 37 treesize of output 33 [2023-02-16 03:16:28,864 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 47 treesize of output 39 [2023-02-16 03:16:28,866 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 55 treesize of output 47 [2023-02-16 03:16:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-16 03:16:28,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210006880] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:16:28,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:16:28,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2023-02-16 03:16:28,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411616468] [2023-02-16 03:16:28,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:16:28,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-16 03:16:28,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:16:28,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-16 03:16:28,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=805, Unknown=5, NotChecked=118, Total=1056 [2023-02-16 03:16:28,893 INFO L87 Difference]: Start difference. First operand 300 states and 346 transitions. Second operand has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:16:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:16:31,545 INFO L93 Difference]: Finished difference Result 452 states and 507 transitions. [2023-02-16 03:16:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-02-16 03:16:31,546 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-16 03:16:31,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:16:31,547 INFO L225 Difference]: With dead ends: 452 [2023-02-16 03:16:31,547 INFO L226 Difference]: Without dead ends: 452 [2023-02-16 03:16:31,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 71 SyntacticMatches, 16 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1813 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1138, Invalid=4868, Unknown=8, NotChecked=306, Total=6320 [2023-02-16 03:16:31,548 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 638 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:16:31,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 571 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1095 Invalid, 0 Unknown, 321 Unchecked, 0.8s Time] [2023-02-16 03:16:31,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2023-02-16 03:16:31,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 323. [2023-02-16 03:16:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 312 states have (on average 1.2307692307692308) internal successors, (384), 322 states have internal predecessors, (384), 0 states have call successors, (0), 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-16 03:16:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 384 transitions. [2023-02-16 03:16:31,568 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 384 transitions. Word has length 44 [2023-02-16 03:16:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:16:31,569 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 384 transitions. [2023-02-16 03:16:31,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:16:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 384 transitions. [2023-02-16 03:16:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 03:16:31,571 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:16:31,571 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:16:31,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-16 03:16:31,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-02-16 03:16:31,777 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:16:31,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:16:31,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2044465849, now seen corresponding path program 1 times [2023-02-16 03:16:31,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:16:31,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429248965] [2023-02-16 03:16:31,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:16:31,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:16:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:16:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:16:31,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:16:31,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429248965] [2023-02-16 03:16:31,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429248965] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:16:31,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751912471] [2023-02-16 03:16:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:16:31,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:16:31,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:16:31,918 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:16:31,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-16 03:16:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:16:32,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-16 03:16:32,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:16:32,133 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 7 treesize of output 3 [2023-02-16 03:16:32,204 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:16:32,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-16 03:16:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:16:32,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:16:32,390 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 32 treesize of output 28 [2023-02-16 03:16:32,392 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:16:32,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:16:32,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751912471] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:16:32,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:16:32,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2023-02-16 03:16:32,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994103710] [2023-02-16 03:16:32,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:16:32,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 03:16:32,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:16:32,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 03:16:32,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:16:32,397 INFO L87 Difference]: Start difference. First operand 323 states and 384 transitions. Second operand has 18 states, 17 states have (on average 5.352941176470588) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 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-16 03:16:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:16:32,877 INFO L93 Difference]: Finished difference Result 363 states and 427 transitions. [2023-02-16 03:16:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 03:16:32,878 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.352941176470588) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-16 03:16:32,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:16:32,879 INFO L225 Difference]: With dead ends: 363 [2023-02-16 03:16:32,879 INFO L226 Difference]: Without dead ends: 363 [2023-02-16 03:16:32,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=809, Unknown=0, NotChecked=0, Total=1122 [2023-02-16 03:16:32,879 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 224 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:16:32,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 221 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:16:32,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-02-16 03:16:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 313. [2023-02-16 03:16:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 303 states have (on average 1.2112211221122111) internal successors, (367), 312 states have internal predecessors, (367), 0 states have call successors, (0), 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-16 03:16:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 367 transitions. [2023-02-16 03:16:32,882 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 367 transitions. Word has length 44 [2023-02-16 03:16:32,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:16:32,883 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 367 transitions. [2023-02-16 03:16:32,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.352941176470588) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 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-16 03:16:32,883 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 367 transitions. [2023-02-16 03:16:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 03:16:32,883 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:16:32,883 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:16:32,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-16 03:16:33,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-02-16 03:16:33,084 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-16 03:16:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:16:33,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1931630812, now seen corresponding path program 1 times [2023-02-16 03:16:33,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:16:33,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472119022] [2023-02-16 03:16:33,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:16:33,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:16:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:16:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:16:34,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:16:34,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472119022] [2023-02-16 03:16:34,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472119022] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:16:34,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206159128] [2023-02-16 03:16:34,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:16:34,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:16:34,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:16:34,022 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:16:34,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-16 03:16:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:16:34,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 94 conjunts are in the unsatisfiable core [2023-02-16 03:16:34,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:16:34,225 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-16 03:16:34,228 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-16 03:16:34,233 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-16 03:16:34,237 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-16 03:16:34,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,268 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:34,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-02-16 03:16:34,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,275 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-16 03:16:34,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,327 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:34,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-02-16 03:16:34,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-02-16 03:16:34,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:34,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-02-16 03:16:34,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-16 03:16:34,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,499 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:16:34,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 49 [2023-02-16 03:16:34,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,518 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:16:34,518 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2023-02-16 03:16:34,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,683 INFO L321 Elim1Store]: treesize reduction 58, result has 26.6 percent of original size [2023-02-16 03:16:34,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 64 [2023-02-16 03:16:34,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:34,724 INFO L321 Elim1Store]: treesize reduction 82, result has 38.3 percent of original size [2023-02-16 03:16:34,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 75 [2023-02-16 03:16:34,969 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2023-02-16 03:16:34,969 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 106 treesize of output 112 [2023-02-16 03:16:34,987 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2023-02-16 03:16:34,988 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 102 treesize of output 98 [2023-02-16 03:16:34,995 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 5 treesize of output 3 [2023-02-16 03:16:35,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:35,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:35,044 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 69 treesize of output 77 [2023-02-16 03:16:35,152 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:16:35,158 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 13 treesize of output 9 [2023-02-16 03:16:35,170 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:16:35,172 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:16:35,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:35,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:35,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:35,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 170 treesize of output 294 [2023-02-16 03:16:50,379 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:16:50,380 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 104 treesize of output 102 [2023-02-16 03:16:50,387 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:16:50,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 90 [2023-02-16 03:16:50,402 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:16:50,431 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:16:50,432 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:16:50,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:50,451 INFO L321 Elim1Store]: treesize reduction 26, result has 50.0 percent of original size [2023-02-16 03:16:50,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 109 treesize of output 113 [2023-02-16 03:16:50,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:50,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:16:50,469 INFO L321 Elim1Store]: treesize reduction 36, result has 41.9 percent of original size [2023-02-16 03:16:50,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 116 [2023-02-16 03:16:50,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:50,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 45 [2023-02-16 03:16:50,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:16:50,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 37 treesize of output 37 [2023-02-16 03:16:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:16:50,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:16:54,823 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (forall ((v_ArrVal_3216 Int)) (or (not (<= v_ArrVal_3216 |c_ULTIMATE.start_main_#t~mem7#1.offset|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3216)) (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (or (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (forall ((v_ArrVal_3228 Int) (v_ArrVal_3223 (Array Int Int))) (not (= 0 (select (store (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3216)))) (store .cse0 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse1 |c_ULTIMATE.start_main_~y~0#1.offset|))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3223) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3228) |ULTIMATE.start_main_~x~1#1.offset|)))) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3224 (Array Int Int))) (let ((.cse2 (select (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)))) (store .cse4 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse1 |ULTIMATE.start_main_~y~0#1.base|))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3224) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse2 .cse3) 0) (= (select (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))))))))))) (forall ((v_ArrVal_3216 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (or (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (forall ((v_ArrVal_3228 Int) (v_ArrVal_3223 (Array Int Int))) (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3216)))) (store .cse6 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse7 |c_ULTIMATE.start_main_~y~0#1.offset|))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3223) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= 0 (select (store .cse5 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3228) |ULTIMATE.start_main_~x~1#1.offset|))) (= (select .cse5 .cse3) 0)))) (forall ((v_ArrVal_3224 (Array Int Int))) (= (select (store (select (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)))) (store .cse8 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse7 |ULTIMATE.start_main_~y~0#1.base|))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3224) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|))))) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3216)))) (not (<= v_ArrVal_3216 |c_ULTIMATE.start_main_#t~mem7#1.offset|)))))) is different from false [2023-02-16 03:18:16,303 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16))) (let ((.cse11 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 0)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_3204 Int) (v_ArrVal_3198 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (v_ArrVal_3207 Int) (v_ArrVal_3205 Int) (v_ArrVal_3216 Int) (v_ArrVal_3228 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (v_ArrVal_3212 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3211 Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (let ((.cse0 (select (store (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse11 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3204) .cse7 v_ArrVal_3207) .cse8 v_ArrVal_3211)))) (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) 0 v_ArrVal_3216))))) (store .cse9 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 0))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3223) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse0 .cse1) 0) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (not (= 0 (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3228) |ULTIMATE.start_main_~x~1#1.offset|))) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3216)) (= (select (store (select (store (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store .cse5 .cse6 v_ArrVal_3198) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse7 v_ArrVal_3205) .cse8 v_ArrVal_3212)))) (store .cse4 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~y~0#1.base|) 0 |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 |ULTIMATE.start_main_~y~0#1.base|))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3224) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (< v_ArrVal_3204 v_ArrVal_3216))))) (not (<= v_ArrVal_3204 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_3204 Int) (v_ArrVal_3198 Int)) (or (not (<= v_ArrVal_3204 |c_ULTIMATE.start_main_~x~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (v_ArrVal_3207 Int) (v_ArrVal_3205 Int) (v_ArrVal_3216 Int) (v_ArrVal_3228 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3224 (Array Int Int)) (v_ArrVal_3212 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3211 Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (let ((.cse15 (select (store (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store .cse5 .cse6 v_ArrVal_3198) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse7 v_ArrVal_3205) .cse8 v_ArrVal_3212)))) (store .cse17 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse17 |ULTIMATE.start_main_~y~0#1.base|) 0 |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse16 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~x~0#1.base|) .cse13 |ULTIMATE.start_main_~y~0#1.base|))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3224) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (not (= 0 (select (store (select (store (let ((.cse12 (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse11 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3204) .cse7 v_ArrVal_3207) .cse8 v_ArrVal_3211)))) (store .cse14 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse14 |ULTIMATE.start_main_~y~0#1.base|) 0 v_ArrVal_3216))))) (store .cse12 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~x~0#1.base|) .cse13 0))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3223) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3228) |ULTIMATE.start_main_~x~1#1.offset|))) (= (select .cse15 .cse1) 0) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3216)) (= (select (store .cse15 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (< v_ArrVal_3204 v_ArrVal_3216)))))))))) is different from false [2023-02-16 03:18:16,364 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:16,365 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:16,372 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:16,773 INFO L321 Elim1Store]: treesize reduction 187, result has 36.2 percent of original size [2023-02-16 03:18:16,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 303 treesize of output 132 [2023-02-16 03:18:16,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:18:16,781 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:16,781 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:16,782 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:16,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:16,854 INFO L321 Elim1Store]: treesize reduction 130, result has 41.4 percent of original size [2023-02-16 03:18:16,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 151 treesize of output 105 [2023-02-16 03:18:16,867 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:18:16,868 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 176 [2023-02-16 03:18:16,876 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:16,878 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:16,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:16,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:18:16,930 INFO L321 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2023-02-16 03:18:16,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 13 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 286 treesize of output 244 [2023-02-16 03:18:16,949 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:18:16,949 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 161 treesize of output 147 [2023-02-16 03:18:16,957 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:16,958 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:16,966 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:16,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:18:17,012 INFO L321 Elim1Store]: treesize reduction 18, result has 76.6 percent of original size [2023-02-16 03:18:17,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 13 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 143 treesize of output 171 [2023-02-16 03:18:17,018 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:17,027 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-02-16 03:18:17,027 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 14 treesize of output 13 [2023-02-16 03:18:17,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-02-16 03:18:17,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:18:17,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:18:17,154 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:17,154 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:17,172 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:17,173 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:17,174 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:17,389 INFO L321 Elim1Store]: treesize reduction 28, result has 71.7 percent of original size [2023-02-16 03:18:17,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 85 [2023-02-16 03:18:17,398 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:17,398 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:17,400 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:17,402 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:17,404 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:17,404 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:17,454 INFO L321 Elim1Store]: treesize reduction 129, result has 34.5 percent of original size [2023-02-16 03:18:17,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 16 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 302 treesize of output 93 [2023-02-16 03:18:17,460 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 152 treesize of output 126 [2023-02-16 03:18:17,474 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:17,493 INFO L321 Elim1Store]: treesize reduction 44, result has 22.8 percent of original size [2023-02-16 03:18:17,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 261 treesize of output 165 [2023-02-16 03:18:17,516 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-16 03:18:17,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 54 [2023-02-16 03:18:17,527 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:18:17,528 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 21 treesize of output 19 [2023-02-16 03:18:17,531 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:18:17,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-16 03:18:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:18:17,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206159128] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:18:17,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:18:17,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 24] total 56 [2023-02-16 03:18:17,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105055796] [2023-02-16 03:18:17,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:18:17,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-16 03:18:17,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:18:17,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-16 03:18:17,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=2306, Unknown=277, NotChecked=210, Total=3080 [2023-02-16 03:18:17,554 INFO L87 Difference]: Start difference. First operand 313 states and 367 transitions. Second operand has 56 states, 56 states have (on average 2.125) internal successors, (119), 56 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:18:24,042 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-16 03:18:26,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:18:27,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:18:30,645 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-16 03:19:14,884 WARN L233 SmtUtils]: Spent 7.67s on a formula simplification. DAG size of input: 118 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)