./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/list-ext_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 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/list-ext-properties/list-ext_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e978ccdde62c7126e7c77a584896efdc6e7afe04b6752d127d7236cecdea192f --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:47:46,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:47:46,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:47:46,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:47:46,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:47:46,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:47:46,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:47:46,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:47:46,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:47:46,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:47:46,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:47:46,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:47:46,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:47:46,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:47:46,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:47:46,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:47:46,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:47:46,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:47:46,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:47:46,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:47:46,669 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:47:46,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:47:46,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:47:46,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:47:46,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:47:46,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:47:46,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:47:46,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:47:46,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:47:46,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:47:46,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:47:46,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:47:46,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:47:46,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:47:46,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:47:46,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:47:46,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:47:46,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:47:46,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:47:46,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:47:46,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:47:46,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:47:46,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:47:46,709 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:47:46,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:47:46,710 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:47:46,710 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:47:46,710 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:47:46,710 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:47:46,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:47:46,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:47:46,711 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:47:46,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:47:46,712 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:47:46,712 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:47:46,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:47:46,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:47:46,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:47:46,713 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:47:46,713 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:47:46,713 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:47:46,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:47:46,715 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:47:46,715 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:47:46,715 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:47:46,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:47:46,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:47:46,715 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:47:46,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:47:46,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:47:46,716 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:47:46,716 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:47:46,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:47:46,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e978ccdde62c7126e7c77a584896efdc6e7afe04b6752d127d7236cecdea192f [2022-07-20 05:47:46,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:47:46,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:47:46,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:47:46,917 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:47:46,918 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:47:46,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext_1.i [2022-07-20 05:47:46,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f302e27c6/2ef9113babca48458c8113eabd511a3c/FLAG3d3ce205f [2022-07-20 05:47:47,387 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:47:47,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_1.i [2022-07-20 05:47:47,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f302e27c6/2ef9113babca48458c8113eabd511a3c/FLAG3d3ce205f [2022-07-20 05:47:47,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f302e27c6/2ef9113babca48458c8113eabd511a3c [2022-07-20 05:47:47,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:47:47,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:47:47,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:47:47,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:47:47,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:47:47,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:47:47" (1/1) ... [2022-07-20 05:47:47,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f174147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:47, skipping insertion in model container [2022-07-20 05:47:47,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:47:47" (1/1) ... [2022-07-20 05:47:47,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:47:47,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:47:47,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_1.i[23553,23566] [2022-07-20 05:47:47,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:47:47,699 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:47:47,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_1.i[23553,23566] [2022-07-20 05:47:47,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:47:47,758 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:47:47,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:47 WrapperNode [2022-07-20 05:47:47,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:47:47,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:47:47,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:47:47,759 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:47:47,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:47" (1/1) ... [2022-07-20 05:47:47,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:47" (1/1) ... [2022-07-20 05:47:47,787 INFO L137 Inliner]: procedures = 124, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 128 [2022-07-20 05:47:47,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:47:47,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:47:47,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:47:47,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:47:47,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:47" (1/1) ... [2022-07-20 05:47:47,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:47" (1/1) ... [2022-07-20 05:47:47,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:47" (1/1) ... [2022-07-20 05:47:47,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:47" (1/1) ... [2022-07-20 05:47:47,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:47" (1/1) ... [2022-07-20 05:47:47,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:47" (1/1) ... [2022-07-20 05:47:47,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:47" (1/1) ... [2022-07-20 05:47:47,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:47:47,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:47:47,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:47:47,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:47:47,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:47" (1/1) ... [2022-07-20 05:47:47,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:47:47,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:47,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 05:47:47,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 05:47:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-20 05:47:47,888 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-20 05:47:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 05:47:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 05:47:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:47:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:47:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:47:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:47:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:47:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 05:47:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:47:47,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:47:47,951 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:47:47,952 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:47:47,983 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-20 05:47:48,145 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:47:48,150 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:47:48,150 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-20 05:47:48,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:47:48 BoogieIcfgContainer [2022-07-20 05:47:48,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:47:48,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:47:48,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:47:48,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:47:48,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:47:47" (1/3) ... [2022-07-20 05:47:48,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5c38cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:47:48, skipping insertion in model container [2022-07-20 05:47:48,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:47" (2/3) ... [2022-07-20 05:47:48,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5c38cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:47:48, skipping insertion in model container [2022-07-20 05:47:48,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:47:48" (3/3) ... [2022-07-20 05:47:48,157 INFO L111 eAbstractionObserver]: Analyzing ICFG list-ext_1.i [2022-07-20 05:47:48,166 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:47:48,166 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-07-20 05:47:48,209 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:47:48,214 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@130006d1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6570776f [2022-07-20 05:47:48,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-07-20 05:47:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 91 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:47:48,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:48,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:48,235 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:48,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:48,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2098269937, now seen corresponding path program 1 times [2022-07-20 05:47:48,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:48,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540386071] [2022-07-20 05:47:48,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:48,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:48,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:48,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540386071] [2022-07-20 05:47:48,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540386071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:48,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:48,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:47:48,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276032715] [2022-07-20 05:47:48,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:48,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 05:47:48,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:48,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 05:47:48,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 05:47:48,421 INFO L87 Difference]: Start difference. First operand has 93 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 91 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:48,439 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-07-20 05:47:48,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 05:47:48,441 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 05:47:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:48,448 INFO L225 Difference]: With dead ends: 93 [2022-07-20 05:47:48,448 INFO L226 Difference]: Without dead ends: 86 [2022-07-20 05:47:48,449 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 [2022-07-20 05:47:48,454 INFO L413 NwaCegarLoop]: 102 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, 102 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 [2022-07-20 05:47:48,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:48,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-20 05:47:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-20 05:47:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-07-20 05:47:48,490 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 7 [2022-07-20 05:47:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:48,491 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-07-20 05:47:48,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-07-20 05:47:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:47:48,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:48,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:48,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:47:48,493 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:48,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:48,495 INFO L85 PathProgramCache]: Analyzing trace with hash 620871786, now seen corresponding path program 1 times [2022-07-20 05:47:48,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:48,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667458354] [2022-07-20 05:47:48,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:48,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:48,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:48,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667458354] [2022-07-20 05:47:48,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667458354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:48,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:48,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:47:48,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367746703] [2022-07-20 05:47:48,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:48,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:47:48,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:48,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:47:48,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:47:48,590 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:48,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:48,746 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2022-07-20 05:47:48,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:47:48,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 05:47:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:48,750 INFO L225 Difference]: With dead ends: 107 [2022-07-20 05:47:48,750 INFO L226 Difference]: Without dead ends: 107 [2022-07-20 05:47:48,754 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 [2022-07-20 05:47:48,755 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 160 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:48,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 52 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:48,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-20 05:47:48,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2022-07-20 05:47:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 86 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2022-07-20 05:47:48,769 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 8 [2022-07-20 05:47:48,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:48,770 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2022-07-20 05:47:48,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:48,771 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-07-20 05:47:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:47:48,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:48,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:48,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:47:48,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:48,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:48,776 INFO L85 PathProgramCache]: Analyzing trace with hash 620871787, now seen corresponding path program 1 times [2022-07-20 05:47:48,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:48,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771408605] [2022-07-20 05:47:48,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:48,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:48,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:48,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771408605] [2022-07-20 05:47:48,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771408605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:48,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:48,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:47:48,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635655474] [2022-07-20 05:47:48,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:48,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:47:48,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:48,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:47:48,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:47:48,851 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:48,978 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2022-07-20 05:47:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:47:48,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 05:47:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:48,981 INFO L225 Difference]: With dead ends: 124 [2022-07-20 05:47:48,981 INFO L226 Difference]: Without dead ends: 124 [2022-07-20 05:47:48,983 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 [2022-07-20 05:47:48,987 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 167 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:48,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 60 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:48,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-20 05:47:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2022-07-20 05:47:48,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.5125) internal successors, (121), 106 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-07-20 05:47:48,996 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 8 [2022-07-20 05:47:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:48,997 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-07-20 05:47:48,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-07-20 05:47:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:47:48,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:48,998 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:48,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:47:48,998 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:48,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204644, now seen corresponding path program 1 times [2022-07-20 05:47:48,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:49,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441908356] [2022-07-20 05:47:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:49,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:49,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:49,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441908356] [2022-07-20 05:47:49,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441908356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:49,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:49,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:47:49,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165082035] [2022-07-20 05:47:49,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:49,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:49,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:49,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:49,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:49,076 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:49,277 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2022-07-20 05:47:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:47:49,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 05:47:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:49,278 INFO L225 Difference]: With dead ends: 152 [2022-07-20 05:47:49,279 INFO L226 Difference]: Without dead ends: 152 [2022-07-20 05:47:49,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:47:49,279 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 115 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:49,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 240 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:47:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-20 05:47:49,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 111. [2022-07-20 05:47:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 110 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2022-07-20 05:47:49,284 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 17 [2022-07-20 05:47:49,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:49,284 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2022-07-20 05:47:49,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2022-07-20 05:47:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:47:49,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:49,285 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:49,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:47:49,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:49,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:49,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204645, now seen corresponding path program 1 times [2022-07-20 05:47:49,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:49,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695572462] [2022-07-20 05:47:49,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:49,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:49,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:49,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695572462] [2022-07-20 05:47:49,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695572462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:49,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:49,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:47:49,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280178195] [2022-07-20 05:47:49,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:49,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:49,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:49,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:49,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:49,413 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:49,650 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2022-07-20 05:47:49,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:47:49,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 05:47:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:49,651 INFO L225 Difference]: With dead ends: 155 [2022-07-20 05:47:49,651 INFO L226 Difference]: Without dead ends: 155 [2022-07-20 05:47:49,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:47:49,652 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 79 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:49,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 307 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:47:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-20 05:47:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 95. [2022-07-20 05:47:49,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 94 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) [2022-07-20 05:47:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2022-07-20 05:47:49,656 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 17 [2022-07-20 05:47:49,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:49,656 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2022-07-20 05:47:49,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-07-20 05:47:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 05:47:49,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:49,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:49,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:47:49,657 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:49,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:49,660 INFO L85 PathProgramCache]: Analyzing trace with hash -808483032, now seen corresponding path program 1 times [2022-07-20 05:47:49,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:49,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065499239] [2022-07-20 05:47:49,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:49,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:49,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:49,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065499239] [2022-07-20 05:47:49,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065499239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:49,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:49,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:47:49,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240380606] [2022-07-20 05:47:49,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:49,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:47:49,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:49,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:47:49,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:47:49,760 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:49,897 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2022-07-20 05:47:49,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:47:49,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 05:47:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:49,899 INFO L225 Difference]: With dead ends: 187 [2022-07-20 05:47:49,899 INFO L226 Difference]: Without dead ends: 187 [2022-07-20 05:47:49,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:47:49,900 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 118 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:49,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 231 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-20 05:47:49,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 106. [2022-07-20 05:47:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 105 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2022-07-20 05:47:49,910 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 18 [2022-07-20 05:47:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:49,910 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2022-07-20 05:47:49,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2022-07-20 05:47:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:47:49,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:49,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:49,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:47:49,914 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:49,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash 389256394, now seen corresponding path program 1 times [2022-07-20 05:47:49,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:49,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045817363] [2022-07-20 05:47:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:49,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:49,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045817363] [2022-07-20 05:47:49,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045817363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:49,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:49,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:47:49,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474890887] [2022-07-20 05:47:49,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:49,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:47:49,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:49,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:47:50,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:47:50,000 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:50,199 INFO L93 Difference]: Finished difference Result 199 states and 216 transitions. [2022-07-20 05:47:50,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:47:50,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 05:47:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:50,201 INFO L225 Difference]: With dead ends: 199 [2022-07-20 05:47:50,201 INFO L226 Difference]: Without dead ends: 199 [2022-07-20 05:47:50,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:47:50,204 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 119 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:50,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 224 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:47:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-20 05:47:50,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 110. [2022-07-20 05:47:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.4597701149425288) internal successors, (127), 109 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) [2022-07-20 05:47:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 127 transitions. [2022-07-20 05:47:50,222 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 127 transitions. Word has length 20 [2022-07-20 05:47:50,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:50,222 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 127 transitions. [2022-07-20 05:47:50,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2022-07-20 05:47:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:47:50,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:50,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:50,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 05:47:50,225 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:50,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:50,226 INFO L85 PathProgramCache]: Analyzing trace with hash 389308949, now seen corresponding path program 1 times [2022-07-20 05:47:50,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:50,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580722313] [2022-07-20 05:47:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:50,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:50,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:50,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580722313] [2022-07-20 05:47:50,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580722313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:50,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:50,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:47:50,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713124562] [2022-07-20 05:47:50,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:50,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:47:50,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:50,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:47:50,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:47:50,293 INFO L87 Difference]: Start difference. First operand 110 states and 127 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:50,454 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2022-07-20 05:47:50,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:47:50,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 05:47:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:50,455 INFO L225 Difference]: With dead ends: 183 [2022-07-20 05:47:50,455 INFO L226 Difference]: Without dead ends: 183 [2022-07-20 05:47:50,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:47:50,457 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 113 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:50,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 236 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-20 05:47:50,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 110. [2022-07-20 05:47:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 109 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2022-07-20 05:47:50,467 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 20 [2022-07-20 05:47:50,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:50,468 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2022-07-20 05:47:50,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2022-07-20 05:47:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:47:50,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:50,469 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:50,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:47:50,469 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:50,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:50,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1064403471, now seen corresponding path program 1 times [2022-07-20 05:47:50,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:50,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370779023] [2022-07-20 05:47:50,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:50,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:50,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:50,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370779023] [2022-07-20 05:47:50,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370779023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:50,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:50,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:47:50,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108052559] [2022-07-20 05:47:50,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:50,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:50,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:50,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:50,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:50,534 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:50,679 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2022-07-20 05:47:50,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:47:50,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 05:47:50,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:50,680 INFO L225 Difference]: With dead ends: 122 [2022-07-20 05:47:50,680 INFO L226 Difference]: Without dead ends: 122 [2022-07-20 05:47:50,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:47:50,683 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 108 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:50,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 196 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:50,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-20 05:47:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2022-07-20 05:47:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 107 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2022-07-20 05:47:50,688 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 20 [2022-07-20 05:47:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:50,689 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2022-07-20 05:47:50,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2022-07-20 05:47:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:47:50,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:50,691 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:50,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 05:47:50,691 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:50,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1064403472, now seen corresponding path program 1 times [2022-07-20 05:47:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:50,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670463779] [2022-07-20 05:47:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:50,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:50,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:50,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670463779] [2022-07-20 05:47:50,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670463779] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:50,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:50,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:47:50,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503170839] [2022-07-20 05:47:50,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:50,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:50,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:50,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:50,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:50,754 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:50,909 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-07-20 05:47:50,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:47:50,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 05:47:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:50,910 INFO L225 Difference]: With dead ends: 120 [2022-07-20 05:47:50,910 INFO L226 Difference]: Without dead ends: 120 [2022-07-20 05:47:50,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:47:50,910 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 71 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:50,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 250 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:50,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-20 05:47:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2022-07-20 05:47:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 92 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) [2022-07-20 05:47:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2022-07-20 05:47:50,913 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 20 [2022-07-20 05:47:50,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:50,913 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2022-07-20 05:47:50,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:50,913 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2022-07-20 05:47:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 05:47:50,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:50,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:50,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 05:47:50,914 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:50,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:50,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2138921840, now seen corresponding path program 1 times [2022-07-20 05:47:50,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:50,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712891822] [2022-07-20 05:47:50,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:50,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:50,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:50,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712891822] [2022-07-20 05:47:50,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712891822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:50,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:50,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:47:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926671548] [2022-07-20 05:47:50,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:50,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:47:50,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:50,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:47:50,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:47:50,942 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:51,001 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2022-07-20 05:47:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:47:51,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 05:47:51,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:51,002 INFO L225 Difference]: With dead ends: 113 [2022-07-20 05:47:51,002 INFO L226 Difference]: Without dead ends: 113 [2022-07-20 05:47:51,003 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 [2022-07-20 05:47:51,003 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 125 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:51,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 69 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:51,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-20 05:47:51,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2022-07-20 05:47:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.379746835443038) internal successors, (109), 94 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2022-07-20 05:47:51,006 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 24 [2022-07-20 05:47:51,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:51,006 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2022-07-20 05:47:51,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2022-07-20 05:47:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 05:47:51,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:51,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:51,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 05:47:51,007 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:51,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:51,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1785439949, now seen corresponding path program 1 times [2022-07-20 05:47:51,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:51,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985189312] [2022-07-20 05:47:51,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:51,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:51,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:51,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985189312] [2022-07-20 05:47:51,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985189312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:51,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:51,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:47:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829058350] [2022-07-20 05:47:51,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:51,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:47:51,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:51,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:47:51,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:47:51,045 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:51,127 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2022-07-20 05:47:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:47:51,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 05:47:51,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:51,128 INFO L225 Difference]: With dead ends: 128 [2022-07-20 05:47:51,128 INFO L226 Difference]: Without dead ends: 124 [2022-07-20 05:47:51,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:47:51,129 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 72 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:51,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 163 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:51,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-20 05:47:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 98. [2022-07-20 05:47:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 97 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2022-07-20 05:47:51,131 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 26 [2022-07-20 05:47:51,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:51,132 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2022-07-20 05:47:51,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2022-07-20 05:47:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:47:51,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:51,133 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] [2022-07-20 05:47:51,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 05:47:51,133 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:51,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:51,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1628820970, now seen corresponding path program 1 times [2022-07-20 05:47:51,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:51,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192359100] [2022-07-20 05:47:51,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:51,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:51,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:51,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192359100] [2022-07-20 05:47:51,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192359100] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:51,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39122524] [2022-07-20 05:47:51,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:51,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:51,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:51,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:51,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 05:47:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:51,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-20 05:47:51,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:51,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:47:51,460 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:47:51,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:47:51,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:47:51,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:51,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:47:51,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-20 05:47:51,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:51,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:51,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:47:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:51,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:51,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-20 05:47:51,669 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-20 05:47:51,673 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_205) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-20 05:47:51,679 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_201 Int)) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_201)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-20 05:47:51,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:51,721 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:51,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2022-07-20 05:47:51,731 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-20 05:47:51,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2022-07-20 05:47:51,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-20 05:47:51,742 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:47:51,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:47:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-20 05:47:51,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39122524] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:51,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:51,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 29 [2022-07-20 05:47:51,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649524920] [2022-07-20 05:47:51,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:51,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 05:47:51,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:51,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 05:47:51,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=478, Unknown=4, NotChecked=196, Total=812 [2022-07-20 05:47:51,786 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 29 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) [2022-07-20 05:47:52,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:52,373 INFO L93 Difference]: Finished difference Result 273 states and 300 transitions. [2022-07-20 05:47:52,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 05:47:52,374 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 29 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 27 [2022-07-20 05:47:52,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:52,375 INFO L225 Difference]: With dead ends: 273 [2022-07-20 05:47:52,375 INFO L226 Difference]: Without dead ends: 273 [2022-07-20 05:47:52,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=367, Invalid=1127, Unknown=4, NotChecked=308, Total=1806 [2022-07-20 05:47:52,376 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 451 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 864 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:52,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 763 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 721 Invalid, 0 Unknown, 864 Unchecked, 0.3s Time] [2022-07-20 05:47:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-20 05:47:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 112. [2022-07-20 05:47:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 111 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2022-07-20 05:47:52,378 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 27 [2022-07-20 05:47:52,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:52,378 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2022-07-20 05:47:52,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 29 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) [2022-07-20 05:47:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2022-07-20 05:47:52,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:47:52,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:52,379 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] [2022-07-20 05:47:52,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:52,587 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,SelfDestructingSolverStorable12 [2022-07-20 05:47:52,588 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:52,588 INFO L85 PathProgramCache]: Analyzing trace with hash 324037282, now seen corresponding path program 1 times [2022-07-20 05:47:52,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:52,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046426629] [2022-07-20 05:47:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:52,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:52,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:52,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046426629] [2022-07-20 05:47:52,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046426629] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:52,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467314729] [2022-07-20 05:47:52,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:52,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:52,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:52,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:52,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 05:47:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:52,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 05:47:52,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:52,846 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 05:47:52,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 05:47:52,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:47:53,020 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:47:53,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:47:53,036 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:47:53,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 05:47:53,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 05:47:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:53,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:53,193 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_266 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2022-07-20 05:47:53,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_266 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_266) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2022-07-20 05:47:53,202 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:53,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-20 05:47:53,208 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:53,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2022-07-20 05:47:53,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:47:55,398 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:55,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 74 treesize of output 228 [2022-07-20 05:47:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:56,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467314729] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:56,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:56,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2022-07-20 05:47:56,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614289846] [2022-07-20 05:47:56,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:56,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-20 05:47:56,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:56,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-20 05:47:56,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=719, Unknown=6, NotChecked=114, Total=992 [2022-07-20 05:47:56,151 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:56,656 INFO L93 Difference]: Finished difference Result 240 states and 271 transitions. [2022-07-20 05:47:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:47:56,657 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 05:47:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:56,658 INFO L225 Difference]: With dead ends: 240 [2022-07-20 05:47:56,658 INFO L226 Difference]: Without dead ends: 240 [2022-07-20 05:47:56,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=251, Invalid=941, Unknown=6, NotChecked=134, Total=1332 [2022-07-20 05:47:56,659 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 476 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 1787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 816 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:56,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1043 Invalid, 1787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 897 Invalid, 0 Unknown, 816 Unchecked, 0.4s Time] [2022-07-20 05:47:56,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-20 05:47:56,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 132. [2022-07-20 05:47:56,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 131 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2022-07-20 05:47:56,661 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 27 [2022-07-20 05:47:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:56,661 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2022-07-20 05:47:56,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2022-07-20 05:47:56,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:47:56,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:56,662 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] [2022-07-20 05:47:56,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:56,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-20 05:47:56,871 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:56,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:56,872 INFO L85 PathProgramCache]: Analyzing trace with hash 324037283, now seen corresponding path program 1 times [2022-07-20 05:47:56,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:56,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820707709] [2022-07-20 05:47:56,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:56,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:57,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:57,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820707709] [2022-07-20 05:47:57,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820707709] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:57,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776138029] [2022-07-20 05:47:57,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:57,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:57,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:57,042 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:57,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 05:47:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:57,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-20 05:47:57,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:57,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:47:57,155 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:47:57,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:47:57,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:47:57,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:47:57,287 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:57,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:47:57,300 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:47:57,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:47:57,325 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:47:57,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 05:47:57,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:47:57,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:57,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-07-20 05:47:57,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:57,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-20 05:47:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:57,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:57,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_330 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_56| Int)) (or (let ((.cse1 (+ |v_ULTIMATE.start_main_~p~0#1.offset_56| 4))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (and (<= (+ .cse0 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (<= 0 .cse0)))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_56|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_56| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-20 05:47:57,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:57,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-07-20 05:47:57,906 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:57,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-20 05:47:57,914 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:57,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 65 [2022-07-20 05:47:57,924 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:57,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 93 [2022-07-20 05:47:57,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2022-07-20 05:47:57,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-07-20 05:47:57,969 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:57,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-20 05:47:57,971 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:57,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:57,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-20 05:47:58,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:58,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 127 [2022-07-20 05:47:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:58,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776138029] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:58,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:58,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 31 [2022-07-20 05:47:58,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732996715] [2022-07-20 05:47:58,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:58,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-20 05:47:58,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:58,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-20 05:47:58,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=784, Unknown=13, NotChecked=58, Total=992 [2022-07-20 05:47:58,329 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:59,183 INFO L93 Difference]: Finished difference Result 236 states and 264 transitions. [2022-07-20 05:47:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:47:59,184 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 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 27 [2022-07-20 05:47:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:59,185 INFO L225 Difference]: With dead ends: 236 [2022-07-20 05:47:59,185 INFO L226 Difference]: Without dead ends: 236 [2022-07-20 05:47:59,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=401, Invalid=1570, Unknown=13, NotChecked=86, Total=2070 [2022-07-20 05:47:59,186 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 424 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 628 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:59,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1067 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1107 Invalid, 0 Unknown, 628 Unchecked, 0.5s Time] [2022-07-20 05:47:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-20 05:47:59,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 129. [2022-07-20 05:47:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 114 states have (on average 1.3070175438596492) internal successors, (149), 128 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2022-07-20 05:47:59,188 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 27 [2022-07-20 05:47:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:59,188 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2022-07-20 05:47:59,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2022-07-20 05:47:59,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 05:47:59,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:59,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:59,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:59,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:59,399 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:59,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:59,400 INFO L85 PathProgramCache]: Analyzing trace with hash -754040858, now seen corresponding path program 1 times [2022-07-20 05:47:59,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:59,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801890556] [2022-07-20 05:47:59,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:59,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:59,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:59,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801890556] [2022-07-20 05:47:59,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801890556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:59,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:59,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:47:59,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710622047] [2022-07-20 05:47:59,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:59,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:47:59,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:59,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:47:59,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:47:59,473 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:59,626 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2022-07-20 05:47:59,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:47:59,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-20 05:47:59,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:59,628 INFO L225 Difference]: With dead ends: 146 [2022-07-20 05:47:59,628 INFO L226 Difference]: Without dead ends: 134 [2022-07-20 05:47:59,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:47:59,628 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 175 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:59,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 167 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-20 05:47:59,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 117. [2022-07-20 05:47:59,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 116 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2022-07-20 05:47:59,631 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 28 [2022-07-20 05:47:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:59,631 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2022-07-20 05:47:59,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2022-07-20 05:47:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 05:47:59,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:59,632 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] [2022-07-20 05:47:59,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 05:47:59,632 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:47:59,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:59,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1881225996, now seen corresponding path program 1 times [2022-07-20 05:47:59,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:59,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047121750] [2022-07-20 05:47:59,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:59,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:59,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:59,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047121750] [2022-07-20 05:47:59,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047121750] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:59,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443555971] [2022-07-20 05:47:59,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:59,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:59,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:59,771 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:59,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 05:47:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:59,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-20 05:47:59,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:59,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:47:59,932 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:47:59,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:47:59,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:47:59,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:59,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:47:59,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-20 05:48:00,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:48:00,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:48:00,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:48:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:00,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:00,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_410) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-07-20 05:48:00,087 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_410) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-20 05:48:00,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_410) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-07-20 05:48:00,094 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 Int) (v_ArrVal_410 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_405)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_410) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-20 05:48:00,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:00,125 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:00,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-20 05:48:00,132 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-20 05:48:00,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-07-20 05:48:00,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-20 05:48:00,143 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:48:00,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:48:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-20 05:48:00,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443555971] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:00,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:00,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 26 [2022-07-20 05:48:00,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785045064] [2022-07-20 05:48:00,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:00,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 05:48:00,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:00,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 05:48:00,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=367, Unknown=4, NotChecked=172, Total=650 [2022-07-20 05:48:00,181 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:00,508 INFO L93 Difference]: Finished difference Result 195 states and 218 transitions. [2022-07-20 05:48:00,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:48:00,509 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 05:48:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:00,509 INFO L225 Difference]: With dead ends: 195 [2022-07-20 05:48:00,509 INFO L226 Difference]: Without dead ends: 195 [2022-07-20 05:48:00,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=619, Unknown=4, NotChecked=228, Total=1056 [2022-07-20 05:48:00,510 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 343 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 537 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:00,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 457 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 481 Invalid, 0 Unknown, 537 Unchecked, 0.2s Time] [2022-07-20 05:48:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-20 05:48:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 119. [2022-07-20 05:48:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 104 states have (on average 1.3269230769230769) internal successors, (138), 118 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2022-07-20 05:48:00,512 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 29 [2022-07-20 05:48:00,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:00,512 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2022-07-20 05:48:00,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:00,513 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2022-07-20 05:48:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 05:48:00,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:00,513 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] [2022-07-20 05:48:00,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 05:48:00,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-20 05:48:00,723 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:48:00,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1881278551, now seen corresponding path program 1 times [2022-07-20 05:48:00,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:00,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822222467] [2022-07-20 05:48:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:00,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:00,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822222467] [2022-07-20 05:48:00,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822222467] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:00,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191359082] [2022-07-20 05:48:00,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:00,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:00,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:00,869 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:48:00,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 05:48:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:00,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 05:48:00,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:01,000 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 05:48:01,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 05:48:01,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:01,120 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:01,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:48:01,135 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:01,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 05:48:01,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 05:48:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:01,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:01,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_471 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_471) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2022-07-20 05:48:01,263 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_471 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_471) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2022-07-20 05:48:01,267 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_471 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_471) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2022-07-20 05:48:01,274 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:01,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-20 05:48:01,280 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:01,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2022-07-20 05:48:01,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:03,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:03,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 74 treesize of output 228 [2022-07-20 05:48:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-20 05:48:04,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191359082] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:04,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:04,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-07-20 05:48:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534285351] [2022-07-20 05:48:04,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:04,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 05:48:04,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:04,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 05:48:04,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=614, Unknown=3, NotChecked=162, Total=930 [2022-07-20 05:48:04,589 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:05,041 INFO L93 Difference]: Finished difference Result 194 states and 218 transitions. [2022-07-20 05:48:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 05:48:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 05:48:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:05,042 INFO L225 Difference]: With dead ends: 194 [2022-07-20 05:48:05,042 INFO L226 Difference]: Without dead ends: 194 [2022-07-20 05:48:05,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=269, Invalid=930, Unknown=3, NotChecked=204, Total=1406 [2022-07-20 05:48:05,042 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 406 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 634 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:05,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 575 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 724 Invalid, 0 Unknown, 634 Unchecked, 0.3s Time] [2022-07-20 05:48:05,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-20 05:48:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 122. [2022-07-20 05:48:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 121 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2022-07-20 05:48:05,045 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 29 [2022-07-20 05:48:05,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:05,045 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2022-07-20 05:48:05,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:05,045 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2022-07-20 05:48:05,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 05:48:05,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:05,045 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] [2022-07-20 05:48:05,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 05:48:05,255 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,SelfDestructingSolverStorable17 [2022-07-20 05:48:05,256 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:48:05,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1881278552, now seen corresponding path program 1 times [2022-07-20 05:48:05,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:05,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539637206] [2022-07-20 05:48:05,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:05,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:05,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:05,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539637206] [2022-07-20 05:48:05,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539637206] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:05,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355732893] [2022-07-20 05:48:05,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:05,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:05,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:05,452 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:48:05,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 05:48:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:05,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-20 05:48:05,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:05,590 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:05,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:48:05,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:48:05,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:05,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:05,726 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:05,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:48:05,736 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:05,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:48:05,783 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:05,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 05:48:05,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:48:05,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:05,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-07-20 05:48:05,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:05,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-20 05:48:05,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:05,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:06,103 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_69| Int) (v_ArrVal_536 (Array Int Int))) (or (let ((.cse1 (+ |v_ULTIMATE.start_main_~p~0#1.offset_69| 4))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (and (<= 0 .cse0) (<= (+ .cse0 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_69| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_69|)))) is different from false [2022-07-20 05:48:06,372 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:06,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-20 05:48:06,378 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:06,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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 39 [2022-07-20 05:48:06,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:48:06,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:06,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-07-20 05:48:06,404 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:06,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-20 05:48:06,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:06,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:06,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-07-20 05:48:06,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:06,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:06,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-20 05:48:06,586 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:06,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 127 [2022-07-20 05:48:06,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:06,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355732893] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:06,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:06,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 35 [2022-07-20 05:48:06,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068845603] [2022-07-20 05:48:06,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:06,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-20 05:48:06,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:06,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-20 05:48:06,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1015, Unknown=16, NotChecked=66, Total=1260 [2022-07-20 05:48:06,734 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand has 36 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 36 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) [2022-07-20 05:48:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:07,563 INFO L93 Difference]: Finished difference Result 203 states and 227 transitions. [2022-07-20 05:48:07,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:48:07,563 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 36 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 29 [2022-07-20 05:48:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:07,565 INFO L225 Difference]: With dead ends: 203 [2022-07-20 05:48:07,565 INFO L226 Difference]: Without dead ends: 203 [2022-07-20 05:48:07,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=481, Invalid=2159, Unknown=16, NotChecked=100, Total=2756 [2022-07-20 05:48:07,566 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 675 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 529 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:07,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 825 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 927 Invalid, 0 Unknown, 529 Unchecked, 0.4s Time] [2022-07-20 05:48:07,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-20 05:48:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 121. [2022-07-20 05:48:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 106 states have (on average 1.320754716981132) internal successors, (140), 120 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2022-07-20 05:48:07,573 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 29 [2022-07-20 05:48:07,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:07,573 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2022-07-20 05:48:07,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 36 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) [2022-07-20 05:48:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2022-07-20 05:48:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 05:48:07,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:07,574 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] [2022-07-20 05:48:07,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 05:48:07,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:07,788 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:48:07,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:07,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2114552260, now seen corresponding path program 1 times [2022-07-20 05:48:07,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:07,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346748766] [2022-07-20 05:48:07,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:07,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:07,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:07,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346748766] [2022-07-20 05:48:07,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346748766] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:07,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214704701] [2022-07-20 05:48:07,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:07,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:07,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:07,910 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:48:07,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 05:48:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:07,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-20 05:48:07,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:08,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:48:08,052 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:08,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:48:08,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:08,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:48:08,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:08,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-20 05:48:08,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:48:08,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:48:08,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:48:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:08,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:08,213 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_600) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-20 05:48:08,228 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_600) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-20 05:48:08,232 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_600) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-20 05:48:08,237 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array Int Int)) (v_ArrVal_597 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_597)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_600) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-20 05:48:08,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:08,270 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:08,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-20 05:48:08,280 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-20 05:48:08,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-07-20 05:48:08,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-20 05:48:08,292 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:48:08,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:48:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-20 05:48:08,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214704701] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:08,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:08,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 26 [2022-07-20 05:48:08,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890526623] [2022-07-20 05:48:08,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:08,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 05:48:08,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:08,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 05:48:08,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=367, Unknown=4, NotChecked=172, Total=650 [2022-07-20 05:48:08,328 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:08,663 INFO L93 Difference]: Finished difference Result 216 states and 242 transitions. [2022-07-20 05:48:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 05:48:08,663 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 05:48:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:08,664 INFO L225 Difference]: With dead ends: 216 [2022-07-20 05:48:08,664 INFO L226 Difference]: Without dead ends: 216 [2022-07-20 05:48:08,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=619, Unknown=4, NotChecked=228, Total=1056 [2022-07-20 05:48:08,666 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 391 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 752 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:08,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 536 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 473 Invalid, 0 Unknown, 752 Unchecked, 0.2s Time] [2022-07-20 05:48:08,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-20 05:48:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 121. [2022-07-20 05:48:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 106 states have (on average 1.3113207547169812) 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) [2022-07-20 05:48:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2022-07-20 05:48:08,673 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 29 [2022-07-20 05:48:08,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:08,673 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2022-07-20 05:48:08,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2022-07-20 05:48:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 05:48:08,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:08,674 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 05:48:08,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 05:48:08,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:08,879 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:48:08,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:08,879 INFO L85 PathProgramCache]: Analyzing trace with hash -904234728, now seen corresponding path program 2 times [2022-07-20 05:48:08,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:08,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236249224] [2022-07-20 05:48:08,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:08,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:09,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:09,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236249224] [2022-07-20 05:48:09,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236249224] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:09,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731983631] [2022-07-20 05:48:09,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:48:09,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:09,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:09,067 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:48:09,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 05:48:09,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:48:09,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:48:09,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-20 05:48:09,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:09,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:48:09,228 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:09,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:48:09,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:09,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:09,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:48:09,381 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:09,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:48:09,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:48:09,394 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:09,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:48:09,437 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:09,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 71 [2022-07-20 05:48:09,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:09,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-07-20 05:48:09,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-07-20 05:48:09,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:09,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2022-07-20 05:48:09,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:09,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 14 [2022-07-20 05:48:09,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:48:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:09,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:09,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_667 Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~p~0#1.offset_78| 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_666) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= (+ 8 .cse0) (select |c_#length| .cse1))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)) (< 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_667)) .cse1) .cse0)))))) is different from false [2022-07-20 05:48:09,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 458 treesize of output 414 [2022-07-20 05:48:10,434 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:10,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 82 [2022-07-20 05:48:10,439 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:10,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2022-07-20 05:48:10,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:10,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 101 [2022-07-20 05:48:10,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-07-20 05:48:10,463 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:10,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 127 [2022-07-20 05:48:10,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 96 [2022-07-20 05:48:10,769 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:10,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 127 [2022-07-20 05:48:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:11,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731983631] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:11,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:11,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 42 [2022-07-20 05:48:11,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622991806] [2022-07-20 05:48:11,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:11,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-20 05:48:11,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:11,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-20 05:48:11,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1469, Unknown=1, NotChecked=78, Total=1722 [2022-07-20 05:48:11,207 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand has 42 states, 42 states have (on average 2.0) internal successors, (84), 42 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:12,072 INFO L93 Difference]: Finished difference Result 207 states and 229 transitions. [2022-07-20 05:48:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 05:48:12,073 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0) internal successors, (84), 42 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-20 05:48:12,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:12,073 INFO L225 Difference]: With dead ends: 207 [2022-07-20 05:48:12,073 INFO L226 Difference]: Without dead ends: 207 [2022-07-20 05:48:12,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=412, Invalid=2671, Unknown=1, NotChecked=108, Total=3192 [2022-07-20 05:48:12,074 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 399 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 589 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:12,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1276 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1477 Invalid, 0 Unknown, 589 Unchecked, 0.5s Time] [2022-07-20 05:48:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-20 05:48:12,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 123. [2022-07-20 05:48:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 122 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2022-07-20 05:48:12,077 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 31 [2022-07-20 05:48:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:12,077 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2022-07-20 05:48:12,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0) internal successors, (84), 42 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2022-07-20 05:48:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 05:48:12,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:12,078 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] [2022-07-20 05:48:12,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 05:48:12,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-20 05:48:12,278 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:48:12,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:12,278 INFO L85 PathProgramCache]: Analyzing trace with hash 80993154, now seen corresponding path program 1 times [2022-07-20 05:48:12,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:12,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10874548] [2022-07-20 05:48:12,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:12,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:12,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:12,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10874548] [2022-07-20 05:48:12,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10874548] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:12,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046310763] [2022-07-20 05:48:12,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:12,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:12,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:12,480 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:48:12,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 05:48:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:12,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-20 05:48:12,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:12,640 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:12,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:48:12,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:12,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:12,781 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:12,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-20 05:48:12,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:48:12,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:12,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-20 05:48:12,841 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:12,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 64 [2022-07-20 05:48:12,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:12,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-07-20 05:48:12,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-07-20 05:48:12,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-20 05:48:12,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-07-20 05:48:13,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:48:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:13,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:13,197 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_737 Int)) (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_737)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-07-20 05:48:13,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 452 treesize of output 408 [2022-07-20 05:48:13,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:13,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-20 05:48:13,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:13,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2022-07-20 05:48:13,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:48:13,438 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:48:13,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-20 05:48:13,530 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:13,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-07-20 05:48:13,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:13,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046310763] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:13,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:13,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2022-07-20 05:48:13,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15997754] [2022-07-20 05:48:13,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:13,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-20 05:48:13,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:13,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-20 05:48:13,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1469, Unknown=1, NotChecked=78, Total=1722 [2022-07-20 05:48:13,602 INFO L87 Difference]: Start difference. First operand 123 states and 141 transitions. Second operand has 42 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 42 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:14,579 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2022-07-20 05:48:14,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:48:14,580 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 42 states have internal predecessors, (93), 0 states have call successors, (0), 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 [2022-07-20 05:48:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:14,581 INFO L225 Difference]: With dead ends: 206 [2022-07-20 05:48:14,581 INFO L226 Difference]: Without dead ends: 206 [2022-07-20 05:48:14,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=398, Invalid=2467, Unknown=1, NotChecked=104, Total=2970 [2022-07-20 05:48:14,582 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 488 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 469 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:14,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 735 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1176 Invalid, 0 Unknown, 469 Unchecked, 0.5s Time] [2022-07-20 05:48:14,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-20 05:48:14,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 127. [2022-07-20 05:48:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 126 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2022-07-20 05:48:14,584 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 33 [2022-07-20 05:48:14,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:14,584 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2022-07-20 05:48:14,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 42 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:14,584 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2022-07-20 05:48:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 05:48:14,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:14,585 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:48:14,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-20 05:48:14,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:14,785 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:48:14,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:14,785 INFO L85 PathProgramCache]: Analyzing trace with hash 81045709, now seen corresponding path program 2 times [2022-07-20 05:48:14,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:14,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741021146] [2022-07-20 05:48:14,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:14,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:14,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:14,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741021146] [2022-07-20 05:48:14,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741021146] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:14,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146837370] [2022-07-20 05:48:14,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:48:14,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:14,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:14,996 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:48:15,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 05:48:15,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:48:15,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:48:15,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-20 05:48:15,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:15,150 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:15,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:48:15,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:48:15,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:15,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:15,318 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:15,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:48:15,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:48:15,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:48:15,341 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:15,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:48:15,386 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:15,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 71 [2022-07-20 05:48:15,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:15,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-07-20 05:48:15,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 33 [2022-07-20 05:48:15,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2022-07-20 05:48:15,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-20 05:48:15,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:48:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:15,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:15,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_803 (Array Int Int)) (v_ArrVal_804 Int) (v_ArrVal_806 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_803) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (<= (+ 8 .cse0) (select |c_#length| .cse1))) (< 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_804)) .cse1) .cse0)))))) is different from false [2022-07-20 05:48:15,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 182 [2022-07-20 05:48:15,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:15,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 82 [2022-07-20 05:48:15,869 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:15,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2022-07-20 05:48:15,876 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:15,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 101 [2022-07-20 05:48:15,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-07-20 05:48:15,889 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:15,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 127 [2022-07-20 05:48:15,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 96 [2022-07-20 05:48:16,032 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:16,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 78 [2022-07-20 05:48:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:16,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146837370] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:16,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:16,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 40 [2022-07-20 05:48:16,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990483242] [2022-07-20 05:48:16,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:16,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-20 05:48:16,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:16,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-20 05:48:16,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1320, Unknown=1, NotChecked=74, Total=1560 [2022-07-20 05:48:16,108 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand has 40 states, 40 states have (on average 2.25) internal successors, (90), 40 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:16,887 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2022-07-20 05:48:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:48:16,888 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.25) internal successors, (90), 40 states have internal predecessors, (90), 0 states have call successors, (0), 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 [2022-07-20 05:48:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:16,888 INFO L225 Difference]: With dead ends: 180 [2022-07-20 05:48:16,888 INFO L226 Difference]: Without dead ends: 180 [2022-07-20 05:48:16,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=363, Invalid=2292, Unknown=1, NotChecked=100, Total=2756 [2022-07-20 05:48:16,889 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 314 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:16,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 903 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1137 Invalid, 0 Unknown, 346 Unchecked, 0.5s Time] [2022-07-20 05:48:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-20 05:48:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 127. [2022-07-20 05:48:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 126 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2022-07-20 05:48:16,891 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 33 [2022-07-20 05:48:16,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:16,892 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2022-07-20 05:48:16,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.25) internal successors, (90), 40 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2022-07-20 05:48:16,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 05:48:16,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:16,892 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] [2022-07-20 05:48:16,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-20 05:48:17,107 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,SelfDestructingSolverStorable22 [2022-07-20 05:48:17,107 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:48:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:17,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1433810246, now seen corresponding path program 1 times [2022-07-20 05:48:17,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:17,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880011614] [2022-07-20 05:48:17,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:17,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:17,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:17,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880011614] [2022-07-20 05:48:17,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880011614] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:17,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767817425] [2022-07-20 05:48:17,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:17,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:17,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:17,346 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:48:17,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 05:48:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:17,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-20 05:48:17,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:17,497 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:17,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:48:17,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:17,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:17,624 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:17,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-07-20 05:48:17,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:48:17,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:17,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-20 05:48:17,674 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:17,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 80 [2022-07-20 05:48:17,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:17,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2022-07-20 05:48:17,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-07-20 05:48:17,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:17,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-20 05:48:17,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:17,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2022-07-20 05:48:17,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:48:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:17,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:18,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_872 Int) (|v_ULTIMATE.start_main_~p~0#1.offset_94| Int) (v_ArrVal_871 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (or (= 3 (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_94| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_872)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_871) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_874) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_94|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_94| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-20 05:48:18,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 452 treesize of output 408 [2022-07-20 05:48:18,863 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:18,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-20 05:48:18,870 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:18,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2022-07-20 05:48:18,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:48:18,899 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:48:18,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-20 05:48:18,902 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:48:18,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 13 [2022-07-20 05:48:18,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:18,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-20 05:48:18,908 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:48:18,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-07-20 05:48:19,018 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:19,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 127 [2022-07-20 05:48:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:19,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767817425] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:19,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:19,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 45 [2022-07-20 05:48:19,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532918286] [2022-07-20 05:48:19,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:19,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 05:48:19,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:19,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 05:48:19,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1717, Unknown=2, NotChecked=84, Total=1980 [2022-07-20 05:48:19,204 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 45 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:38,302 WARN L233 SmtUtils]: Spent 15.64s on a formula simplification. DAG size of input: 56 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 05:48:38,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:38,855 INFO L93 Difference]: Finished difference Result 196 states and 216 transitions. [2022-07-20 05:48:38,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 05:48:38,855 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 45 states have internal predecessors, (93), 0 states have call successors, (0), 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 [2022-07-20 05:48:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:38,856 INFO L225 Difference]: With dead ends: 196 [2022-07-20 05:48:38,856 INFO L226 Difference]: Without dead ends: 196 [2022-07-20 05:48:38,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=332, Invalid=2748, Unknown=4, NotChecked=108, Total=3192 [2022-07-20 05:48:38,857 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 302 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 704 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:38,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 993 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1143 Invalid, 0 Unknown, 704 Unchecked, 0.4s Time] [2022-07-20 05:48:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-20 05:48:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 129. [2022-07-20 05:48:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 128 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2022-07-20 05:48:38,859 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 33 [2022-07-20 05:48:38,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:38,859 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2022-07-20 05:48:38,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 45 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2022-07-20 05:48:38,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 05:48:38,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:38,860 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] [2022-07-20 05:48:38,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 05:48:39,060 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,SelfDestructingSolverStorable23 [2022-07-20 05:48:39,060 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:48:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:39,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1433757691, now seen corresponding path program 1 times [2022-07-20 05:48:39,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:39,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901679137] [2022-07-20 05:48:39,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:39,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:39,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:39,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901679137] [2022-07-20 05:48:39,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901679137] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:39,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213731383] [2022-07-20 05:48:39,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:39,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:39,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:39,223 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) [2022-07-20 05:48:39,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 05:48:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:39,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-20 05:48:39,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:39,359 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:39,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:48:39,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:48:39,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:39,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:39,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:48:39,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:48:39,545 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:39,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:48:39,580 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:39,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 53 [2022-07-20 05:48:39,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-20 05:48:39,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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 20 [2022-07-20 05:48:39,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:39,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-20 05:48:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:39,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:39,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 288 [2022-07-20 05:48:40,281 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:40,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-20 05:48:40,287 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:40,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2022-07-20 05:48:40,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:40,306 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:40,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 37 [2022-07-20 05:48:40,313 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:40,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 62 [2022-07-20 05:48:40,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-20 05:48:40,381 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:40,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 27 [2022-07-20 05:48:40,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:40,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 47 [2022-07-20 05:48:40,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 05:48:40,681 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:40,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 76 treesize of output 94 [2022-07-20 05:48:40,868 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:40,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-07-20 05:48:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:40,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213731383] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:40,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:40,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 43 [2022-07-20 05:48:40,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020005983] [2022-07-20 05:48:40,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:40,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-20 05:48:40,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:40,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-20 05:48:40,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1634, Unknown=5, NotChecked=0, Total=1806 [2022-07-20 05:48:40,977 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 43 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) [2022-07-20 05:48:41,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:41,936 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2022-07-20 05:48:41,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:48:41,936 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 43 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 33 [2022-07-20 05:48:41,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:41,937 INFO L225 Difference]: With dead ends: 187 [2022-07-20 05:48:41,937 INFO L226 Difference]: Without dead ends: 187 [2022-07-20 05:48:41,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=381, Invalid=2806, Unknown=5, NotChecked=0, Total=3192 [2022-07-20 05:48:41,938 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 347 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 787 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:41,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1289 Invalid, 2109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1264 Invalid, 0 Unknown, 787 Unchecked, 0.5s Time] [2022-07-20 05:48:41,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-20 05:48:41,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 127. [2022-07-20 05:48:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 126 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2022-07-20 05:48:41,940 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 33 [2022-07-20 05:48:41,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:41,940 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2022-07-20 05:48:41,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 43 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) [2022-07-20 05:48:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2022-07-20 05:48:41,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:48:41,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:41,941 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:48:41,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-20 05:48:42,151 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,SelfDestructingSolverStorable24 [2022-07-20 05:48:42,151 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:48:42,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:42,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1588527464, now seen corresponding path program 2 times [2022-07-20 05:48:42,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:42,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936274132] [2022-07-20 05:48:42,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:42,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:42,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:42,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936274132] [2022-07-20 05:48:42,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936274132] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:42,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524057531] [2022-07-20 05:48:42,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:48:42,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:42,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:42,314 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) [2022-07-20 05:48:42,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 05:48:42,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:48:42,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:48:42,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-20 05:48:42,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:42,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:48:42,495 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:42,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:48:42,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:42,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:48:42,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:42,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-20 05:48:42,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:48:42,628 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:42,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:48:42,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:48:42,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:42,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-20 05:48:42,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:48:42,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:48:42,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:48:42,763 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:42,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:42,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-20 05:48:42,809 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-20 05:48:42,812 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_1037) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-20 05:48:42,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1034 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1034) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-20 05:48:42,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_46| Int) (v_ArrVal_1034 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1034) |v_ULTIMATE.start_main_~t~0#1.base_46| v_ArrVal_1037) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_46|) 0)))) is different from false [2022-07-20 05:48:42,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_46| Int) (v_ArrVal_1034 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1034) |v_ULTIMATE.start_main_~t~0#1.base_46| v_ArrVal_1037) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_46|) 0)))) is different from false [2022-07-20 05:48:42,906 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:48:42,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:48:42,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:43,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:43,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2022-07-20 05:48:43,008 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-20 05:48:43,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 64 [2022-07-20 05:48:43,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2022-07-20 05:48:43,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-07-20 05:48:43,021 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:48:43,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:48:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-07-20 05:48:43,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524057531] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:43,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:43,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 42 [2022-07-20 05:48:43,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104678683] [2022-07-20 05:48:43,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:43,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-20 05:48:43,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:43,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-20 05:48:43,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1055, Unknown=17, NotChecked=438, Total=1722 [2022-07-20 05:48:43,070 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 42 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 42 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) [2022-07-20 05:48:44,920 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1034 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1034) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-20 05:48:45,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:45,188 INFO L93 Difference]: Finished difference Result 328 states and 361 transitions. [2022-07-20 05:48:45,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-20 05:48:45,188 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 42 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) Word has length 36 [2022-07-20 05:48:45,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:45,189 INFO L225 Difference]: With dead ends: 328 [2022-07-20 05:48:45,189 INFO L226 Difference]: Without dead ends: 328 [2022-07-20 05:48:45,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=636, Invalid=2890, Unknown=42, NotChecked=854, Total=4422 [2022-07-20 05:48:45,190 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 578 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 2330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1530 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:45,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 787 Invalid, 2330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 670 Invalid, 0 Unknown, 1530 Unchecked, 0.3s Time] [2022-07-20 05:48:45,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-07-20 05:48:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 150. [2022-07-20 05:48:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 135 states have (on average 1.2740740740740741) internal successors, (172), 149 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 172 transitions. [2022-07-20 05:48:45,194 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 172 transitions. Word has length 36 [2022-07-20 05:48:45,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:45,194 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 172 transitions. [2022-07-20 05:48:45,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 42 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) [2022-07-20 05:48:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 172 transitions. [2022-07-20 05:48:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:48:45,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:45,195 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:48:45,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 05:48:45,405 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,SelfDestructingSolverStorable25 [2022-07-20 05:48:45,406 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:48:45,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:45,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1746650192, now seen corresponding path program 1 times [2022-07-20 05:48:45,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:45,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960928858] [2022-07-20 05:48:45,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:45,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:45,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:45,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960928858] [2022-07-20 05:48:45,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960928858] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:45,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210594088] [2022-07-20 05:48:45,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:45,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:45,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:45,629 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) [2022-07-20 05:48:45,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 05:48:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:45,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-20 05:48:45,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:45,767 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:45,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:48:45,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:45,889 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:45,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 26 [2022-07-20 05:48:45,898 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:45,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:48:45,926 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-07-20 05:48:45,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2022-07-20 05:48:46,048 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 05:48:46,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 59 [2022-07-20 05:48:46,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 05:48:46,102 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 05:48:46,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 68 [2022-07-20 05:48:46,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:46,189 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:46,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-07-20 05:48:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:46,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:46,412 INFO L356 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2022-07-20 05:48:46,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-07-20 05:48:46,419 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1128 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_111| Int) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_111|)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1128) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_111|))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_111| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-20 05:48:46,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:46,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:46,620 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:46,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-20 05:48:46,627 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:46,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 89 [2022-07-20 05:48:46,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2022-07-20 05:48:46,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:46,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 60 [2022-07-20 05:48:46,645 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:48:46,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:48:46,869 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:46,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 127 [2022-07-20 05:48:47,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:47,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210594088] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:47,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:47,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 45 [2022-07-20 05:48:47,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019007828] [2022-07-20 05:48:47,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:47,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-20 05:48:47,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:47,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-20 05:48:47,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1758, Unknown=18, NotChecked=86, Total=2070 [2022-07-20 05:48:47,073 INFO L87 Difference]: Start difference. First operand 150 states and 172 transitions. Second operand has 46 states, 45 states have (on average 2.2222222222222223) internal successors, (100), 46 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:48,042 INFO L93 Difference]: Finished difference Result 259 states and 291 transitions. [2022-07-20 05:48:48,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:48:48,043 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.2222222222222223) internal successors, (100), 46 states have internal predecessors, (100), 0 states have call successors, (0), 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 [2022-07-20 05:48:48,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:48,044 INFO L225 Difference]: With dead ends: 259 [2022-07-20 05:48:48,044 INFO L226 Difference]: Without dead ends: 259 [2022-07-20 05:48:48,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=481, Invalid=3045, Unknown=18, NotChecked=116, Total=3660 [2022-07-20 05:48:48,045 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 560 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 2625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1600 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:48,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1230 Invalid, 2625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 903 Invalid, 0 Unknown, 1600 Unchecked, 0.4s Time] [2022-07-20 05:48:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-20 05:48:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 167. [2022-07-20 05:48:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 152 states have (on average 1.269736842105263) internal successors, (193), 166 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) [2022-07-20 05:48:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2022-07-20 05:48:48,047 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 36 [2022-07-20 05:48:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:48,047 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2022-07-20 05:48:48,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.2222222222222223) internal successors, (100), 46 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:48,047 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2022-07-20 05:48:48,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:48:48,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:48,048 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:48:48,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-20 05:48:48,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:48,255 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:48:48,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:48,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1746650191, now seen corresponding path program 1 times [2022-07-20 05:48:48,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:48,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931155227] [2022-07-20 05:48:48,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:48,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:48,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:48,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931155227] [2022-07-20 05:48:48,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931155227] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:48,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2225515] [2022-07-20 05:48:48,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:48,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:48,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:48,551 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) [2022-07-20 05:48:48,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 05:48:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:48,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-20 05:48:48,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:48,704 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:48,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:48:48,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:48,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:48,868 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:48,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-20 05:48:48,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 05:48:48,881 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:48,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-07-20 05:48:48,919 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:48,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:48:48,962 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-07-20 05:48:48,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2022-07-20 05:48:48,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:48,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:48:49,104 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 05:48:49,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 61 [2022-07-20 05:48:49,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 05:48:49,138 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:49,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-20 05:48:49,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 05:48:49,199 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 05:48:49,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 70 [2022-07-20 05:48:49,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:49,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:48:49,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:49,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 05:48:49,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:49,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 05:48:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:49,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:49,441 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1224 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_118| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_118| |c_ULTIMATE.start_main_~a~0#1.offset|)) (let ((.cse1 (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_118|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (and (<= 0 .cse0) (<= (+ .cse0 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_118|)))) is different from false [2022-07-20 05:48:49,767 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:49,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2022-07-20 05:48:50,002 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:50,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:50,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:50,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:50,192 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:50,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:50,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:50,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:50,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:50,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:50,394 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:50,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:50,454 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:50,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:50,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:50,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:50,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:50,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:50,646 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:50,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:50,743 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:50,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:50,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:50,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:50,905 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:50,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:50,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:50,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:51,068 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:51,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:51,081 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:51,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:51,148 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:51,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:51,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:51,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:48:51,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:51,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-20 05:48:51,408 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:51,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 137 [2022-07-20 05:48:51,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2022-07-20 05:48:51,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 94 [2022-07-20 05:48:51,497 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:48:51,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-07-20 05:48:51,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:51,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-20 05:48:51,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:51,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:51,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:51,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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 [2022-07-20 05:48:51,515 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:48:51,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:48:51,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:51,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 127 [2022-07-20 05:48:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:51,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2225515] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:51,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:51,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 19] total 49 [2022-07-20 05:48:51,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513442698] [2022-07-20 05:48:51,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:51,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-20 05:48:51,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:51,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-20 05:48:51,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2070, Unknown=60, NotChecked=94, Total=2450 [2022-07-20 05:48:51,854 INFO L87 Difference]: Start difference. First operand 167 states and 193 transitions. Second operand has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:53,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:53,380 INFO L93 Difference]: Finished difference Result 302 states and 336 transitions. [2022-07-20 05:48:53,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-20 05:48:53,381 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 05:48:53,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:53,382 INFO L225 Difference]: With dead ends: 302 [2022-07-20 05:48:53,382 INFO L226 Difference]: Without dead ends: 302 [2022-07-20 05:48:53,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 1566 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=683, Invalid=4373, Unknown=60, NotChecked=140, Total=5256 [2022-07-20 05:48:53,384 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 517 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 2968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1517 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:53,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1791 Invalid, 2968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1343 Invalid, 0 Unknown, 1517 Unchecked, 0.4s Time] [2022-07-20 05:48:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-07-20 05:48:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 166. [2022-07-20 05:48:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 151 states have (on average 1.2649006622516556) internal successors, (191), 165 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) [2022-07-20 05:48:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 191 transitions. [2022-07-20 05:48:53,402 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 191 transitions. Word has length 36 [2022-07-20 05:48:53,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:53,402 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 191 transitions. [2022-07-20 05:48:53,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 191 transitions. [2022-07-20 05:48:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:48:53,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:53,403 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:48:53,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-20 05:48:53,618 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,SelfDestructingSolverStorable27 [2022-07-20 05:48:53,618 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:48:53,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:53,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1243533416, now seen corresponding path program 3 times [2022-07-20 05:48:53,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:53,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300851700] [2022-07-20 05:48:53,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:53,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:53,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:53,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300851700] [2022-07-20 05:48:53,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300851700] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:53,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705419324] [2022-07-20 05:48:53,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:48:53,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:53,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:53,831 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) [2022-07-20 05:48:53,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 05:48:53,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 05:48:53,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:48:53,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-20 05:48:53,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:53,984 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:53,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:48:53,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:54,051 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:54,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-20 05:48:54,081 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:48:54,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-20 05:48:54,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:54,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2022-07-20 05:48:54,181 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:54,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-07-20 05:48:54,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:48:54,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:48:54,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:48:54,231 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:54,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2022-07-20 05:48:54,234 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-20 05:48:54,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-20 05:48:54,453 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,SelfDestructingSolverStorable28 [2022-07-20 05:48:54,454 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-20 05:48:54,458 INFO L158 Benchmark]: Toolchain (without parser) took 67047.39ms. Allocated memory was 127.9MB in the beginning and 224.4MB in the end (delta: 96.5MB). Free memory was 98.7MB in the beginning and 174.8MB in the end (delta: -76.1MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2022-07-20 05:48:54,458 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory was 63.1MB in the beginning and 63.1MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:48:54,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.80ms. Allocated memory is still 127.9MB. Free memory was 98.4MB in the beginning and 96.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 05:48:54,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.66ms. Allocated memory is still 127.9MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:48:54,458 INFO L158 Benchmark]: Boogie Preprocessor took 42.49ms. Allocated memory is still 127.9MB. Free memory was 94.4MB in the beginning and 92.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:48:54,458 INFO L158 Benchmark]: RCFGBuilder took 320.71ms. Allocated memory is still 127.9MB. Free memory was 92.6MB in the beginning and 74.7MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-20 05:48:54,459 INFO L158 Benchmark]: TraceAbstraction took 66304.77ms. Allocated memory was 127.9MB in the beginning and 224.4MB in the end (delta: 96.5MB). Free memory was 74.4MB in the beginning and 174.8MB in the end (delta: -100.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:48:54,459 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory was 63.1MB in the beginning and 63.1MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.80ms. Allocated memory is still 127.9MB. Free memory was 98.4MB in the beginning and 96.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.66ms. Allocated memory is still 127.9MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.49ms. Allocated memory is still 127.9MB. Free memory was 94.4MB in the beginning and 92.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 320.71ms. Allocated memory is still 127.9MB. Free memory was 92.6MB in the beginning and 74.7MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 66304.77ms. Allocated memory was 127.9MB in the beginning and 224.4MB in the end (delta: 96.5MB). Free memory was 74.4MB in the beginning and 174.8MB in the end (delta: -100.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-20 05:48:54,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/list-ext_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e978ccdde62c7126e7c77a584896efdc6e7afe04b6752d127d7236cecdea192f --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:48:56,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:48:56,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:48:56,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:48:56,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:48:56,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:48:56,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:48:56,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:48:56,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:48:56,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:48:56,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:48:56,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:48:56,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:48:56,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:48:56,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:48:56,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:48:56,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:48:56,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:48:56,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:48:56,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:48:56,362 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:48:56,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:48:56,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:48:56,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:48:56,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:48:56,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:48:56,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:48:56,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:48:56,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:48:56,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:48:56,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:48:56,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:48:56,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:48:56,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:48:56,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:48:56,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:48:56,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:48:56,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:48:56,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:48:56,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:48:56,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:48:56,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:48:56,387 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 05:48:56,409 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:48:56,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:48:56,410 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:48:56,410 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:48:56,411 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:48:56,411 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:48:56,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:48:56,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:48:56,412 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:48:56,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:48:56,413 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:48:56,413 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:48:56,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:48:56,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:48:56,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:48:56,435 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:48:56,435 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:48:56,435 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:48:56,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:48:56,435 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:48:56,435 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 05:48:56,436 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 05:48:56,436 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:48:56,436 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:48:56,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:48:56,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:48:56,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:48:56,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:48:56,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:48:56,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:48:56,437 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 05:48:56,437 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 05:48:56,437 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 05:48:56,437 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e978ccdde62c7126e7c77a584896efdc6e7afe04b6752d127d7236cecdea192f [2022-07-20 05:48:56,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:48:56,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:48:56,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:48:56,739 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:48:56,739 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:48:56,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext_1.i [2022-07-20 05:48:56,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6db1847/8903de3a115d48ceaa66f0235135eb46/FLAG8a341ce79 [2022-07-20 05:48:57,254 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:48:57,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_1.i [2022-07-20 05:48:57,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6db1847/8903de3a115d48ceaa66f0235135eb46/FLAG8a341ce79 [2022-07-20 05:48:57,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6db1847/8903de3a115d48ceaa66f0235135eb46 [2022-07-20 05:48:57,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:48:57,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:48:57,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:48:57,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:48:57,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:48:57,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:48:57" (1/1) ... [2022-07-20 05:48:57,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de59a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:57, skipping insertion in model container [2022-07-20 05:48:57,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:48:57" (1/1) ... [2022-07-20 05:48:57,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:48:57,825 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:48:58,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_1.i[23553,23566] [2022-07-20 05:48:58,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:48:58,082 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:48:58,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_1.i[23553,23566] [2022-07-20 05:48:58,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:48:58,155 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:48:58,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:58 WrapperNode [2022-07-20 05:48:58,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:48:58,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:48:58,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:48:58,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:48:58,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:58" (1/1) ... [2022-07-20 05:48:58,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:58" (1/1) ... [2022-07-20 05:48:58,211 INFO L137 Inliner]: procedures = 127, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 117 [2022-07-20 05:48:58,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:48:58,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:48:58,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:48:58,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:48:58,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:58" (1/1) ... [2022-07-20 05:48:58,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:58" (1/1) ... [2022-07-20 05:48:58,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:58" (1/1) ... [2022-07-20 05:48:58,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:58" (1/1) ... [2022-07-20 05:48:58,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:58" (1/1) ... [2022-07-20 05:48:58,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:58" (1/1) ... [2022-07-20 05:48:58,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:58" (1/1) ... [2022-07-20 05:48:58,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:48:58,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:48:58,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:48:58,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:48:58,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:58" (1/1) ... [2022-07-20 05:48:58,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:48:58,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:58,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 05:48:58,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 05:48:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-20 05:48:58,310 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-20 05:48:58,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 05:48:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:48:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:48:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:48:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:48:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:48:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 05:48:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 05:48:58,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:48:58,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:48:58,418 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:48:58,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:48:58,459 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-20 05:48:58,725 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:48:58,730 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:48:58,730 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-20 05:48:58,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:48:58 BoogieIcfgContainer [2022-07-20 05:48:58,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:48:58,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:48:58,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:48:58,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:48:58,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:48:57" (1/3) ... [2022-07-20 05:48:58,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a919e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:48:58, skipping insertion in model container [2022-07-20 05:48:58,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:58" (2/3) ... [2022-07-20 05:48:58,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a919e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:48:58, skipping insertion in model container [2022-07-20 05:48:58,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:48:58" (3/3) ... [2022-07-20 05:48:58,738 INFO L111 eAbstractionObserver]: Analyzing ICFG list-ext_1.i [2022-07-20 05:48:58,747 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:48:58,747 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-07-20 05:48:58,777 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:48:58,781 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@469de409, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32d44527 [2022-07-20 05:48:58,781 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-07-20 05:48:58,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 47 states have (on average 2.106382978723404) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:58,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:48:58,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:58,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:48:58,789 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:48:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:58,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516551, now seen corresponding path program 1 times [2022-07-20 05:48:58,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:48:58,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76653745] [2022-07-20 05:48:58,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:58,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:48:58,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:48:58,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:48:58,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 05:48:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:58,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:48:58,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:58,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:48:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:58,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:48:58,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:48:58,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76653745] [2022-07-20 05:48:58,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76653745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:48:58,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:48:58,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:48:58,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908091581] [2022-07-20 05:48:58,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:48:58,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:48:58,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:48:58,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:48:58,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:48:58,950 INFO L87 Difference]: Start difference. First operand has 89 states, 47 states have (on average 2.106382978723404) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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) [2022-07-20 05:48:59,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:59,146 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2022-07-20 05:48:59,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:48:59,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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 [2022-07-20 05:48:59,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:59,153 INFO L225 Difference]: With dead ends: 106 [2022-07-20 05:48:59,153 INFO L226 Difference]: Without dead ends: 99 [2022-07-20 05:48:59,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:48:59,156 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 149 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:59,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 55 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:48:59,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-20 05:48:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2022-07-20 05:48:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.75) internal successors, (91), 78 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) [2022-07-20 05:48:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2022-07-20 05:48:59,178 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 6 [2022-07-20 05:48:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:59,179 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2022-07-20 05:48:59,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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) [2022-07-20 05:48:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-07-20 05:48:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:48:59,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:59,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:48:59,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 05:48:59,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:48:59,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:48:59,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:59,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516552, now seen corresponding path program 1 times [2022-07-20 05:48:59,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:48:59,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42018482] [2022-07-20 05:48:59,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:59,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:48:59,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:48:59,393 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:48:59,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 05:48:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:59,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:48:59,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:59,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:48:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:59,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:48:59,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:48:59,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42018482] [2022-07-20 05:48:59,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42018482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:48:59,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:48:59,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:48:59,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484343094] [2022-07-20 05:48:59,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:48:59,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:48:59,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:48:59,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:48:59,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:48:59,499 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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) [2022-07-20 05:48:59,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:59,709 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-07-20 05:48:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:48:59,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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 [2022-07-20 05:48:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:59,711 INFO L225 Difference]: With dead ends: 116 [2022-07-20 05:48:59,711 INFO L226 Difference]: Without dead ends: 116 [2022-07-20 05:48:59,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:48:59,712 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 151 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:59,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 48 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:48:59,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-20 05:48:59,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2022-07-20 05:48:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 98 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:48:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2022-07-20 05:48:59,718 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 6 [2022-07-20 05:48:59,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:59,718 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2022-07-20 05:48:59,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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) [2022-07-20 05:48:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2022-07-20 05:48:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:48:59,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:59,719 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:48:59,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:48:59,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:48:59,926 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:48:59,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:59,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769667, now seen corresponding path program 1 times [2022-07-20 05:48:59,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:48:59,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421520563] [2022-07-20 05:48:59,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:59,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:48:59,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:48:59,929 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:48:59,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 05:49:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:49:00,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:49:00,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:49:00,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:49:00,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:49:00,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-20 05:49:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:49:00,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:49:00,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:49:00,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421520563] [2022-07-20 05:49:00,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421520563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:49:00,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:49:00,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:49:00,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425146455] [2022-07-20 05:49:00,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:49:00,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:49:00,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:49:00,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:49:00,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:49:00,086 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:00,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:49:00,456 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2022-07-20 05:49:00,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:49:00,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 05:49:00,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:49:00,458 INFO L225 Difference]: With dead ends: 142 [2022-07-20 05:49:00,458 INFO L226 Difference]: Without dead ends: 142 [2022-07-20 05:49:00,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:49:00,459 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 105 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:49:00,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 180 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:49:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-20 05:49:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 101. [2022-07-20 05:49:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.52) internal successors, (114), 100 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:00,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2022-07-20 05:49:00,464 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 13 [2022-07-20 05:49:00,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:49:00,464 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2022-07-20 05:49:00,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2022-07-20 05:49:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:49:00,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:49:00,465 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:49:00,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-20 05:49:00,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:49:00,672 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:49:00,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:49:00,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769666, now seen corresponding path program 1 times [2022-07-20 05:49:00,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:49:00,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468303514] [2022-07-20 05:49:00,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:49:00,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:49:00,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:49:00,688 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:49:00,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 05:49:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:49:00,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:49:00,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:49:00,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:49:00,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:49:00,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:49:00,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-20 05:49:00,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 05:49:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:49:00,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:49:00,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:49:00,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468303514] [2022-07-20 05:49:00,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468303514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:49:00,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:49:00,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:49:00,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645715253] [2022-07-20 05:49:00,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:49:00,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:49:00,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:49:00,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:49:00,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:49:00,846 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:01,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:49:01,332 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2022-07-20 05:49:01,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:49:01,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 05:49:01,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:49:01,333 INFO L225 Difference]: With dead ends: 145 [2022-07-20 05:49:01,333 INFO L226 Difference]: Without dead ends: 145 [2022-07-20 05:49:01,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:49:01,334 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 69 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:49:01,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 247 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:49:01,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-20 05:49:01,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 89. [2022-07-20 05:49:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 88 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2022-07-20 05:49:01,338 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 13 [2022-07-20 05:49:01,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:49:01,339 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2022-07-20 05:49:01,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-07-20 05:49:01,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 05:49:01,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:49:01,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:49:01,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 05:49:01,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:49:01,546 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:49:01,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:49:01,546 INFO L85 PathProgramCache]: Analyzing trace with hash 174166817, now seen corresponding path program 1 times [2022-07-20 05:49:01,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:49:01,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106225194] [2022-07-20 05:49:01,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:49:01,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:49:01,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:49:01,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:49:01,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 05:49:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:49:01,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 05:49:01,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:49:01,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:49:01,662 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 05:49:01,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:49:01,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:49:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:49:01,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:49:01,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:49:01,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106225194] [2022-07-20 05:49:01,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106225194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:49:01,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:49:01,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:49:01,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380662642] [2022-07-20 05:49:01,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:49:01,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:49:01,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:49:01,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:49:01,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:49:01,687 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:49:01,990 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2022-07-20 05:49:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:49:01,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 05:49:01,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:49:01,991 INFO L225 Difference]: With dead ends: 177 [2022-07-20 05:49:01,991 INFO L226 Difference]: Without dead ends: 177 [2022-07-20 05:49:01,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:49:01,991 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 116 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:49:01,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 195 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:49:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-20 05:49:01,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 96. [2022-07-20 05:49:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 95 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) [2022-07-20 05:49:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2022-07-20 05:49:01,996 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 14 [2022-07-20 05:49:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:49:01,996 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2022-07-20 05:49:01,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2022-07-20 05:49:01,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 05:49:01,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:49:01,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:49:02,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 05:49:02,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:49:02,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:49:02,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:49:02,198 INFO L85 PathProgramCache]: Analyzing trace with hash 916718725, now seen corresponding path program 1 times [2022-07-20 05:49:02,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:49:02,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262471330] [2022-07-20 05:49:02,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:49:02,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:49:02,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:49:02,201 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:49:02,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 05:49:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:49:02,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:49:02,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:49:02,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:49:02,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:49:02,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-20 05:49:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:49:02,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:49:02,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:49:02,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262471330] [2022-07-20 05:49:02,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262471330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:49:02,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:49:02,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:49:02,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560254048] [2022-07-20 05:49:02,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:49:02,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:49:02,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:49:02,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:49:02,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:49:02,296 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:49:02,611 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2022-07-20 05:49:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:49:02,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 05:49:02,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:49:02,612 INFO L225 Difference]: With dead ends: 124 [2022-07-20 05:49:02,612 INFO L226 Difference]: Without dead ends: 124 [2022-07-20 05:49:02,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:49:02,613 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 98 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:49:02,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 161 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:49:02,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-20 05:49:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 94. [2022-07-20 05:49:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 93 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2022-07-20 05:49:02,617 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 14 [2022-07-20 05:49:02,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:49:02,618 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2022-07-20 05:49:02,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:02,618 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2022-07-20 05:49:02,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 05:49:02,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:49:02,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:49:02,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 05:49:02,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:49:02,825 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:49:02,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:49:02,826 INFO L85 PathProgramCache]: Analyzing trace with hash 916718726, now seen corresponding path program 1 times [2022-07-20 05:49:02,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:49:02,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948956837] [2022-07-20 05:49:02,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:49:02,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:49:02,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:49:02,827 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:49:02,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 05:49:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:49:02,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:49:02,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:49:02,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:49:02,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:49:02,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:49:02,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-20 05:49:02,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 05:49:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:49:02,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:49:02,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:49:02,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948956837] [2022-07-20 05:49:02,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948956837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:49:02,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:49:02,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:49:02,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65145866] [2022-07-20 05:49:02,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:49:02,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:49:02,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:49:02,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:49:02,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:49:02,969 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:49:03,363 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2022-07-20 05:49:03,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:49:03,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 05:49:03,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:49:03,364 INFO L225 Difference]: With dead ends: 122 [2022-07-20 05:49:03,365 INFO L226 Difference]: Without dead ends: 122 [2022-07-20 05:49:03,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:49:03,365 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 61 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:49:03,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 221 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:49:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-20 05:49:03,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 81. [2022-07-20 05:49:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.4) internal successors, (91), 80 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) [2022-07-20 05:49:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2022-07-20 05:49:03,369 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 14 [2022-07-20 05:49:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:49:03,369 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2022-07-20 05:49:03,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2022-07-20 05:49:03,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:49:03,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:49:03,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:49:03,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-20 05:49:03,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:49:03,576 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:49:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:49:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash -177044285, now seen corresponding path program 1 times [2022-07-20 05:49:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:49:03,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137171455] [2022-07-20 05:49:03,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:49:03,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:49:03,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:49:03,580 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:49:03,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 05:49:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:49:03,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:49:03,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:49:03,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:49:03,673 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 05:49:03,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:49:03,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:49:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:49:03,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:49:03,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:49:03,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137171455] [2022-07-20 05:49:03,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137171455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:49:03,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:49:03,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:49:03,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273864516] [2022-07-20 05:49:03,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:49:03,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:49:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:49:03,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:49:03,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:49:03,746 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:49:04,053 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2022-07-20 05:49:04,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:49:04,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 05:49:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:49:04,054 INFO L225 Difference]: With dead ends: 174 [2022-07-20 05:49:04,054 INFO L226 Difference]: Without dead ends: 174 [2022-07-20 05:49:04,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:49:04,055 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 182 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:49:04,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 139 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:49:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-20 05:49:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 85. [2022-07-20 05:49:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.391304347826087) internal successors, (96), 84 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2022-07-20 05:49:04,059 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 16 [2022-07-20 05:49:04,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:49:04,059 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2022-07-20 05:49:04,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2022-07-20 05:49:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:49:04,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:49:04,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:49:04,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-20 05:49:04,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:49:04,268 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:49:04,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:49:04,269 INFO L85 PathProgramCache]: Analyzing trace with hash -176991730, now seen corresponding path program 1 times [2022-07-20 05:49:04,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:49:04,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193669378] [2022-07-20 05:49:04,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:49:04,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:49:04,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:49:04,270 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:49:04,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-20 05:49:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:49:04,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 05:49:04,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:49:04,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:49:04,385 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 05:49:04,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:49:04,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:49:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:49:04,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:49:04,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:49:04,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193669378] [2022-07-20 05:49:04,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193669378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:49:04,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:49:04,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:49:04,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909372629] [2022-07-20 05:49:04,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:49:04,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:49:04,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:49:04,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:49:04,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:49:04,412 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:04,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:49:04,637 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2022-07-20 05:49:04,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:49:04,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 05:49:04,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:49:04,638 INFO L225 Difference]: With dead ends: 145 [2022-07-20 05:49:04,638 INFO L226 Difference]: Without dead ends: 145 [2022-07-20 05:49:04,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:49:04,638 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 93 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:49:04,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 157 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:49:04,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-20 05:49:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 85. [2022-07-20 05:49:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 84 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) [2022-07-20 05:49:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2022-07-20 05:49:04,650 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 16 [2022-07-20 05:49:04,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:49:04,651 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2022-07-20 05:49:04,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2022-07-20 05:49:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:49:04,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:49:04,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:49:04,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-20 05:49:04,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:49:04,858 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:49:04,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:49:04,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1146819433, now seen corresponding path program 1 times [2022-07-20 05:49:04,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:49:04,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984860047] [2022-07-20 05:49:04,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:49:04,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:49:04,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:49:04,860 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:49:04,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-20 05:49:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:49:04,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 05:49:04,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:49:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:49:04,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:49:04,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:49:04,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984860047] [2022-07-20 05:49:04,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984860047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:49:04,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:49:04,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:49:04,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943671463] [2022-07-20 05:49:04,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:49:04,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:49:04,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:49:04,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:49:04,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:49:04,986 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:05,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:49:05,144 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-07-20 05:49:05,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:49:05,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 05:49:05,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:49:05,145 INFO L225 Difference]: With dead ends: 109 [2022-07-20 05:49:05,145 INFO L226 Difference]: Without dead ends: 109 [2022-07-20 05:49:05,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:49:05,146 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 224 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:49:05,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 57 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:49:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-20 05:49:05,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2022-07-20 05:49:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.3661971830985915) 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) [2022-07-20 05:49:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2022-07-20 05:49:05,148 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 20 [2022-07-20 05:49:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:49:05,148 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2022-07-20 05:49:05,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2022-07-20 05:49:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 05:49:05,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:49:05,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:49:05,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-20 05:49:05,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:49:05,356 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:49:05,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:49:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1963929626, now seen corresponding path program 1 times [2022-07-20 05:49:05,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:49:05,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971481348] [2022-07-20 05:49:05,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:49:05,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:49:05,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:49:05,358 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:49:05,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 05:49:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:49:05,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 05:49:05,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:49:05,457 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 05:49:05,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-20 05:49:05,567 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-20 05:49:05,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-20 05:49:05,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:49:05,818 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:49:05,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2022-07-20 05:49:05,851 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:49:05,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 [2022-07-20 05:49:07,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2022-07-20 05:49:08,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:49:08,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:49:10,256 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (_ bv1 1))) is different from false [2022-07-20 05:49:10,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))))) is different from false [2022-07-20 05:49:10,273 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:10,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-20 05:49:10,283 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:10,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2022-07-20 05:49:10,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:49:18,941 WARN L233 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 05:49:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:49:23,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:49:23,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971481348] [2022-07-20 05:49:23,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971481348] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:49:23,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:49:23,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2022-07-20 05:49:23,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562685609] [2022-07-20 05:49:23,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:49:23,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 05:49:23,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:49:23,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 05:49:23,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=8, NotChecked=78, Total=506 [2022-07-20 05:49:23,125 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:49:49,138 INFO L93 Difference]: Finished difference Result 235 states and 257 transitions. [2022-07-20 05:49:49,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 05:49:49,138 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 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 21 [2022-07-20 05:49:49,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:49:49,139 INFO L225 Difference]: With dead ends: 235 [2022-07-20 05:49:49,139 INFO L226 Difference]: Without dead ends: 235 [2022-07-20 05:49:49,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 41.1s TimeCoverageRelationStatistics Valid=204, Invalid=784, Unknown=12, NotChecked=122, Total=1122 [2022-07-20 05:49:49,140 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 263 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 780 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:49:49,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 500 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 562 Invalid, 0 Unknown, 780 Unchecked, 2.0s Time] [2022-07-20 05:49:49,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-20 05:49:49,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 102. [2022-07-20 05:49:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 101 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2022-07-20 05:49:49,144 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 21 [2022-07-20 05:49:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:49:49,144 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2022-07-20 05:49:49,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2022-07-20 05:49:49,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 05:49:49,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:49:49,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:49:49,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-20 05:49:49,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:49:49,352 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:49:49,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:49:49,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1963929625, now seen corresponding path program 1 times [2022-07-20 05:49:49,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:49:49,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621323891] [2022-07-20 05:49:49,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:49:49,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:49:49,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:49:49,354 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:49:49,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-20 05:49:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:49:49,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-20 05:49:49,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:49:49,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:49:49,530 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:49:49,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:49:49,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:49:49,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:49:49,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:49:49,745 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:49:49,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-07-20 05:49:49,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:49:49,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:49:49,781 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:49:49,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-20 05:49:49,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:49:49,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 05:49:49,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:49:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:49:49,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:49:50,225 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2022-07-20 05:49:50,272 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2022-07-20 05:49:50,311 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) v_ArrVal_226) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_226) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_225) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) is different from false [2022-07-20 05:49:50,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:50,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-07-20 05:49:50,333 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:50,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-20 05:49:50,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:50,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 65 [2022-07-20 05:49:50,372 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:50,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 93 [2022-07-20 05:49:50,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-07-20 05:49:50,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-07-20 05:49:50,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:50,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2022-07-20 05:49:50,533 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:50,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2022-07-20 05:49:50,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-20 05:49:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 05:49:51,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:49:51,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621323891] [2022-07-20 05:49:51,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621323891] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:49:51,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:49:51,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-07-20 05:49:51,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973021358] [2022-07-20 05:49:51,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:49:51,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 05:49:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:49:51,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 05:49:51,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=292, Unknown=3, NotChecked=108, Total=462 [2022-07-20 05:49:51,321 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:53,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:49:53,571 INFO L93 Difference]: Finished difference Result 204 states and 222 transitions. [2022-07-20 05:49:53,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 05:49:53,572 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 05:49:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:49:53,572 INFO L225 Difference]: With dead ends: 204 [2022-07-20 05:49:53,572 INFO L226 Difference]: Without dead ends: 204 [2022-07-20 05:49:53,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=261, Invalid=938, Unknown=3, NotChecked=204, Total=1406 [2022-07-20 05:49:53,573 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 478 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 439 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:49:53,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 466 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 769 Invalid, 0 Unknown, 439 Unchecked, 1.3s Time] [2022-07-20 05:49:53,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-20 05:49:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 99. [2022-07-20 05:49:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 98 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2022-07-20 05:49:53,576 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 21 [2022-07-20 05:49:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:49:53,576 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2022-07-20 05:49:53,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:49:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2022-07-20 05:49:53,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 05:49:53,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:49:53,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:49:53,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-20 05:49:53,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:49:53,777 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:49:53,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:49:53,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1140135383, now seen corresponding path program 1 times [2022-07-20 05:49:53,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:49:53,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186418681] [2022-07-20 05:49:53,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:49:53,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:49:53,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:49:53,780 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:49:53,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-20 05:49:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:49:53,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 05:49:53,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:49:53,873 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 05:49:53,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-20 05:49:53,954 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-20 05:49:53,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-20 05:49:54,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:49:54,178 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:49:54,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2022-07-20 05:49:54,205 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:49:54,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 [2022-07-20 05:49:56,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2022-07-20 05:49:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:49:56,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:49:58,509 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))))) is different from false [2022-07-20 05:49:58,564 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) v_ArrVal_260) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))))) is different from false [2022-07-20 05:49:58,570 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:58,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-20 05:49:58,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:58,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2022-07-20 05:49:58,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:50:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 05:50:09,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:50:09,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186418681] [2022-07-20 05:50:09,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186418681] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:50:09,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:50:09,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2022-07-20 05:50:09,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680279679] [2022-07-20 05:50:09,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:50:09,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 05:50:09,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:50:09,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 05:50:09,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=8, NotChecked=78, Total=506 [2022-07-20 05:50:09,790 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:50:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:50:39,728 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2022-07-20 05:50:39,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 05:50:39,729 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 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 21 [2022-07-20 05:50:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:50:39,729 INFO L225 Difference]: With dead ends: 229 [2022-07-20 05:50:39,730 INFO L226 Difference]: Without dead ends: 229 [2022-07-20 05:50:39,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 43.5s TimeCoverageRelationStatistics Valid=279, Invalid=977, Unknown=12, NotChecked=138, Total=1406 [2022-07-20 05:50:39,730 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 428 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 588 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:50:39,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 359 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 500 Invalid, 0 Unknown, 588 Unchecked, 1.9s Time] [2022-07-20 05:50:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-20 05:50:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 115. [2022-07-20 05:50:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 100 states have (on average 1.3) internal successors, (130), 114 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:50:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 130 transitions. [2022-07-20 05:50:39,734 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 130 transitions. Word has length 21 [2022-07-20 05:50:39,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:50:39,734 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 130 transitions. [2022-07-20 05:50:39,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:50:39,734 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 130 transitions. [2022-07-20 05:50:39,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 05:50:39,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:50:39,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:50:39,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-20 05:50:39,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:50:39,943 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:50:39,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:50:39,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1140135384, now seen corresponding path program 1 times [2022-07-20 05:50:39,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:50:39,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880046742] [2022-07-20 05:50:39,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:50:39,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:50:39,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:50:39,945 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:50:39,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-20 05:50:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:50:40,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-20 05:50:40,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:50:40,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:50:40,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:50:40,083 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:50:40,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:50:40,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:50:40,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:50:40,225 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:50:40,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-20 05:50:40,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 05:50:40,242 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:50:40,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-07-20 05:50:40,272 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:50:40,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-20 05:50:40,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:50:40,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 05:50:40,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:50:40,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:50:40,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:50:40,616 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_297 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-20 05:50:40,669 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_297 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-20 05:50:40,690 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) v_ArrVal_298) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_297 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_297) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) is different from false [2022-07-20 05:50:40,703 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:40,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-07-20 05:50:40,710 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:40,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-20 05:50:40,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:40,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 65 [2022-07-20 05:50:40,739 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:40,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 93 [2022-07-20 05:50:40,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-07-20 05:50:40,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-07-20 05:50:40,862 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:40,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2022-07-20 05:50:40,880 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:40,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2022-07-20 05:50:40,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-20 05:50:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 05:50:41,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:50:41,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880046742] [2022-07-20 05:50:41,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880046742] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:50:41,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:50:41,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-07-20 05:50:41,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234128936] [2022-07-20 05:50:41,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:50:41,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 05:50:41,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:50:41,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 05:50:41,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=292, Unknown=3, NotChecked=108, Total=462 [2022-07-20 05:50:41,293 INFO L87 Difference]: Start difference. First operand 115 states and 130 transitions. Second operand has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:50:44,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:50:44,019 INFO L93 Difference]: Finished difference Result 223 states and 245 transitions. [2022-07-20 05:50:44,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:50:44,020 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 05:50:44,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:50:44,021 INFO L225 Difference]: With dead ends: 223 [2022-07-20 05:50:44,021 INFO L226 Difference]: Without dead ends: 223 [2022-07-20 05:50:44,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=261, Invalid=938, Unknown=3, NotChecked=204, Total=1406 [2022-07-20 05:50:44,022 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 314 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 542 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-20 05:50:44,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 630 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1089 Invalid, 0 Unknown, 542 Unchecked, 1.8s Time] [2022-07-20 05:50:44,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-20 05:50:44,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 106. [2022-07-20 05:50:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 91 states have (on average 1.2967032967032968) 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) [2022-07-20 05:50:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2022-07-20 05:50:44,024 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 21 [2022-07-20 05:50:44,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:50:44,024 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2022-07-20 05:50:44,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:50:44,024 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2022-07-20 05:50:44,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 05:50:44,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:50:44,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:50:44,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-20 05:50:44,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:50:44,225 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:50:44,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:50:44,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1713113812, now seen corresponding path program 1 times [2022-07-20 05:50:44,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:50:44,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707010549] [2022-07-20 05:50:44,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:50:44,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:50:44,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:50:44,227 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:50:44,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-20 05:50:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:50:44,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 05:50:44,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:50:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:50:44,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:50:44,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:50:44,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707010549] [2022-07-20 05:50:44,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707010549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:50:44,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:50:44,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:50:44,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397599780] [2022-07-20 05:50:44,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:50:44,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:50:44,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:50:44,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:50:44,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:50:44,367 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:50:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:50:44,368 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2022-07-20 05:50:44,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:50:44,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-20 05:50:44,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:50:44,369 INFO L225 Difference]: With dead ends: 114 [2022-07-20 05:50:44,369 INFO L226 Difference]: Without dead ends: 110 [2022-07-20 05:50:44,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:50:44,370 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 3 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:50:44,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 134 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 72 Unchecked, 0.0s Time] [2022-07-20 05:50:44,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-20 05:50:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-07-20 05:50:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 108 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:50:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2022-07-20 05:50:44,372 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 22 [2022-07-20 05:50:44,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:50:44,372 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2022-07-20 05:50:44,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:50:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2022-07-20 05:50:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 05:50:44,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:50:44,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:50:44,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-20 05:50:44,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:50:44,579 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:50:44,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:50:44,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1893358520, now seen corresponding path program 1 times [2022-07-20 05:50:44,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:50:44,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005771589] [2022-07-20 05:50:44,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:50:44,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:50:44,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:50:44,582 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:50:44,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-20 05:50:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:50:44,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 05:50:44,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:50:44,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:50:44,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:50:44,745 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:50:44,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:50:44,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:50:44,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:50:44,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:50:44,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-20 05:50:44,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:50:44,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:50:44,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:50:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:50:44,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:50:44,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-20 05:50:44,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-20 05:50:44,936 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-20 05:50:44,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|) v_ArrVal_347)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) is different from false [2022-07-20 05:50:45,016 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-20 05:50:45,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-20 05:50:45,024 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:45,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-20 05:50:45,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-20 05:50:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 05:50:45,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:50:45,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005771589] [2022-07-20 05:50:45,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005771589] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:50:45,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:50:45,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2022-07-20 05:50:45,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263387486] [2022-07-20 05:50:45,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:50:45,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 05:50:45,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:50:45,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 05:50:45,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=144, Unknown=5, NotChecked=108, Total=306 [2022-07-20 05:50:45,093 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:50:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:50:45,711 INFO L93 Difference]: Finished difference Result 192 states and 215 transitions. [2022-07-20 05:50:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:50:45,712 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 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 23 [2022-07-20 05:50:45,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:50:45,712 INFO L225 Difference]: With dead ends: 192 [2022-07-20 05:50:45,712 INFO L226 Difference]: Without dead ends: 192 [2022-07-20 05:50:45,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=294, Unknown=5, NotChecked=156, Total=552 [2022-07-20 05:50:45,713 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 127 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 522 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:50:45,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 417 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 522 Unchecked, 0.5s Time] [2022-07-20 05:50:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-20 05:50:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 117. [2022-07-20 05:50:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 116 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:50:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2022-07-20 05:50:45,716 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 23 [2022-07-20 05:50:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:50:45,716 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2022-07-20 05:50:45,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:50:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2022-07-20 05:50:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 05:50:45,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:50:45,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:50:45,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-20 05:50:45,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:50:45,924 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:50:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:50:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1893305965, now seen corresponding path program 1 times [2022-07-20 05:50:45,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:50:45,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373878022] [2022-07-20 05:50:45,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:50:45,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:50:45,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:50:45,927 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:50:45,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-20 05:50:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:50:46,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 05:50:46,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:50:46,049 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 05:50:46,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-20 05:50:46,148 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-20 05:50:46,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-20 05:50:46,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:50:46,366 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:50:46,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2022-07-20 05:50:46,386 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:50:46,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 [2022-07-20 05:50:48,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2022-07-20 05:50:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:50:48,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:50:52,874 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:52,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-20 05:50:52,882 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:52,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2022-07-20 05:50:52,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:50:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:50:59,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:50:59,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373878022] [2022-07-20 05:50:59,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373878022] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:50:59,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:50:59,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2022-07-20 05:50:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7372779] [2022-07-20 05:50:59,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:50:59,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 05:50:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:50:59,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 05:50:59,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=420, Unknown=9, NotChecked=0, Total=506 [2022-07-20 05:50:59,373 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:00,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 05:51:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:11,637 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2022-07-20 05:51:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:51:11,638 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 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 23 [2022-07-20 05:51:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:11,638 INFO L225 Difference]: With dead ends: 131 [2022-07-20 05:51:11,638 INFO L226 Difference]: Without dead ends: 131 [2022-07-20 05:51:11,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=210, Invalid=901, Unknown=11, NotChecked=0, Total=1122 [2022-07-20 05:51:11,639 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 172 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 365 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:11,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 307 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 318 Invalid, 0 Unknown, 365 Unchecked, 1.7s Time] [2022-07-20 05:51:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-20 05:51:11,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2022-07-20 05:51:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 105 states have (on average 1.2857142857142858) 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) [2022-07-20 05:51:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2022-07-20 05:51:11,641 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 23 [2022-07-20 05:51:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:11,641 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2022-07-20 05:51:11,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2022-07-20 05:51:11,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 05:51:11,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:11,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:11,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-20 05:51:11,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:51:11,843 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:51:11,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1893305964, now seen corresponding path program 1 times [2022-07-20 05:51:11,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:51:11,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064744701] [2022-07-20 05:51:11,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:11,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:51:11,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:51:11,856 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:51:11,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-20 05:51:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:11,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-20 05:51:11,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:11,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:51:12,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:51:12,023 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:51:12,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:51:12,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:51:12,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:51:12,166 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:51:12,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-07-20 05:51:12,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:51:12,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:51:12,193 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:51:12,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-20 05:51:12,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:51:12,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 05:51:12,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:51:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:12,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:12,572 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_424 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_424 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2022-07-20 05:51:12,608 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_424 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_424 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2022-07-20 05:51:12,630 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_424 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_424 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) is different from false [2022-07-20 05:51:12,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:51:12,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-07-20 05:51:12,654 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:51:12,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-20 05:51:12,666 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:51:12,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 65 [2022-07-20 05:51:12,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:51:12,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 93 [2022-07-20 05:51:12,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-07-20 05:51:12,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-07-20 05:51:12,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:51:12,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2022-07-20 05:51:12,815 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:51:12,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2022-07-20 05:51:12,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-20 05:51:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 05:51:13,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:51:13,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064744701] [2022-07-20 05:51:13,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064744701] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:13,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:51:13,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-07-20 05:51:13,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147317548] [2022-07-20 05:51:13,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:13,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 05:51:13,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:51:13,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 05:51:13,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=292, Unknown=3, NotChecked=108, Total=462 [2022-07-20 05:51:13,168 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:51:15,583 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2022-07-20 05:51:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:51:15,584 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 05:51:15,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:51:15,584 INFO L225 Difference]: With dead ends: 215 [2022-07-20 05:51:15,584 INFO L226 Difference]: Without dead ends: 215 [2022-07-20 05:51:15,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=249, Invalid=882, Unknown=3, NotChecked=198, Total=1332 [2022-07-20 05:51:15,585 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 442 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 514 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:15,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 507 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 883 Invalid, 0 Unknown, 514 Unchecked, 1.5s Time] [2022-07-20 05:51:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-20 05:51:15,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 119. [2022-07-20 05:51:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 118 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2022-07-20 05:51:15,587 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 23 [2022-07-20 05:51:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:51:15,587 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2022-07-20 05:51:15,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2022-07-20 05:51:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 05:51:15,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:51:15,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:51:15,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-20 05:51:15,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:51:15,788 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-07-20 05:51:15,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:51:15,789 INFO L85 PathProgramCache]: Analyzing trace with hash 405811705, now seen corresponding path program 1 times [2022-07-20 05:51:15,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:51:15,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126891545] [2022-07-20 05:51:15,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:51:15,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:51:15,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:51:15,790 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:51:15,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-20 05:51:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:51:15,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 05:51:15,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:51:15,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:51:15,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:51:15,933 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:51:15,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:51:15,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:51:15,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:51:15,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:51:15,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-20 05:51:16,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:51:16,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:51:16,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:51:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:51:16,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:51:16,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-20 05:51:16,091 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2022-07-20 05:51:16,097 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2022-07-20 05:51:16,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|) v_ArrVal_457)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2022-07-20 05:51:16,167 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-20 05:51:16,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-20 05:51:16,176 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:51:16,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-20 05:51:16,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-20 05:51:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 05:51:16,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:51:16,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126891545] [2022-07-20 05:51:16,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126891545] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:51:16,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:51:16,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2022-07-20 05:51:16,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705062871] [2022-07-20 05:51:16,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:51:16,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 05:51:16,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:51:16,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 05:51:16,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=144, Unknown=5, NotChecked=108, Total=306 [2022-07-20 05:51:16,246 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:51:26,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:51:26,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=119, Invalid=309, Unknown=8, NotChecked=164, Total=600 [2022-07-20 05:51:26,349 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 145 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:51:26,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 171 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 248 Invalid, 0 Unknown, 393 Unchecked, 0.3s Time] [2022-07-20 05:51:26,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-20 05:51:26,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:51:26,550 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at most one deprecated predicate at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-20 05:51:26,553 INFO L158 Benchmark]: Toolchain (without parser) took 148779.86ms. Allocated memory was 62.9MB in the beginning and 113.2MB in the end (delta: 50.3MB). Free memory was 42.7MB in the beginning and 83.0MB in the end (delta: -40.3MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-07-20 05:51:26,553 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 62.9MB. Free memory was 45.5MB in the beginning and 45.5MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:51:26,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.62ms. Allocated memory is still 62.9MB. Free memory was 42.5MB in the beginning and 38.4MB in the end (delta: 4.1MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-07-20 05:51:26,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.19ms. Allocated memory is still 62.9MB. Free memory was 38.2MB in the beginning and 36.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:51:26,553 INFO L158 Benchmark]: Boogie Preprocessor took 45.92ms. Allocated memory is still 62.9MB. Free memory was 36.1MB in the beginning and 34.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:51:26,554 INFO L158 Benchmark]: RCFGBuilder took 473.03ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 34.3MB in the beginning and 46.4MB in the end (delta: -12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 05:51:26,554 INFO L158 Benchmark]: TraceAbstraction took 147819.44ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 46.0MB in the beginning and 83.0MB in the end (delta: -36.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:51:26,555 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 62.9MB. Free memory was 45.5MB in the beginning and 45.5MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.62ms. Allocated memory is still 62.9MB. Free memory was 42.5MB in the beginning and 38.4MB in the end (delta: 4.1MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.19ms. Allocated memory is still 62.9MB. Free memory was 38.2MB in the beginning and 36.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.92ms. Allocated memory is still 62.9MB. Free memory was 36.1MB in the beginning and 34.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.03ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 34.3MB in the beginning and 46.4MB in the end (delta: -12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 147819.44ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 46.0MB in the beginning and 83.0MB in the end (delta: -36.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at most one deprecated predicate de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at most one deprecated predicate: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-20 05:51:26,768 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-20 05:51:26,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: at most one deprecated predicate