./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.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 cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:14:59,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:14:59,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:14:59,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:14:59,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:14:59,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:14:59,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:14:59,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:14:59,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:14:59,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:14:59,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:14:59,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:14:59,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:14:59,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:14:59,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:14:59,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:14:59,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:14:59,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:14:59,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:14:59,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:14:59,701 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:14:59,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:14:59,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:14:59,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:14:59,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:14:59,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:14:59,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:14:59,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:14:59,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:14:59,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:14:59,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:14:59,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:14:59,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:14:59,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:14:59,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:14:59,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:14:59,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:14:59,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:14:59,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:14:59,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:14:59,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:14:59,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:14:59,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:14:59,741 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:14:59,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:14:59,742 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:14:59,742 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:14:59,742 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:14:59,743 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:14:59,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:14:59,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:14:59,743 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:14:59,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:14:59,744 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:14:59,744 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:14:59,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:14:59,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:14:59,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:14:59,745 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:14:59,745 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:14:59,745 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:14:59,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:14:59,745 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:14:59,746 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:14:59,746 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:14:59,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:14:59,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:14:59,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:14:59,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:14:59,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:14:59,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:14:59,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:14:59,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:14:59,747 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 -> cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 [2022-07-12 19:14:59,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:14:59,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:14:59,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:14:59,971 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:14:59,971 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:14:59,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2022-07-12 19:15:00,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac611b90/86907a98d6f0468dade442a285f02faf/FLAG2a902c4a6 [2022-07-12 19:15:00,474 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:15:00,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2022-07-12 19:15:00,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac611b90/86907a98d6f0468dade442a285f02faf/FLAG2a902c4a6 [2022-07-12 19:15:00,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac611b90/86907a98d6f0468dade442a285f02faf [2022-07-12 19:15:00,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:15:00,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:15:00,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:15:00,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:15:00,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:15:00,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:15:00" (1/1) ... [2022-07-12 19:15:00,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6185e8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:00, skipping insertion in model container [2022-07-12 19:15:00,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:15:00" (1/1) ... [2022-07-12 19:15:00,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:15:00,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:15:00,827 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-simple/dll2n_update_all_reverse.i[24473,24486] [2022-07-12 19:15:00,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:15:00,839 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:15:00,867 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-simple/dll2n_update_all_reverse.i[24473,24486] [2022-07-12 19:15:00,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:15:00,886 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:15:00,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:00 WrapperNode [2022-07-12 19:15:00,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:15:00,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:15:00,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:15:00,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:15:00,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:00" (1/1) ... [2022-07-12 19:15:00,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:00" (1/1) ... [2022-07-12 19:15:00,946 INFO L137 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2022-07-12 19:15:00,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:15:00,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:15:00,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:15:00,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:15:00,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:00" (1/1) ... [2022-07-12 19:15:00,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:00" (1/1) ... [2022-07-12 19:15:00,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:00" (1/1) ... [2022-07-12 19:15:00,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:00" (1/1) ... [2022-07-12 19:15:00,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:00" (1/1) ... [2022-07-12 19:15:00,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:00" (1/1) ... [2022-07-12 19:15:00,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:00" (1/1) ... [2022-07-12 19:15:00,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:15:00,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:15:00,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:15:00,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:15:00,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:00" (1/1) ... [2022-07-12 19:15:00,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:15:00,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:01,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 19:15:01,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 19:15:01,033 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-12 19:15:01,033 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-12 19:15:01,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 19:15:01,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:15:01,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:15:01,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:15:01,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:15:01,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:15:01,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:15:01,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:15:01,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:15:01,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:15:01,119 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:15:01,123 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:15:01,149 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-12 19:15:01,327 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:15:01,333 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:15:01,333 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 19:15:01,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:15:01 BoogieIcfgContainer [2022-07-12 19:15:01,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:15:01,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:15:01,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:15:01,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:15:01,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:15:00" (1/3) ... [2022-07-12 19:15:01,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4883d99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:15:01, skipping insertion in model container [2022-07-12 19:15:01,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:00" (2/3) ... [2022-07-12 19:15:01,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4883d99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:15:01, skipping insertion in model container [2022-07-12 19:15:01,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:15:01" (3/3) ... [2022-07-12 19:15:01,343 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2022-07-12 19:15:01,353 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:15:01,353 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-07-12 19:15:01,380 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:15:01,384 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@22329af1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@26f550eb [2022-07-12 19:15:01,385 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-07-12 19:15:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 19:15:01,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:01,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 19:15:01,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:01,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:01,399 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-07-12 19:15:01,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:01,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273572550] [2022-07-12 19:15:01,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:01,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:01,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273572550] [2022-07-12 19:15:01,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273572550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:01,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:01,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:15:01,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071733431] [2022-07-12 19:15:01,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:01,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:15:01,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:01,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:15:01,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:01,594 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:01,685 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-07-12 19:15:01,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:15:01,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 19:15:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:01,694 INFO L225 Difference]: With dead ends: 111 [2022-07-12 19:15:01,694 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 19:15:01,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:01,698 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:01,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:15:01,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 19:15:01,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-07-12 19:15:01,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-07-12 19:15:01,730 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2022-07-12 19:15:01,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:01,731 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-07-12 19:15:01,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,731 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-07-12 19:15:01,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 19:15:01,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:01,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 19:15:01,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:15:01,732 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:01,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:01,733 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-07-12 19:15:01,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:01,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19174945] [2022-07-12 19:15:01,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:01,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:01,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:01,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19174945] [2022-07-12 19:15:01,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19174945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:01,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:01,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:15:01,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501460426] [2022-07-12 19:15:01,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:01,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:15:01,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:01,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:15:01,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:01,800 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:01,904 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-07-12 19:15:01,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:15:01,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 19:15:01,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:01,907 INFO L225 Difference]: With dead ends: 101 [2022-07-12 19:15:01,907 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 19:15:01,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:01,912 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:01,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:15:01,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 19:15:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2022-07-12 19:15:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-07-12 19:15:01,924 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2022-07-12 19:15:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:01,927 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-07-12 19:15:01,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-07-12 19:15:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 19:15:01,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:01,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:01,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:15:01,929 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:01,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:01,932 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2022-07-12 19:15:01,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:01,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647378143] [2022-07-12 19:15:01,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:01,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:01,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:01,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647378143] [2022-07-12 19:15:01,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647378143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:01,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:01,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:15:01,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54446670] [2022-07-12 19:15:01,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:01,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:15:01,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:01,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:15:01,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:01,956 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:01,964 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-07-12 19:15:01,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:15:01,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 19:15:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:01,965 INFO L225 Difference]: With dead ends: 66 [2022-07-12 19:15:01,965 INFO L226 Difference]: Without dead ends: 66 [2022-07-12 19:15:01,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:01,966 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:01,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:01,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-12 19:15:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2022-07-12 19:15:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2022-07-12 19:15:01,972 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2022-07-12 19:15:01,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:01,972 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2022-07-12 19:15:01,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-07-12 19:15:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:15:01,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:01,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:01,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:15:01,974 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:01,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:01,974 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-07-12 19:15:01,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:01,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633896114] [2022-07-12 19:15:01,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:01,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:02,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:02,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633896114] [2022-07-12 19:15:02,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633896114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:02,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:02,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:15:02,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118789444] [2022-07-12 19:15:02,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:02,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:15:02,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:02,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:15:02,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:02,047 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:02,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:02,058 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-07-12 19:15:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:15:02,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 19:15:02,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:02,059 INFO L225 Difference]: With dead ends: 63 [2022-07-12 19:15:02,059 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 19:15:02,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:02,060 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:02,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 19:15:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-07-12 19:15:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-07-12 19:15:02,064 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2022-07-12 19:15:02,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:02,064 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-07-12 19:15:02,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:02,065 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-07-12 19:15:02,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:15:02,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:02,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:02,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:15:02,066 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:02,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:02,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2022-07-12 19:15:02,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:02,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941086591] [2022-07-12 19:15:02,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:02,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:02,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:02,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941086591] [2022-07-12 19:15:02,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941086591] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:02,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146114433] [2022-07-12 19:15:02,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:02,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:02,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:02,129 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:15:02,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 19:15:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:02,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:15:02,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:02,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:02,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146114433] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:02,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:02,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-12 19:15:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464002160] [2022-07-12 19:15:02,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:02,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:15:02,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:02,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:15:02,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:15:02,304 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:02,319 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-07-12 19:15:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:15:02,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 19:15:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:02,322 INFO L225 Difference]: With dead ends: 64 [2022-07-12 19:15:02,322 INFO L226 Difference]: Without dead ends: 64 [2022-07-12 19:15:02,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:15:02,328 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:02,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 167 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-12 19:15:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-07-12 19:15:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 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-12 19:15:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-07-12 19:15:02,331 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2022-07-12 19:15:02,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:02,331 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-07-12 19:15:02,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-07-12 19:15:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:15:02,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:02,346 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:02,366 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-12 19:15:02,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:02,563 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:02,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:02,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-07-12 19:15:02,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:02,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709993818] [2022-07-12 19:15:02,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:02,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:02,636 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-12 19:15:02,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:02,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709993818] [2022-07-12 19:15:02,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709993818] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:02,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014351010] [2022-07-12 19:15:02,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:02,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:02,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:02,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:15:02,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 19:15:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:02,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 19:15:02,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:02,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:02,770 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:15:02,771 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-12 19:15:02,781 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-12 19:15:02,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:02,916 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-12 19:15:02,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014351010] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:02,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:02,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-07-12 19:15:02,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171451770] [2022-07-12 19:15:02,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:02,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:02,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:02,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:02,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:02,920 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:02,961 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-07-12 19:15:02,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:15:02,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 19:15:02,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:02,962 INFO L225 Difference]: With dead ends: 77 [2022-07-12 19:15:02,962 INFO L226 Difference]: Without dead ends: 77 [2022-07-12 19:15:02,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:15:02,964 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 266 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:02,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 66 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-07-12 19:15:02,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-12 19:15:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-07-12 19:15:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 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-12 19:15:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-07-12 19:15:02,970 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2022-07-12 19:15:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:02,970 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-07-12 19:15:02,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-07-12 19:15:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:15:02,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:02,971 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:02,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:03,188 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,SelfDestructingSolverStorable5 [2022-07-12 19:15:03,188 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:03,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-07-12 19:15:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:03,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481366743] [2022-07-12 19:15:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:03,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:03,282 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-12 19:15:03,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:03,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481366743] [2022-07-12 19:15:03,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481366743] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:03,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930990912] [2022-07-12 19:15:03,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:03,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:03,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:03,284 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:15:03,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 19:15:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:03,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:15:03,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:03,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:03,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:03,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:03,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:15:03,409 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:15:03,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:15:03,425 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-12 19:15:03,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:03,601 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-12 19:15:03,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930990912] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:03,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:03,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-07-12 19:15:03,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493433947] [2022-07-12 19:15:03,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:03,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:15:03,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:03,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:15:03,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:15:03,604 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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-12 19:15:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:03,672 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-07-12 19:15:03,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:15:03,673 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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 16 [2022-07-12 19:15:03,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:03,673 INFO L225 Difference]: With dead ends: 76 [2022-07-12 19:15:03,673 INFO L226 Difference]: Without dead ends: 76 [2022-07-12 19:15:03,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:15:03,674 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 294 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:03,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 67 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-07-12 19:15:03,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-12 19:15:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-07-12 19:15:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-07-12 19:15:03,677 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2022-07-12 19:15:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:03,677 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-07-12 19:15:03,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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-12 19:15:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-07-12 19:15:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:15:03,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:03,678 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:03,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:03,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:03,884 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:03,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:03,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2022-07-12 19:15:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:03,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064278189] [2022-07-12 19:15:03,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:03,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:03,924 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-12 19:15:03,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:03,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064278189] [2022-07-12 19:15:03,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064278189] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:03,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081375347] [2022-07-12 19:15:03,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:15:03,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:03,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:03,931 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:15:03,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 19:15:04,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:15:04,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:15:04,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:15:04,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:04,014 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-12 19:15:04,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:04,026 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-12 19:15:04,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081375347] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:04,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:04,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-07-12 19:15:04,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147483541] [2022-07-12 19:15:04,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:04,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:15:04,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:04,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:15:04,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:15:04,028 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-12 19:15:04,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:04,045 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-07-12 19:15:04,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:15:04,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-12 19:15:04,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:04,046 INFO L225 Difference]: With dead ends: 62 [2022-07-12 19:15:04,046 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 19:15:04,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:15:04,047 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:04,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 19:15:04,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-12 19:15:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-07-12 19:15:04,049 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 22 [2022-07-12 19:15:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:04,049 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-07-12 19:15:04,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-12 19:15:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-07-12 19:15:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 19:15:04,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:04,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:04,069 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-12 19:15:04,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:04,260 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:04,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:04,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022382, now seen corresponding path program 1 times [2022-07-12 19:15:04,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:04,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652675144] [2022-07-12 19:15:04,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:04,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:15:04,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:04,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652675144] [2022-07-12 19:15:04,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652675144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:04,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:04,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:15:04,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863394500] [2022-07-12 19:15:04,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:04,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:04,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:04,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:04,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:04,317 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:04,426 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-07-12 19:15:04,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:15:04,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 19:15:04,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:04,427 INFO L225 Difference]: With dead ends: 113 [2022-07-12 19:15:04,427 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 19:15:04,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:15:04,428 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 259 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:04,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 123 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:15:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 19:15:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 65. [2022-07-12 19:15:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-12 19:15:04,431 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 23 [2022-07-12 19:15:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:04,431 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-12 19:15:04,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-12 19:15:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 19:15:04,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:04,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:04,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 19:15:04,432 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:04,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:04,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022381, now seen corresponding path program 1 times [2022-07-12 19:15:04,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:04,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261961962] [2022-07-12 19:15:04,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:04,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:15:04,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:04,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261961962] [2022-07-12 19:15:04,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261961962] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:04,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:04,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:15:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155315629] [2022-07-12 19:15:04,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:04,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:04,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:04,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:04,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:04,515 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:04,631 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-07-12 19:15:04,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:15:04,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 19:15:04,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:04,632 INFO L225 Difference]: With dead ends: 100 [2022-07-12 19:15:04,632 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 19:15:04,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:15:04,633 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:04,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:15:04,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 19:15:04,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2022-07-12 19:15:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 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-12 19:15:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-07-12 19:15:04,638 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 23 [2022-07-12 19:15:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:04,639 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-07-12 19:15:04,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-07-12 19:15:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:15:04,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:04,641 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:04,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 19:15:04,642 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:04,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:04,642 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2022-07-12 19:15:04,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:04,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032371885] [2022-07-12 19:15:04,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:04,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:15:04,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:04,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032371885] [2022-07-12 19:15:04,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032371885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:04,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:04,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:15:04,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183261953] [2022-07-12 19:15:04,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:04,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:04,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:04,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:04,702 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:04,802 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-07-12 19:15:04,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:15:04,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-12 19:15:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:04,803 INFO L225 Difference]: With dead ends: 100 [2022-07-12 19:15:04,804 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 19:15:04,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:15:04,804 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 243 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:04,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 106 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:15:04,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 19:15:04,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 68. [2022-07-12 19:15:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-12 19:15:04,816 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 25 [2022-07-12 19:15:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:04,816 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-12 19:15:04,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-12 19:15:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:15:04,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:04,820 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:04,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 19:15:04,820 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:04,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:04,820 INFO L85 PathProgramCache]: Analyzing trace with hash -244809886, now seen corresponding path program 1 times [2022-07-12 19:15:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:04,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316318453] [2022-07-12 19:15:04,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:04,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:15:04,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:04,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316318453] [2022-07-12 19:15:04,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316318453] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:04,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26099173] [2022-07-12 19:15:04,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:04,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:04,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:04,884 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-12 19:15:04,885 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-12 19:15:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:04,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:15:04,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:15:04,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:15:04,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26099173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:04,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:15:04,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-12 19:15:04,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657195380] [2022-07-12 19:15:04,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:04,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:15:04,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:04,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:15:04,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:15:04,983 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:04,995 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-07-12 19:15:04,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:15:04,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-12 19:15:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:04,996 INFO L225 Difference]: With dead ends: 65 [2022-07-12 19:15:04,996 INFO L226 Difference]: Without dead ends: 65 [2022-07-12 19:15:04,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:15:04,996 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:04,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 62 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-12 19:15:04,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2022-07-12 19:15:04,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-07-12 19:15:04,998 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 25 [2022-07-12 19:15:04,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:04,998 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-07-12 19:15:04,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-07-12 19:15:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:15:04,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:04,999 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:05,032 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-12 19:15:05,216 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,SelfDestructingSolverStorable11 [2022-07-12 19:15:05,216 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:05,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689078, now seen corresponding path program 1 times [2022-07-12 19:15:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:05,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641771186] [2022-07-12 19:15:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:15:05,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:05,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641771186] [2022-07-12 19:15:05,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641771186] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:05,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129090410] [2022-07-12 19:15:05,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:05,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:05,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:05,275 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-12 19:15:05,277 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-12 19:15:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:05,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:15:05,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:15:05,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:15:05,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129090410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:05,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:15:05,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-07-12 19:15:05,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814549957] [2022-07-12 19:15:05,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:05,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:15:05,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:05,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:15:05,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:05,394 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:05,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:05,427 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-07-12 19:15:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:15:05,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 19:15:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:05,429 INFO L225 Difference]: With dead ends: 49 [2022-07-12 19:15:05,429 INFO L226 Difference]: Without dead ends: 49 [2022-07-12 19:15:05,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:15:05,430 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 72 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:05,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 73 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:05,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-12 19:15:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-07-12 19:15:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-07-12 19:15:05,432 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 26 [2022-07-12 19:15:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:05,432 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-07-12 19:15:05,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-07-12 19:15:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:15:05,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:05,433 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] [2022-07-12 19:15:05,452 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-12 19:15:05,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:05,648 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:05,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689023, now seen corresponding path program 1 times [2022-07-12 19:15:05,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:05,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611371781] [2022-07-12 19:15:05,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:05,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:05,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:05,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611371781] [2022-07-12 19:15:05,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611371781] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:05,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213090209] [2022-07-12 19:15:05,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:05,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:05,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:05,778 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-12 19:15:05,779 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-12 19:15:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:05,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 19:15:05,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:05,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:05,889 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:15:05,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:15:05,912 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-12 19:15:05,936 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 19:15:05,937 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 23 treesize of output 22 [2022-07-12 19:15:05,952 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:05,952 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 34 treesize of output 35 [2022-07-12 19:15:06,038 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 13 [2022-07-12 19:15:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:06,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:06,135 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-07-12 19:15:06,136 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 21 treesize of output 20 [2022-07-12 19:15:06,139 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2022-07-12 19:15:06,164 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 Int) (v_ArrVal_730 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_728)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2022-07-12 19:15:06,177 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:15:06,177 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 27 treesize of output 33 [2022-07-12 19:15:06,187 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 24 [2022-07-12 19:15:06,189 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-12 19:15:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 19:15:06,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213090209] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:06,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:06,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2022-07-12 19:15:06,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058475331] [2022-07-12 19:15:06,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:06,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 19:15:06,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:06,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 19:15:06,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=736, Unknown=2, NotChecked=110, Total=930 [2022-07-12 19:15:06,248 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:07,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:07,115 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-07-12 19:15:07,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 19:15:07,116 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 19:15:07,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:07,117 INFO L225 Difference]: With dead ends: 129 [2022-07-12 19:15:07,117 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 19:15:07,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=317, Invalid=1757, Unknown=4, NotChecked=178, Total=2256 [2022-07-12 19:15:07,118 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 514 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:07,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 721 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 766 Invalid, 0 Unknown, 194 Unchecked, 0.3s Time] [2022-07-12 19:15:07,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 19:15:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 69. [2022-07-12 19:15:07,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-07-12 19:15:07,120 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 26 [2022-07-12 19:15:07,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:07,120 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-07-12 19:15:07,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-07-12 19:15:07,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:15:07,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:07,121 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] [2022-07-12 19:15:07,140 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-12 19:15:07,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:07,324 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:07,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:07,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689024, now seen corresponding path program 1 times [2022-07-12 19:15:07,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:07,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446811867] [2022-07-12 19:15:07,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:07,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:07,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:07,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446811867] [2022-07-12 19:15:07,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446811867] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:07,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002332008] [2022-07-12 19:15:07,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:07,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:07,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:07,536 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-12 19:15:07,537 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-12 19:15:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:07,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-12 19:15:07,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:07,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:07,694 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:15:07,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:15:07,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:15:07,726 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-12 19:15:07,758 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 19:15:07,759 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 23 treesize of output 22 [2022-07-12 19:15:07,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:07,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:15:07,788 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:07,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-07-12 19:15:07,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 41 treesize of output 41 [2022-07-12 19:15:07,923 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 39 treesize of output 21 [2022-07-12 19:15:07,927 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 32 treesize of output 14 [2022-07-12 19:15:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:07,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:08,174 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:08,174 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 46 treesize of output 50 [2022-07-12 19:15:08,201 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_832 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_834 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_prenex_1 (Array Int Int))) (<= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)))) is different from false [2022-07-12 19:15:08,214 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (Array Int Int)) (v_ArrVal_831 Int)) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_831)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_830)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_831 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_831)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2022-07-12 19:15:08,227 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:15:08,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, 0 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-12 19:15:08,230 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 24 [2022-07-12 19:15:08,232 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-12 19:15:08,240 INFO L356 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2022-07-12 19:15:08,240 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 29 treesize of output 1 [2022-07-12 19:15:08,244 INFO L356 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2022-07-12 19:15:08,245 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 27 treesize of output 1 [2022-07-12 19:15:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 19:15:08,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002332008] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:08,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:08,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 35 [2022-07-12 19:15:08,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134749834] [2022-07-12 19:15:08,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:08,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 19:15:08,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:08,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 19:15:08,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1031, Unknown=2, NotChecked=130, Total=1260 [2022-07-12 19:15:08,371 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 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-12 19:15:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:09,968 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-07-12 19:15:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 19:15:09,969 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 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 26 [2022-07-12 19:15:09,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:09,969 INFO L225 Difference]: With dead ends: 130 [2022-07-12 19:15:09,969 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 19:15:09,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=311, Invalid=2145, Unknown=2, NotChecked=194, Total=2652 [2022-07-12 19:15:09,971 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 809 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:09,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 842 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 786 Invalid, 0 Unknown, 306 Unchecked, 0.5s Time] [2022-07-12 19:15:09,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 19:15:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2022-07-12 19:15:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-07-12 19:15:09,974 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 26 [2022-07-12 19:15:09,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:09,974 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-07-12 19:15:09,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 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-12 19:15:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-07-12 19:15:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 19:15:09,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:09,975 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-12 19:15:09,998 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-12 19:15:10,175 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,SelfDestructingSolverStorable14 [2022-07-12 19:15:10,176 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:10,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:10,177 INFO L85 PathProgramCache]: Analyzing trace with hash -709592258, now seen corresponding path program 1 times [2022-07-12 19:15:10,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:10,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337377498] [2022-07-12 19:15:10,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:10,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 19:15:10,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:10,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337377498] [2022-07-12 19:15:10,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337377498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:10,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:10,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:15:10,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411171498] [2022-07-12 19:15:10,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:10,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:10,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:10,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:10,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:10,228 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:10,328 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-07-12 19:15:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:15:10,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-12 19:15:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:10,330 INFO L225 Difference]: With dead ends: 88 [2022-07-12 19:15:10,330 INFO L226 Difference]: Without dead ends: 88 [2022-07-12 19:15:10,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:15:10,331 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 122 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:10,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 63 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:15:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-12 19:15:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2022-07-12 19:15:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2022-07-12 19:15:10,334 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 31 [2022-07-12 19:15:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:10,335 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2022-07-12 19:15:10,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2022-07-12 19:15:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 19:15:10,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:10,336 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-12 19:15:10,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 19:15:10,336 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:10,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash -709592257, now seen corresponding path program 1 times [2022-07-12 19:15:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:10,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883302552] [2022-07-12 19:15:10,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:15:10,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:10,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883302552] [2022-07-12 19:15:10,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883302552] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:10,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655845158] [2022-07-12 19:15:10,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:10,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:10,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:10,408 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-12 19:15:10,443 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-12 19:15:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:10,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:15:10,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:15:10,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:15:10,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655845158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:10,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:15:10,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-07-12 19:15:10,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180692829] [2022-07-12 19:15:10,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:10,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:15:10,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:10,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:15:10,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:10,560 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:10,590 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-07-12 19:15:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:15:10,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-12 19:15:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:10,592 INFO L225 Difference]: With dead ends: 86 [2022-07-12 19:15:10,592 INFO L226 Difference]: Without dead ends: 86 [2022-07-12 19:15:10,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:15:10,592 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 61 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:10,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 86 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-12 19:15:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2022-07-12 19:15:10,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 74 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-12 19:15:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-07-12 19:15:10,596 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 31 [2022-07-12 19:15:10,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:10,596 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-07-12 19:15:10,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-07-12 19:15:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:15:10,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:10,597 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:10,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:10,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 19:15:10,824 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:10,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1698966507, now seen corresponding path program 2 times [2022-07-12 19:15:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:10,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832785679] [2022-07-12 19:15:10,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:10,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:15:10,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:10,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832785679] [2022-07-12 19:15:10,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832785679] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:10,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967227345] [2022-07-12 19:15:10,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:15:10,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:10,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:10,887 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-12 19:15:10,889 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-12 19:15:11,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:15:11,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:15:11,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:15:11,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:15:11,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:15:11,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967227345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:11,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:15:11,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-07-12 19:15:11,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114415925] [2022-07-12 19:15:11,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:11,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:15:11,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:11,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:15:11,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:15:11,042 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:11,049 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-07-12 19:15:11,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:15:11,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:15:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:11,050 INFO L225 Difference]: With dead ends: 53 [2022-07-12 19:15:11,050 INFO L226 Difference]: Without dead ends: 53 [2022-07-12 19:15:11,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:15:11,051 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 31 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:11,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 60 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-12 19:15:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-12 19:15:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-07-12 19:15:11,053 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 34 [2022-07-12 19:15:11,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:11,053 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-07-12 19:15:11,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-07-12 19:15:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:15:11,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:11,054 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, 1] [2022-07-12 19:15:11,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:11,275 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,SelfDestructingSolverStorable17 [2022-07-12 19:15:11,276 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:11,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash -674776797, now seen corresponding path program 1 times [2022-07-12 19:15:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:11,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213017494] [2022-07-12 19:15:11,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:11,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:15:11,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:11,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213017494] [2022-07-12 19:15:11,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213017494] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:11,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741162332] [2022-07-12 19:15:11,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:11,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:11,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:11,328 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-12 19:15:11,365 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-12 19:15:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:11,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:15:11,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:15:11,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:15:11,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741162332] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:11,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:11,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-07-12 19:15:11,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389673689] [2022-07-12 19:15:11,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:11,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:15:11,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:11,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:15:11,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:15:11,530 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:11,558 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-07-12 19:15:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:15:11,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:15:11,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:11,559 INFO L225 Difference]: With dead ends: 57 [2022-07-12 19:15:11,559 INFO L226 Difference]: Without dead ends: 57 [2022-07-12 19:15:11,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:15:11,560 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 79 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:11,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 81 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:11,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-12 19:15:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-07-12 19:15:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-07-12 19:15:11,562 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2022-07-12 19:15:11,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:11,562 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-07-12 19:15:11,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-07-12 19:15:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:15:11,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:11,563 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:11,591 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-12 19:15:11,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:11,784 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:11,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:11,784 INFO L85 PathProgramCache]: Analyzing trace with hash -634882153, now seen corresponding path program 1 times [2022-07-12 19:15:11,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:11,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407181266] [2022-07-12 19:15:11,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:11,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:15:11,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:11,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407181266] [2022-07-12 19:15:11,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407181266] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:11,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101310733] [2022-07-12 19:15:11,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:11,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:11,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:11,880 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-12 19:15:11,915 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-12 19:15:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:12,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:15:12,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:15:12,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:15:12,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101310733] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:12,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:12,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-07-12 19:15:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543851686] [2022-07-12 19:15:12,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:12,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:12,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:12,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:12,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:12,089 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:12,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:12,141 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-07-12 19:15:12,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:15:12,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:15:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:12,142 INFO L225 Difference]: With dead ends: 52 [2022-07-12 19:15:12,142 INFO L226 Difference]: Without dead ends: 52 [2022-07-12 19:15:12,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:15:12,144 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:12,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 115 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:12,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-12 19:15:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-12 19:15:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-07-12 19:15:12,146 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 34 [2022-07-12 19:15:12,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:12,146 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-07-12 19:15:12,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-07-12 19:15:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:15:12,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:12,147 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:12,171 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-12 19:15:12,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:12,360 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:12,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash -427165145, now seen corresponding path program 2 times [2022-07-12 19:15:12,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:12,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203915059] [2022-07-12 19:15:12,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:12,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:15:12,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:12,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203915059] [2022-07-12 19:15:12,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203915059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:12,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:12,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:15:12,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872807343] [2022-07-12 19:15:12,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:12,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:12,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:12,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:12,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:12,437 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:12,549 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-07-12 19:15:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:15:12,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-12 19:15:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:12,550 INFO L225 Difference]: With dead ends: 60 [2022-07-12 19:15:12,550 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 19:15:12,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:15:12,551 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 147 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:12,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 36 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:15:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 19:15:12,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-07-12 19:15:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-07-12 19:15:12,553 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 39 [2022-07-12 19:15:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:12,554 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-07-12 19:15:12,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-07-12 19:15:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:15:12,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:12,554 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:12,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 19:15:12,555 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:12,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:12,555 INFO L85 PathProgramCache]: Analyzing trace with hash -357219036, now seen corresponding path program 1 times [2022-07-12 19:15:12,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:12,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122498497] [2022-07-12 19:15:12,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:12,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:15:12,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:12,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122498497] [2022-07-12 19:15:12,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122498497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:12,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:12,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:15:12,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475808318] [2022-07-12 19:15:12,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:12,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:12,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:12,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:12,602 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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-12 19:15:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:12,670 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-07-12 19:15:12,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:15:12,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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 40 [2022-07-12 19:15:12,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:12,672 INFO L225 Difference]: With dead ends: 57 [2022-07-12 19:15:12,672 INFO L226 Difference]: Without dead ends: 57 [2022-07-12 19:15:12,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:15:12,673 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 134 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:12,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 58 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:12,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-12 19:15:12,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2022-07-12 19:15:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2022-07-12 19:15:12,675 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 40 [2022-07-12 19:15:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:12,675 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2022-07-12 19:15:12,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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-12 19:15:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-07-12 19:15:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:15:12,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:12,676 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:12,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 19:15:12,677 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:12,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:12,677 INFO L85 PathProgramCache]: Analyzing trace with hash 311339877, now seen corresponding path program 1 times [2022-07-12 19:15:12,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:12,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857279206] [2022-07-12 19:15:12,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:12,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:15:12,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:12,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857279206] [2022-07-12 19:15:12,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857279206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:12,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:12,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:15:12,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296759353] [2022-07-12 19:15:12,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:12,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:12,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:12,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:12,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:12,728 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:12,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:12,810 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-07-12 19:15:12,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:15:12,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-12 19:15:12,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:12,811 INFO L225 Difference]: With dead ends: 55 [2022-07-12 19:15:12,811 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 19:15:12,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:15:12,812 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:12,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 45 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:15:12,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 19:15:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-07-12 19:15:12,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-07-12 19:15:12,813 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 42 [2022-07-12 19:15:12,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:12,813 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-07-12 19:15:12,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-07-12 19:15:12,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:15:12,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:12,814 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:12,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 19:15:12,814 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:12,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:12,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912181, now seen corresponding path program 1 times [2022-07-12 19:15:12,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:12,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926460614] [2022-07-12 19:15:12,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:12,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 19:15:13,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:13,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926460614] [2022-07-12 19:15:13,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926460614] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:13,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555601028] [2022-07-12 19:15:13,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:13,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:13,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:13,155 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-12 19:15:13,155 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-12 19:15:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:13,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-12 19:15:13,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:13,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:13,334 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:15:13,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:15:13,345 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-12 19:15:13,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:13,354 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 23 treesize of output 22 [2022-07-12 19:15:13,369 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:13,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-12 19:15:13,484 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:13,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-12 19:15:13,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:13,535 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 29 treesize of output 24 [2022-07-12 19:15:13,592 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:13,592 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 27 treesize of output 23 [2022-07-12 19:15:13,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:15:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:15:13,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:14,530 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))))) is different from false [2022-07-12 19:15:14,569 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))) is different from false [2022-07-12 19:15:14,591 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))) is different from false [2022-07-12 19:15:14,604 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))) is different from false [2022-07-12 19:15:14,627 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))) is different from false [2022-07-12 19:15:14,640 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_#res#1.base|)))))) is different from false [2022-07-12 19:15:14,654 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))) is different from false [2022-07-12 19:15:14,675 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))) is different from false [2022-07-12 19:15:14,689 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:14,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 73 [2022-07-12 19:15:14,726 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (or (not (= (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_3)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_2 v_prenex_5) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_2))))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (or (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) .cse1 (or .cse1 (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-07-12 19:15:14,742 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (or (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (forall ((v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (or (not (= (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_3)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_2 v_prenex_5) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_2)))) is different from false [2022-07-12 19:15:14,757 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1639 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1639)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_3)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_2 v_prenex_5) 4))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_2))) (forall ((v_ArrVal_1639 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (or (= (select (store (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1639)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|)))) is different from false [2022-07-12 19:15:14,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:14,770 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:14,770 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 56 treesize of output 47 [2022-07-12 19:15:14,773 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 171 treesize of output 159 [2022-07-12 19:15:14,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:14,792 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 170 treesize of output 158 [2022-07-12 19:15:14,801 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 129 treesize of output 125 [2022-07-12 19:15:14,809 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:14,809 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 136 treesize of output 129 [2022-07-12 19:15:14,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:14,871 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-12 19:15:14,871 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 55 treesize of output 1 [2022-07-12 19:15:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-07-12 19:15:14,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555601028] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:14,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:14,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 22] total 43 [2022-07-12 19:15:14,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386024249] [2022-07-12 19:15:14,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:14,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-12 19:15:14,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:14,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-12 19:15:14,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=961, Unknown=11, NotChecked=792, Total=1892 [2022-07-12 19:15:14,928 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 44 states, 43 states have (on average 2.255813953488372) internal successors, (97), 44 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-12 19:15:15,758 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2022-07-12 19:15:16,181 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| .cse0) 1))) is different from false [2022-07-12 19:15:16,587 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_#res#1.base|))))) (not (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select |c_#valid| .cse0) 1))) is different from false [2022-07-12 19:15:19,337 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| .cse0) (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))))) is different from false [2022-07-12 19:15:27,737 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (= .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.base|) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int) (v_ArrVal_1642 (Array Int Int))) (or (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))))) is different from false [2022-07-12 19:15:28,013 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2022-07-12 19:15:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:28,213 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-07-12 19:15:28,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 19:15:28,214 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.255813953488372) internal successors, (97), 44 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 45 [2022-07-12 19:15:28,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:28,214 INFO L225 Difference]: With dead ends: 62 [2022-07-12 19:15:28,214 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 19:15:28,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=214, Invalid=1477, Unknown=17, NotChecked=1598, Total=3306 [2022-07-12 19:15:28,215 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 621 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:28,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 223 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 501 Invalid, 0 Unknown, 621 Unchecked, 0.2s Time] [2022-07-12 19:15:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 19:15:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2022-07-12 19:15:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.150943396226415) internal successors, (61), 57 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-07-12 19:15:28,217 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 45 [2022-07-12 19:15:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:28,217 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-07-12 19:15:28,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.255813953488372) internal successors, (97), 44 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-12 19:15:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-07-12 19:15:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:15:28,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:28,217 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:28,236 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-12 19:15:28,418 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,SelfDestructingSolverStorable23 [2022-07-12 19:15:28,418 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:28,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:28,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912180, now seen corresponding path program 1 times [2022-07-12 19:15:28,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:28,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677928017] [2022-07-12 19:15:28,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:28,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:28,841 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:15:28,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:28,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677928017] [2022-07-12 19:15:28,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677928017] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:28,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443815191] [2022-07-12 19:15:28,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:28,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:28,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:28,843 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-12 19:15:28,844 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-12 19:15:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:28,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-12 19:15:28,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:28,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:29,055 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:15:29,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:15:29,088 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-12 19:15:29,095 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-12 19:15:29,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:29,133 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 23 treesize of output 22 [2022-07-12 19:15:29,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:29,144 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 23 treesize of output 22 [2022-07-12 19:15:29,168 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:29,169 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-12 19:15:29,173 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-12 19:15:29,316 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:29,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-12 19:15:29,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 19:15:29,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:29,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 19:15:29,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:29,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-12 19:15:29,459 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:29,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-12 19:15:29,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:29,465 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 27 treesize of output 23 [2022-07-12 19:15:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:15:29,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:30,644 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))))) is different from false [2022-07-12 19:15:30,673 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))))) (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))))) is different from false [2022-07-12 19:15:30,698 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))))) is different from false [2022-07-12 19:15:30,732 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))))) (forall ((v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1779 Int)) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|)))) is different from false [2022-07-12 19:15:30,758 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|)))) is different from false [2022-07-12 19:15:30,769 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (forall ((v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|)))) is different from false [2022-07-12 19:15:30,780 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (forall ((v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4)))))) is different from false [2022-07-12 19:15:30,799 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (forall ((v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1779 Int)) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|)))) is different from false [2022-07-12 19:15:30,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:30,813 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 95 treesize of output 99 [2022-07-12 19:15:30,849 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_8 (Array Int Int)) (v_prenex_10 Int) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_9) (<= 0 (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_8) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_9 v_prenex_10) 4) 4)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1779 Int)) (<= (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1773) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1778 Int)) (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1777)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-07-12 19:15:30,887 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1772 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1778 Int)) (= (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1772)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1777)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (forall ((v_ArrVal_1772 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int) (v_ArrVal_1769 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1779 Int)) (<= (select (store (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1769)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1773) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1772)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1776)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))))) (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_1772 Int) (v_prenex_10 Int) (v_ArrVal_1769 Int) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_9) (<= 0 (+ (select (store (select (let ((.cse2 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_1769)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_8) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_1772)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_6)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_9 v_prenex_10) 4) 4))))) is different from false [2022-07-12 19:15:30,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:30,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:30,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 63 [2022-07-12 19:15:30,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:30,907 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:30,907 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 42 treesize of output 48 [2022-07-12 19:15:30,910 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 66 treesize of output 54 [2022-07-12 19:15:30,915 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 230 treesize of output 222 [2022-07-12 19:15:30,920 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 274 treesize of output 264 [2022-07-12 19:15:30,926 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:30,927 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 308 treesize of output 308 [2022-07-12 19:15:30,933 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 262 treesize of output 258 [2022-07-12 19:15:30,937 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 258 treesize of output 234 [2022-07-12 19:15:31,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:31,009 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-12 19:15:31,009 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 55 treesize of output 1 [2022-07-12 19:15:31,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:31,014 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-12 19:15:31,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 1 [2022-07-12 19:15:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-07-12 19:15:31,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443815191] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:31,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:31,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 51 [2022-07-12 19:15:31,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926490526] [2022-07-12 19:15:31,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:31,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-12 19:15:31,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:31,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-12 19:15:31,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1588, Unknown=10, NotChecked=890, Total=2652 [2022-07-12 19:15:31,157 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 52 states, 51 states have (on average 2.3333333333333335) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:32,625 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= 12 (select |c_#length| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4)))))) (= .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.base|))) is different from false [2022-07-12 19:15:33,145 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (forall ((v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= 12 (select |c_#length| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4)))))))) is different from false [2022-07-12 19:15:33,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:33,525 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-07-12 19:15:33,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 19:15:33,525 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.3333333333333335) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-12 19:15:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:33,526 INFO L225 Difference]: With dead ends: 66 [2022-07-12 19:15:33,526 INFO L226 Difference]: Without dead ends: 66 [2022-07-12 19:15:33,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=363, Invalid=2865, Unknown=12, NotChecked=1452, Total=4692 [2022-07-12 19:15:33,528 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 98 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 555 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:33,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 260 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 551 Invalid, 0 Unknown, 555 Unchecked, 0.2s Time] [2022-07-12 19:15:33,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-12 19:15:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2022-07-12 19:15:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-07-12 19:15:33,530 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 45 [2022-07-12 19:15:33,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:33,530 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-07-12 19:15:33,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.3333333333333335) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-07-12 19:15:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:15:33,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:33,531 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:33,555 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-12 19:15:33,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:33,753 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:33,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:33,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1960736865, now seen corresponding path program 1 times [2022-07-12 19:15:33,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:33,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490207743] [2022-07-12 19:15:33,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:33,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:15:34,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:34,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490207743] [2022-07-12 19:15:34,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490207743] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:34,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805537802] [2022-07-12 19:15:34,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:34,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:34,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:34,060 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-12 19:15:34,061 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-12 19:15:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:34,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 19:15:34,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:34,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:34,241 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:15:34,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 19:15:34,255 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-12 19:15:34,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:34,265 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 33 treesize of output 26 [2022-07-12 19:15:34,280 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:34,280 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 33 treesize of output 34 [2022-07-12 19:15:34,367 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:34,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-12 19:15:34,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:34,410 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 28 treesize of output 23 [2022-07-12 19:15:34,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:34,461 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 26 treesize of output 22 [2022-07-12 19:15:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:15:34,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:34,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-12 19:15:34,928 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1907) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-12 19:15:34,937 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1907) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-12 19:15:34,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1907) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-12 19:15:34,955 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1907) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-12 19:15:34,968 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1907) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-12 19:15:34,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1907) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)))) is different from false [2022-07-12 19:15:34,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1907) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-12 19:15:34,989 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1905 (Array Int Int))) (or (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1905))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1907)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2022-07-12 19:15:35,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1904 Int) (v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1905 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|) (not (= (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1904)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1905))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1907)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)))) is different from false [2022-07-12 19:15:35,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:35,014 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:35,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2022-07-12 19:15:35,017 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 171 treesize of output 159 [2022-07-12 19:15:35,027 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:35,028 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 161 treesize of output 154 [2022-07-12 19:15:35,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:35,036 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 163 treesize of output 151 [2022-07-12 19:15:35,041 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 122 treesize of output 118 [2022-07-12 19:15:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-07-12 19:15:35,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805537802] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:35,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:35,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 22] total 44 [2022-07-12 19:15:35,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526923466] [2022-07-12 19:15:35,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:35,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-12 19:15:35,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:35,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-12 19:15:35,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1019, Unknown=10, NotChecked=730, Total=1892 [2022-07-12 19:15:35,175 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 44 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-12 19:15:39,040 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) (= .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.base|))) is different from false [2022-07-12 19:15:39,309 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((v_ArrVal_1909 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1909) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))))) is different from false [2022-07-12 19:15:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:39,554 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2022-07-12 19:15:39,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 19:15:39,554 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 44 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-12 19:15:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:39,555 INFO L225 Difference]: With dead ends: 63 [2022-07-12 19:15:39,555 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 19:15:39,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 69 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=290, Invalid=2098, Unknown=12, NotChecked=1260, Total=3660 [2022-07-12 19:15:39,556 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 112 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 564 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:39,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 363 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 441 Invalid, 0 Unknown, 564 Unchecked, 0.2s Time] [2022-07-12 19:15:39,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 19:15:39,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-07-12 19:15:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-07-12 19:15:39,560 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 46 [2022-07-12 19:15:39,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:39,560 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-07-12 19:15:39,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 44 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-12 19:15:39,560 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-07-12 19:15:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 19:15:39,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:39,561 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:39,580 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-12 19:15:39,774 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,SelfDestructingSolverStorable25 [2022-07-12 19:15:39,775 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:39,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:39,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1223965472, now seen corresponding path program 1 times [2022-07-12 19:15:39,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:39,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192398022] [2022-07-12 19:15:39,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:39,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:15:40,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:40,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192398022] [2022-07-12 19:15:40,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192398022] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:40,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590436359] [2022-07-12 19:15:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:40,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:40,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:40,085 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-12 19:15:40,086 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-12 19:15:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:40,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-12 19:15:40,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:40,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:40,283 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:15:40,284 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-12 19:15:40,318 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-12 19:15:40,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:40,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:15:40,403 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:40,403 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2022-07-12 19:15:40,662 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-07-12 19:15:40,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:40,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:40,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-07-12 19:15:40,848 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:40,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-07-12 19:15:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:15:40,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:41,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|))) is different from false [2022-07-12 19:15:41,509 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2034) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:15:41,518 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2034) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:15:41,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_2034) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:15:41,535 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2034) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:15:41,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2034) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|))) is different from false [2022-07-12 19:15:41,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2034) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:15:41,559 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2034) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:15:41,566 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2033))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2034)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:15:41,577 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 Int) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2033))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2034)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-12 19:15:41,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:41,586 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:41,586 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 57 treesize of output 48 [2022-07-12 19:15:41,588 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 312 treesize of output 292 [2022-07-12 19:15:41,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:41,598 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 300 treesize of output 282 [2022-07-12 19:15:41,603 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 320 treesize of output 312 [2022-07-12 19:15:41,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:15:41,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:15:41,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 352 treesize of output 336 [2022-07-12 19:15:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-07-12 19:15:41,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590436359] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:41,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:15:41,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 54 [2022-07-12 19:15:41,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702145794] [2022-07-12 19:15:41,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:41,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-12 19:15:41,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:15:41,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-12 19:15:41,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1820, Unknown=10, NotChecked=950, Total=2970 [2022-07-12 19:15:41,993 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 55 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:44,351 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((v_ArrVal_2035 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|) (= (select .cse1 8) 0)))) is different from false [2022-07-12 19:15:44,627 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((v_ArrVal_2035 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_2035) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select .cse1 8) 0)))) is different from false [2022-07-12 19:15:44,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:44,997 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-07-12 19:15:44,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 19:15:44,998 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 55 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) Word has length 48 [2022-07-12 19:15:44,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:44,998 INFO L225 Difference]: With dead ends: 61 [2022-07-12 19:15:44,998 INFO L226 Difference]: Without dead ends: 61 [2022-07-12 19:15:44,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 61 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=404, Invalid=3054, Unknown=12, NotChecked=1500, Total=4970 [2022-07-12 19:15:45,000 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 160 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 585 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:45,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 363 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 596 Invalid, 0 Unknown, 585 Unchecked, 0.3s Time] [2022-07-12 19:15:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-12 19:15:45,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-07-12 19:15:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 60 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-07-12 19:15:45,001 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 48 [2022-07-12 19:15:45,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:45,001 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-07-12 19:15:45,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 55 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-07-12 19:15:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:15:45,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:45,002 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:45,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:45,202 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,SelfDestructingSolverStorable26 [2022-07-12 19:15:45,202 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:45,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:45,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1116795216, now seen corresponding path program 2 times [2022-07-12 19:15:45,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:15:45,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987088902] [2022-07-12 19:15:45,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:45,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:15:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:45,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:15:45,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987088902] [2022-07-12 19:15:45,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987088902] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:15:45,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998064621] [2022-07-12 19:15:45,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:15:45,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:15:45,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:45,828 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:15:45,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 19:15:45,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:15:45,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:15:45,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-12 19:15:45,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:45,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:46,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:15:46,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:15:46,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:46,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:15:46,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:46,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:15:46,035 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:15:46,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:15:46,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:15:46,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:15:46,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:15:46,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:15:46,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:46,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-12 19:15:46,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:46,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-12 19:15:46,182 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:15:46,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 50 [2022-07-12 19:15:46,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-12 19:15:46,508 INFO L356 Elim1Store]: treesize reduction 84, result has 37.3 percent of original size [2022-07-12 19:15:46,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 88 [2022-07-12 19:15:46,557 INFO L356 Elim1Store]: treesize reduction 54, result has 51.8 percent of original size [2022-07-12 19:15:46,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 74 [2022-07-12 19:15:46,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:47,009 INFO L356 Elim1Store]: treesize reduction 98, result has 33.8 percent of original size [2022-07-12 19:15:47,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 132 treesize of output 147 [2022-07-12 19:15:47,038 INFO L356 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-07-12 19:15:47,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 153 treesize of output 174 [2022-07-12 19:15:47,043 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 19:15:47,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-12 19:15:47,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-12 19:15:47,244 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.transform(TermContextTransformationEngine.java:65) 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-12 19:15:47,249 INFO L158 Benchmark]: Toolchain (without parser) took 46740.70ms. Allocated memory was 104.9MB in the beginning and 165.7MB in the end (delta: 60.8MB). Free memory was 75.0MB in the beginning and 63.3MB in the end (delta: 11.7MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2022-07-12 19:15:47,249 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory was 63.0MB in the beginning and 62.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:15:47,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.88ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 75.0MB in the beginning and 98.1MB in the end (delta: -23.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 19:15:47,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.70ms. Allocated memory is still 130.0MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:15:47,250 INFO L158 Benchmark]: Boogie Preprocessor took 28.45ms. Allocated memory is still 130.0MB. Free memory was 96.0MB in the beginning and 94.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:15:47,250 INFO L158 Benchmark]: RCFGBuilder took 357.76ms. Allocated memory is still 130.0MB. Free memory was 94.5MB in the beginning and 78.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 19:15:47,250 INFO L158 Benchmark]: TraceAbstraction took 45911.87ms. Allocated memory was 130.0MB in the beginning and 165.7MB in the end (delta: 35.7MB). Free memory was 78.2MB in the beginning and 63.3MB in the end (delta: 15.0MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2022-07-12 19:15:47,251 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.14ms. Allocated memory is still 104.9MB. Free memory was 63.0MB in the beginning and 62.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.88ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 75.0MB in the beginning and 98.1MB in the end (delta: -23.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.70ms. Allocated memory is still 130.0MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.45ms. Allocated memory is still 130.0MB. Free memory was 96.0MB in the beginning and 94.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 357.76ms. Allocated memory is still 130.0MB. Free memory was 94.5MB in the beginning and 78.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 45911.87ms. Allocated memory was 130.0MB in the beginning and 165.7MB in the end (delta: 35.7MB). Free memory was 78.2MB in the beginning and 63.3MB in the end (delta: 15.0MB). Peak memory consumption was 51.8MB. 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-12 19:15:47,278 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-simple/dll2n_update_all_reverse.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 cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:15:48,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:15:48,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:15:48,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:15:48,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:15:48,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:15:48,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:15:48,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:15:48,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:15:48,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:15:48,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:15:48,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:15:48,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:15:48,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:15:48,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:15:48,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:15:48,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:15:48,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:15:48,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:15:48,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:15:48,940 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:15:48,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:15:48,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:15:48,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:15:48,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:15:48,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:15:48,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:15:48,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:15:48,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:15:48,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:15:48,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:15:48,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:15:48,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:15:48,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:15:48,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:15:48,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:15:48,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:15:48,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:15:48,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:15:48,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:15:48,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:15:48,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:15:48,979 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 19:15:48,995 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:15:48,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:15:48,995 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:15:48,995 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:15:48,996 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:15:48,996 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:15:48,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:15:48,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:15:48,997 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:15:48,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:15:48,997 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:15:48,997 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:15:48,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:15:48,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:15:48,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:15:48,998 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:15:48,998 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:15:48,998 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:15:48,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:15:48,998 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:15:48,998 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 19:15:48,998 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 19:15:48,998 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:15:48,999 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:15:48,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:15:48,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:15:48,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:15:48,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:15:48,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:15:48,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:15:48,999 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 19:15:49,000 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 19:15:49,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 19:15:49,000 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 -> cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 [2022-07-12 19:15:49,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:15:49,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:15:49,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:15:49,269 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:15:49,271 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:15:49,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2022-07-12 19:15:49,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918bf24c9/1e4508b68fa948708a9a2e1608764446/FLAGd3918120c [2022-07-12 19:15:49,724 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:15:49,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2022-07-12 19:15:49,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918bf24c9/1e4508b68fa948708a9a2e1608764446/FLAGd3918120c [2022-07-12 19:15:49,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918bf24c9/1e4508b68fa948708a9a2e1608764446 [2022-07-12 19:15:49,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:15:49,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:15:49,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:15:49,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:15:49,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:15:49,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:15:49" (1/1) ... [2022-07-12 19:15:49,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3daa1d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:49, skipping insertion in model container [2022-07-12 19:15:49,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:15:49" (1/1) ... [2022-07-12 19:15:49,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:15:49,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:15:50,092 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-simple/dll2n_update_all_reverse.i[24473,24486] [2022-07-12 19:15:50,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:15:50,108 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:15:50,164 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-simple/dll2n_update_all_reverse.i[24473,24486] [2022-07-12 19:15:50,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:15:50,195 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:15:50,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:50 WrapperNode [2022-07-12 19:15:50,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:15:50,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:15:50,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:15:50,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:15:50,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:50" (1/1) ... [2022-07-12 19:15:50,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:50" (1/1) ... [2022-07-12 19:15:50,259 INFO L137 Inliner]: procedures = 129, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2022-07-12 19:15:50,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:15:50,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:15:50,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:15:50,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:15:50,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:50" (1/1) ... [2022-07-12 19:15:50,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:50" (1/1) ... [2022-07-12 19:15:50,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:50" (1/1) ... [2022-07-12 19:15:50,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:50" (1/1) ... [2022-07-12 19:15:50,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:50" (1/1) ... [2022-07-12 19:15:50,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:50" (1/1) ... [2022-07-12 19:15:50,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:50" (1/1) ... [2022-07-12 19:15:50,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:15:50,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:15:50,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:15:50,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:15:50,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:50" (1/1) ... [2022-07-12 19:15:50,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:15:50,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:50,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 19:15:50,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 19:15:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-12 19:15:50,351 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-12 19:15:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 19:15:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:15:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:15:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:15:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:15:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:15:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 19:15:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 19:15:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:15:50,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:15:50,497 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:15:50,498 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:15:50,541 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-12 19:15:50,787 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:15:50,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:15:50,791 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 19:15:50,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:15:50 BoogieIcfgContainer [2022-07-12 19:15:50,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:15:50,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:15:50,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:15:50,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:15:50,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:15:49" (1/3) ... [2022-07-12 19:15:50,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@317451cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:15:50, skipping insertion in model container [2022-07-12 19:15:50,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:50" (2/3) ... [2022-07-12 19:15:50,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@317451cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:15:50, skipping insertion in model container [2022-07-12 19:15:50,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:15:50" (3/3) ... [2022-07-12 19:15:50,798 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2022-07-12 19:15:50,807 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:15:50,807 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-07-12 19:15:50,837 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:15:50,842 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@dd777b9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c946651 [2022-07-12 19:15:50,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-07-12 19:15:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 19:15:50,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:50,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 19:15:50,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:50,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:50,853 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-07-12 19:15:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:15:50,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24546004] [2022-07-12 19:15:50,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:50,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:15:50,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:15:50,864 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-12 19:15:50,876 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-12 19:15:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:50,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:15:50,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:51,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:51,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:15:51,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:15:51,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24546004] [2022-07-12 19:15:51,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24546004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:51,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:51,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:15:51,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283711699] [2022-07-12 19:15:51,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:51,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:15:51,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:15:51,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:15:51,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:51,089 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:51,213 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-07-12 19:15:51,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:15:51,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 19:15:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:51,220 INFO L225 Difference]: With dead ends: 111 [2022-07-12 19:15:51,220 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 19:15:51,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:51,226 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:51,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:15:51,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 19:15:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-07-12 19:15:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-07-12 19:15:51,257 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2022-07-12 19:15:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:51,257 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-07-12 19:15:51,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-07-12 19:15:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 19:15:51,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:51,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 19:15:51,267 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-12 19:15:51,465 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-12 19:15:51,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:51,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:51,466 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-07-12 19:15:51,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:15:51,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227615162] [2022-07-12 19:15:51,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:51,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:15:51,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:15:51,468 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-12 19:15:51,470 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-12 19:15:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:51,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:15:51,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:51,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:51,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:15:51,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:15:51,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227615162] [2022-07-12 19:15:51,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227615162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:51,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:51,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:15:51,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836295314] [2022-07-12 19:15:51,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:51,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:15:51,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:15:51,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:15:51,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:51,538 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:51,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:51,645 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-07-12 19:15:51,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:15:51,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 19:15:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:51,647 INFO L225 Difference]: With dead ends: 101 [2022-07-12 19:15:51,647 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 19:15:51,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:51,648 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:51,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:15:51,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 19:15:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2022-07-12 19:15:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-07-12 19:15:51,653 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2022-07-12 19:15:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:51,653 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-07-12 19:15:51,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-07-12 19:15:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 19:15:51,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:51,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:51,661 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-12 19:15:51,854 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-12 19:15:51,854 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:51,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:51,855 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2022-07-12 19:15:51,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:15:51,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411304402] [2022-07-12 19:15:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:51,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:15:51,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:15:51,857 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-12 19:15:51,858 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-12 19:15:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:51,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:15:51,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:51,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:15:51,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:15:51,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411304402] [2022-07-12 19:15:51,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411304402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:51,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:51,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:15:51,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290665463] [2022-07-12 19:15:51,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:51,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:15:51,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:15:51,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:15:51,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:51,918 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:51,937 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-07-12 19:15:51,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:15:51,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 19:15:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:51,938 INFO L225 Difference]: With dead ends: 66 [2022-07-12 19:15:51,939 INFO L226 Difference]: Without dead ends: 66 [2022-07-12 19:15:51,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:51,940 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:51,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:51,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-12 19:15:51,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2022-07-12 19:15:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2022-07-12 19:15:51,961 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2022-07-12 19:15:51,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:51,961 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2022-07-12 19:15:51,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-07-12 19:15:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:15:51,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:51,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:51,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:52,172 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-12 19:15:52,172 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:52,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-07-12 19:15:52,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:15:52,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422929906] [2022-07-12 19:15:52,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:52,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:15:52,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:15:52,174 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-12 19:15:52,178 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-12 19:15:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:52,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:15:52,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:52,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:15:52,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:15:52,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422929906] [2022-07-12 19:15:52,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422929906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:52,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:52,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:15:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799294987] [2022-07-12 19:15:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:52,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:15:52,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:15:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:15:52,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:52,294 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:52,324 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-07-12 19:15:52,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:15:52,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 19:15:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:52,325 INFO L225 Difference]: With dead ends: 63 [2022-07-12 19:15:52,325 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 19:15:52,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:15:52,326 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:52,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 19:15:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-07-12 19:15:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:52,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-07-12 19:15:52,345 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2022-07-12 19:15:52,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:52,345 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-07-12 19:15:52,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-07-12 19:15:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:15:52,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:52,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:52,366 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-12 19:15:52,555 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-12 19:15:52,555 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:52,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:52,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2022-07-12 19:15:52,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:15:52,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152261263] [2022-07-12 19:15:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:52,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:15:52,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:15:52,558 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-12 19:15:52,559 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-12 19:15:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:52,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:15:52,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:52,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:52,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:15:52,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152261263] [2022-07-12 19:15:52,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152261263] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:52,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:15:52,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 19:15:52,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898698453] [2022-07-12 19:15:52,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:52,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:15:52,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:15:52,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:15:52,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:15:52,664 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:52,682 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-07-12 19:15:52,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:15:52,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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 15 [2022-07-12 19:15:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:52,683 INFO L225 Difference]: With dead ends: 73 [2022-07-12 19:15:52,683 INFO L226 Difference]: Without dead ends: 73 [2022-07-12 19:15:52,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:15:52,684 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 35 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:52,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 239 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:52,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-12 19:15:52,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2022-07-12 19:15:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 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-12 19:15:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-07-12 19:15:52,688 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2022-07-12 19:15:52,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:52,688 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-07-12 19:15:52,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-07-12 19:15:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:15:52,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:52,689 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:52,712 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-12 19:15:52,899 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-12 19:15:52,900 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:52,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-07-12 19:15:52,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:15:52,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084851181] [2022-07-12 19:15:52,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:52,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:15:52,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:15:52,902 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-12 19:15:52,904 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-12 19:15:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:52,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:15:53,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:53,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:53,037 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:15:53,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-12 19:15:53,054 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-12 19:15:53,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:53,087 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-12 19:15:53,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:15:53,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084851181] [2022-07-12 19:15:53,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084851181] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:53,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:15:53,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-07-12 19:15:53,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120556795] [2022-07-12 19:15:53,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:53,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:15:53,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:15:53,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:15:53,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:15:53,089 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:53,187 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-07-12 19:15:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:15:53,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 19:15:53,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:53,188 INFO L225 Difference]: With dead ends: 77 [2022-07-12 19:15:53,188 INFO L226 Difference]: Without dead ends: 77 [2022-07-12 19:15:53,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:15:53,189 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 103 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:53,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 57 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:15:53,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-12 19:15:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-07-12 19:15:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 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-12 19:15:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-07-12 19:15:53,192 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2022-07-12 19:15:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:53,192 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-07-12 19:15:53,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-07-12 19:15:53,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:15:53,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:53,192 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:53,202 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-12 19:15:53,399 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-12 19:15:53,400 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-07-12 19:15:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:15:53,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584286317] [2022-07-12 19:15:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:53,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:15:53,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:15:53,402 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-12 19:15:53,402 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-12 19:15:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:53,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 19:15:53,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:53,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:53,568 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:53,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:15:53,597 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-12 19:15:53,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:53,863 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-12 19:15:53,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:15:53,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584286317] [2022-07-12 19:15:53,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584286317] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:53,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:15:53,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2022-07-12 19:15:53,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922475129] [2022-07-12 19:15:53,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:53,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:53,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:15:53,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:53,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:53,865 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:53,980 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-07-12 19:15:53,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:15:53,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 19:15:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:53,981 INFO L225 Difference]: With dead ends: 62 [2022-07-12 19:15:53,981 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 19:15:53,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:15:53,982 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 159 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:53,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 42 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 11 Unchecked, 0.1s Time] [2022-07-12 19:15:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 19:15:53,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-12 19:15:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-07-12 19:15:53,984 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2022-07-12 19:15:53,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:53,984 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-07-12 19:15:53,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:53,985 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-07-12 19:15:53,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:15:53,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:53,985 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:54,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:54,185 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-12 19:15:54,186 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:54,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:54,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2022-07-12 19:15:54,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:15:54,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682736740] [2022-07-12 19:15:54,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:15:54,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:15:54,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:15:54,188 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-12 19:15:54,189 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-12 19:15:54,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:15:54,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:15:54,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:15:54,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:54,301 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-12 19:15:54,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:54,316 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-12 19:15:54,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:15:54,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682736740] [2022-07-12 19:15:54,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682736740] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:54,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:15:54,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-07-12 19:15:54,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341021800] [2022-07-12 19:15:54,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:54,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:15:54,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:15:54,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:15:54,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:15:54,318 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-12 19:15:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:54,368 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-07-12 19:15:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:15:54,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-12 19:15:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:54,369 INFO L225 Difference]: With dead ends: 62 [2022-07-12 19:15:54,369 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 19:15:54,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:15:54,370 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:54,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 19:15:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-12 19:15:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-07-12 19:15:54,372 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 22 [2022-07-12 19:15:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:54,372 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-07-12 19:15:54,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-12 19:15:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-07-12 19:15:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 19:15:54,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:54,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:54,394 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-12 19:15:54,573 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-12 19:15:54,573 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:54,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:54,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022382, now seen corresponding path program 1 times [2022-07-12 19:15:54,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:15:54,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382873695] [2022-07-12 19:15:54,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:54,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:15:54,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:15:54,575 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-12 19:15:54,576 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-12 19:15:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:54,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 19:15:54,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:54,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:15:54,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:15:54,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:15:54,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382873695] [2022-07-12 19:15:54,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382873695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:54,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:54,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:15:54,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703953914] [2022-07-12 19:15:54,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:54,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:54,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:15:54,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:54,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:54,707 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:55,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:55,013 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-07-12 19:15:55,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:15:55,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 19:15:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:55,015 INFO L225 Difference]: With dead ends: 113 [2022-07-12 19:15:55,015 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 19:15:55,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:15:55,015 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 258 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:55,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 123 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:15:55,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 19:15:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 65. [2022-07-12 19:15:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-12 19:15:55,019 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 23 [2022-07-12 19:15:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:55,019 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-12 19:15:55,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-12 19:15:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 19:15:55,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:55,020 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:55,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:55,220 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-12 19:15:55,221 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:55,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022381, now seen corresponding path program 1 times [2022-07-12 19:15:55,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:15:55,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065145432] [2022-07-12 19:15:55,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:55,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:15:55,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:15:55,223 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-12 19:15:55,223 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-12 19:15:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:55,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 19:15:55,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:55,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:15:55,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:15:55,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:15:55,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065145432] [2022-07-12 19:15:55,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065145432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:55,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:55,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:15:55,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883050370] [2022-07-12 19:15:55,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:55,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:15:55,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:15:55,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:15:55,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:15:55,401 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:55,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:55,703 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-07-12 19:15:55,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:15:55,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 19:15:55,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:55,704 INFO L225 Difference]: With dead ends: 100 [2022-07-12 19:15:55,704 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 19:15:55,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:15:55,705 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:55,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:15:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 19:15:55,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2022-07-12 19:15:55,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 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-12 19:15:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-07-12 19:15:55,707 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 23 [2022-07-12 19:15:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:55,707 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-07-12 19:15:55,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-07-12 19:15:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:15:55,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:55,708 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:55,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-12 19:15:55,915 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-12 19:15:55,915 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:55,916 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2022-07-12 19:15:55,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:15:55,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75863031] [2022-07-12 19:15:55,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:55,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:15:55,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:15:55,917 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-12 19:15:55,921 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-12 19:15:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:56,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:15:56,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:15:56,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:15:56,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:15:56,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75863031] [2022-07-12 19:15:56,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75863031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:15:56,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:15:56,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:15:56,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428946792] [2022-07-12 19:15:56,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:15:56,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:15:56,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:15:56,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:15:56,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:15:56,034 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:56,048 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-07-12 19:15:56,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:15:56,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-12 19:15:56,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:56,052 INFO L225 Difference]: With dead ends: 65 [2022-07-12 19:15:56,052 INFO L226 Difference]: Without dead ends: 65 [2022-07-12 19:15:56,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:15:56,052 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:56,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 62 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:15:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-12 19:15:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2022-07-12 19:15:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-07-12 19:15:56,055 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 25 [2022-07-12 19:15:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:56,055 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-07-12 19:15:56,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-07-12 19:15:56,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:15:56,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:56,055 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:15:56,063 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-12 19:15:56,262 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-12 19:15:56,263 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:56,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:56,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689078, now seen corresponding path program 1 times [2022-07-12 19:15:56,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:15:56,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127541221] [2022-07-12 19:15:56,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:56,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:15:56,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:15:56,265 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-12 19:15:56,266 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-12 19:15:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:56,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:15:56,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:15:56,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:15:56,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:15:56,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127541221] [2022-07-12 19:15:56,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127541221] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:56,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:15:56,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-12 19:15:56,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561087153] [2022-07-12 19:15:56,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:56,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:15:56,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:15:56,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:15:56,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:15:56,472 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:56,700 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2022-07-12 19:15:56,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 19:15:56,700 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 19:15:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:56,701 INFO L225 Difference]: With dead ends: 111 [2022-07-12 19:15:56,701 INFO L226 Difference]: Without dead ends: 111 [2022-07-12 19:15:56,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:15:56,702 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 397 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:56,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 156 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:15:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-12 19:15:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 64. [2022-07-12 19:15:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 63 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-12 19:15:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-07-12 19:15:56,703 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 26 [2022-07-12 19:15:56,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:56,704 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-07-12 19:15:56,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-07-12 19:15:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:15:56,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:56,704 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] [2022-07-12 19:15:56,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 19:15:56,904 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-12 19:15:56,905 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:56,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:56,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689023, now seen corresponding path program 1 times [2022-07-12 19:15:56,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:15:56,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913231303] [2022-07-12 19:15:56,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:56,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:15:56,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:15:56,906 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-12 19:15:56,908 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-12 19:15:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:57,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 19:15:57,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:57,045 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:15:57,046 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-12 19:15:57,107 INFO L356 Elim1Store]: treesize reduction 9, result has 64.0 percent of original size [2022-07-12 19:15:57,108 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 20 treesize of output 29 [2022-07-12 19:15:57,138 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-12 19:15:57,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:57,162 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 23 treesize of output 22 [2022-07-12 19:15:57,200 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:57,201 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 34 treesize of output 35 [2022-07-12 19:15:57,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-12 19:15:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:57,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:15:57,503 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-07-12 19:15:57,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:15:57,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_408) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2022-07-12 19:15:57,531 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (_ BitVec 32)) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_406)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_408) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2022-07-12 19:15:57,637 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:15:57,637 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 27 treesize of output 33 [2022-07-12 19:15:57,648 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 24 [2022-07-12 19:15:57,651 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-12 19:15:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 19:15:57,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:15:57,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913231303] [2022-07-12 19:15:57,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913231303] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:15:57,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:15:57,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2022-07-12 19:15:57,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403614150] [2022-07-12 19:15:57,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:15:57,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 19:15:57,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:15:57,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 19:15:57,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=413, Unknown=2, NotChecked=82, Total=552 [2022-07-12 19:15:57,726 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:15:58,904 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-07-12 19:15:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 19:15:58,904 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 19:15:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:15:58,905 INFO L225 Difference]: With dead ends: 97 [2022-07-12 19:15:58,905 INFO L226 Difference]: Without dead ends: 97 [2022-07-12 19:15:58,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=1063, Unknown=2, NotChecked=138, Total=1406 [2022-07-12 19:15:58,906 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 78 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:15:58,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 380 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 444 Invalid, 0 Unknown, 113 Unchecked, 0.6s Time] [2022-07-12 19:15:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-12 19:15:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 80. [2022-07-12 19:15:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 79 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-12 19:15:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2022-07-12 19:15:58,908 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 26 [2022-07-12 19:15:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:15:58,908 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2022-07-12 19:15:58,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:15:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-07-12 19:15:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:15:58,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:15:58,908 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] [2022-07-12 19:15:58,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-12 19:15:59,115 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-12 19:15:59,115 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:15:59,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:15:59,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689024, now seen corresponding path program 1 times [2022-07-12 19:15:59,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:15:59,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041692018] [2022-07-12 19:15:59,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:15:59,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:15:59,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:15:59,117 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-12 19:15:59,118 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-12 19:15:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:15:59,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 19:15:59,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:15:59,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:59,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:15:59,299 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:15:59,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:15:59,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:15:59,338 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-12 19:15:59,344 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-12 19:15:59,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:59,376 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 23 treesize of output 22 [2022-07-12 19:15:59,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:15:59,395 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 23 treesize of output 22 [2022-07-12 19:15:59,425 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:15:59,425 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-12 19:15:59,431 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-12 19:15:59,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-12 19:15:59,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:15:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:15:59,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:00,170 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-12 19:16:00,203 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (_ BitVec 32))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_463)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_464 (_ BitVec 32)) (v_ArrVal_463 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_463)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_464)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)))))) is different from false [2022-07-12 19:16:00,229 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:16:00,229 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 53 treesize of output 44 [2022-07-12 19:16:00,231 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 50 treesize of output 32 [2022-07-12 19:16:00,236 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-12 19:16:00,270 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:16:00,270 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 55 treesize of output 61 [2022-07-12 19:16:00,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:00,285 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:16:00,285 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 40 treesize of output 46 [2022-07-12 19:16:00,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:00,290 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 21 [2022-07-12 19:16:00,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:00,293 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 24 treesize of output 12 [2022-07-12 19:16:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 19:16:10,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:10,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041692018] [2022-07-12 19:16:10,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041692018] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:16:10,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:10,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2022-07-12 19:16:10,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499140329] [2022-07-12 19:16:10,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:10,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 19:16:10,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:10,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 19:16:10,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=453, Unknown=2, NotChecked=86, Total=600 [2022-07-12 19:16:10,324 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:13,925 INFO L93 Difference]: Finished difference Result 180 states and 193 transitions. [2022-07-12 19:16:13,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 19:16:13,926 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 19:16:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:13,927 INFO L225 Difference]: With dead ends: 180 [2022-07-12 19:16:13,927 INFO L226 Difference]: Without dead ends: 180 [2022-07-12 19:16:13,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=314, Invalid=1332, Unknown=2, NotChecked=158, Total=1806 [2022-07-12 19:16:13,928 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 720 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:13,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 436 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 611 Invalid, 0 Unknown, 331 Unchecked, 1.5s Time] [2022-07-12 19:16:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-12 19:16:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 90. [2022-07-12 19:16:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.2875) internal successors, (103), 89 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-12 19:16:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2022-07-12 19:16:13,930 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 26 [2022-07-12 19:16:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:13,930 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-07-12 19:16:13,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-07-12 19:16:13,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:16:13,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:13,931 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:13,942 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-12 19:16:14,138 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-12 19:16:14,139 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:16:14,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:14,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1698966507, now seen corresponding path program 2 times [2022-07-12 19:16:14,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:14,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623490839] [2022-07-12 19:16:14,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:16:14,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:14,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:14,141 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-12 19:16:14,142 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-12 19:16:14,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:16:14,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:16:14,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:16:14,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:14,295 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:14,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:14,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:14,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623490839] [2022-07-12 19:16:14,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623490839] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:16:14,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:14,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 19:16:14,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401037543] [2022-07-12 19:16:14,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:14,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:16:14,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:14,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:16:14,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:16:14,350 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:14,365 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2022-07-12 19:16:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:16:14,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:16:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:14,366 INFO L225 Difference]: With dead ends: 74 [2022-07-12 19:16:14,366 INFO L226 Difference]: Without dead ends: 74 [2022-07-12 19:16:14,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:16:14,366 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 101 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:14,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 141 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:16:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-12 19:16:14,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-12 19:16:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.3125) internal successors, (84), 73 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-12 19:16:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-07-12 19:16:14,368 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 34 [2022-07-12 19:16:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:14,368 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-07-12 19:16:14,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-07-12 19:16:14,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:16:14,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:14,369 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, 1] [2022-07-12 19:16:14,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:14,569 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-12 19:16:14,569 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:16:14,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:14,570 INFO L85 PathProgramCache]: Analyzing trace with hash -674776798, now seen corresponding path program 1 times [2022-07-12 19:16:14,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:14,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691314109] [2022-07-12 19:16:14,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:14,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:14,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:14,571 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-12 19:16:14,572 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-12 19:16:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:14,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:16:14,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:16:14,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:16:14,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:14,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691314109] [2022-07-12 19:16:14,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691314109] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:16:14,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:14,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 19:16:14,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735760752] [2022-07-12 19:16:14,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:14,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:16:14,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:14,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:16:14,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:16:14,774 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:14,806 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-07-12 19:16:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:16:14,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:16:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:14,807 INFO L225 Difference]: With dead ends: 79 [2022-07-12 19:16:14,807 INFO L226 Difference]: Without dead ends: 79 [2022-07-12 19:16:14,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:16:14,807 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 102 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:14,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 118 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:16:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-12 19:16:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2022-07-12 19:16:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.296875) internal successors, (83), 73 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-12 19:16:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-07-12 19:16:14,819 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 34 [2022-07-12 19:16:14,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:14,820 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-07-12 19:16:14,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-07-12 19:16:14,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:16:14,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:14,821 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:14,830 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-12 19:16:15,021 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-12 19:16:15,022 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:16:15,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:15,022 INFO L85 PathProgramCache]: Analyzing trace with hash -634882153, now seen corresponding path program 1 times [2022-07-12 19:16:15,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:15,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664330757] [2022-07-12 19:16:15,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:15,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:15,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:15,023 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-12 19:16:15,024 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-12 19:16:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:15,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:16:15,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:16:15,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:16:15,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:15,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664330757] [2022-07-12 19:16:15,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664330757] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:16:15,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:15,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-12 19:16:15,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216167399] [2022-07-12 19:16:15,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:15,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:16:15,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:15,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:16:15,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:16:15,262 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:15,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:15,340 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-07-12 19:16:15,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:15,341 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:16:15,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:15,341 INFO L225 Difference]: With dead ends: 52 [2022-07-12 19:16:15,341 INFO L226 Difference]: Without dead ends: 52 [2022-07-12 19:16:15,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:16:15,342 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 102 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:15,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 126 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:16:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-12 19:16:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-07-12 19:16:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-07-12 19:16:15,343 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 34 [2022-07-12 19:16:15,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:15,343 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-07-12 19:16:15,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:15,344 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-07-12 19:16:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:16:15,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:15,347 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:15,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-12 19:16:15,554 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-12 19:16:15,555 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:16:15,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:15,555 INFO L85 PathProgramCache]: Analyzing trace with hash -427165146, now seen corresponding path program 2 times [2022-07-12 19:16:15,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:15,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242702378] [2022-07-12 19:16:15,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:16:15,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:15,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:15,557 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-12 19:16:15,558 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-12 19:16:15,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:16:15,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:16:15,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 19:16:15,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:15,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:16:15,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:15,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:15,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242702378] [2022-07-12 19:16:15,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242702378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:15,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:15,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:16:15,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128162524] [2022-07-12 19:16:15,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:15,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:16:15,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:15,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:16:15,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:15,739 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:15,959 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-07-12 19:16:15,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:16:15,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-12 19:16:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:15,959 INFO L225 Difference]: With dead ends: 62 [2022-07-12 19:16:15,959 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 19:16:15,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:16:15,960 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 110 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:15,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 61 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 19:16:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2022-07-12 19:16:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-07-12 19:16:15,961 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 39 [2022-07-12 19:16:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:15,962 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-07-12 19:16:15,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-07-12 19:16:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:16:15,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:15,962 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:15,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:16,167 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-12 19:16:16,169 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:16:16,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash -427165145, now seen corresponding path program 1 times [2022-07-12 19:16:16,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:16,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450547775] [2022-07-12 19:16:16,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:16,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:16,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:16,171 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-12 19:16:16,173 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-12 19:16:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:16,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 19:16:16,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:16,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:16:16,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:16,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:16,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450547775] [2022-07-12 19:16:16,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450547775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:16,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:16,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:16:16,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391597556] [2022-07-12 19:16:16,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:16,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:16:16,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:16,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:16:16,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:16,419 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:16,666 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-07-12 19:16:16,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:16:16,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-12 19:16:16,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:16,667 INFO L225 Difference]: With dead ends: 60 [2022-07-12 19:16:16,667 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 19:16:16,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:16:16,668 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 147 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:16,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 36 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 19:16:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-07-12 19:16:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-07-12 19:16:16,669 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 39 [2022-07-12 19:16:16,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:16,669 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-07-12 19:16:16,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-07-12 19:16:16,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:16:16,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:16,670 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:16,677 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-12 19:16:16,877 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-12 19:16:16,878 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:16:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:16,878 INFO L85 PathProgramCache]: Analyzing trace with hash -357219036, now seen corresponding path program 1 times [2022-07-12 19:16:16,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:16,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126570589] [2022-07-12 19:16:16,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:16,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:16,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:16,880 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:16:16,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 19:16:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:17,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:16:17,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:16:17,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:17,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:17,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126570589] [2022-07-12 19:16:17,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126570589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:17,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:17,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:16:17,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033300647] [2022-07-12 19:16:17,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:17,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:16:17,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:17,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:16:17,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:17,055 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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-12 19:16:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:17,219 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-07-12 19:16:17,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:16:17,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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 40 [2022-07-12 19:16:17,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:17,220 INFO L225 Difference]: With dead ends: 57 [2022-07-12 19:16:17,220 INFO L226 Difference]: Without dead ends: 57 [2022-07-12 19:16:17,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:16:17,221 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 134 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:17,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 58 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-12 19:16:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2022-07-12 19:16:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2022-07-12 19:16:17,222 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 40 [2022-07-12 19:16:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:17,222 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2022-07-12 19:16:17,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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-12 19:16:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-07-12 19:16:17,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:16:17,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:17,223 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:17,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:17,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:16:17,431 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:16:17,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:17,431 INFO L85 PathProgramCache]: Analyzing trace with hash 311339877, now seen corresponding path program 1 times [2022-07-12 19:16:17,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:17,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394454543] [2022-07-12 19:16:17,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:17,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:17,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:17,436 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:16:17,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-12 19:16:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:17,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:16:17,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:17,906 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:16:17,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:17,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:17,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394454543] [2022-07-12 19:16:17,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394454543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:17,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:17,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:16:17,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035838318] [2022-07-12 19:16:17,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:17,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:16:17,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:17,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:16:17,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:16:17,907 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:17,921 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-07-12 19:16:17,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:17,922 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-12 19:16:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:17,922 INFO L225 Difference]: With dead ends: 55 [2022-07-12 19:16:17,922 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 19:16:17,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:16:17,922 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 21 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:17,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 133 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2022-07-12 19:16:17,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 19:16:17,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-07-12 19:16:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-07-12 19:16:17,924 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 42 [2022-07-12 19:16:17,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:17,924 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-07-12 19:16:17,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:17,924 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-07-12 19:16:17,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:16:17,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:17,924 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:17,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:18,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:16:18,132 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:16:18,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:18,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912181, now seen corresponding path program 1 times [2022-07-12 19:16:18,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:18,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123691340] [2022-07-12 19:16:18,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:18,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:18,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:18,134 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:16:18,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 19:16:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:18,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 19:16:18,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:18,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:18,366 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:16:18,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-12 19:16:18,389 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-12 19:16:18,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:18,432 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 23 treesize of output 22 [2022-07-12 19:16:18,451 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:18,451 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-12 19:16:18,634 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:18,634 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 30 treesize of output 31 [2022-07-12 19:16:18,668 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 29 treesize of output 24 [2022-07-12 19:16:18,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-12 19:16:18,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:16:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 19:16:18,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:19,060 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (_ bv1 1)))) is different from false [2022-07-12 19:16:19,075 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-12 19:16:19,085 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_dll_update_at_~head#1.offset| (_ bv4 32))) v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_dll_update_at_~head#1.offset| (_ bv4 32))) v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (_ bv1 1)))) is different from false [2022-07-12 19:16:19,101 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_944) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2022-07-12 19:16:19,110 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0) v_ArrVal_944) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0)) |c_ULTIMATE.start_dll_create_#res#1.base|))) (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1) v_ArrVal_944) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-07-12 19:16:19,118 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0) v_ArrVal_944) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) v_ArrVal_944) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-07-12 19:16:19,133 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_944) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (_ bv1 1))) (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_944) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)))))) is different from false [2022-07-12 19:16:19,319 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:16:19,319 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 55 treesize of output 46 [2022-07-12 19:16:19,326 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 287 treesize of output 233 [2022-07-12 19:16:19,334 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 40 [2022-07-12 19:16:19,337 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 49 treesize of output 41 [2022-07-12 19:16:19,345 INFO L356 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2022-07-12 19:16:19,345 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 56 treesize of output 1 [2022-07-12 19:16:19,398 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2022-07-12 19:16:19,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:19,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123691340] [2022-07-12 19:16:19,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123691340] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:16:19,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:19,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 29 [2022-07-12 19:16:19,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624669743] [2022-07-12 19:16:19,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:19,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 19:16:19,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:19,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 19:16:19,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=447, Unknown=11, NotChecked=336, Total=870 [2022-07-12 19:16:19,401 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 30 states, 29 states have (on average 2.413793103448276) internal successors, (70), 30 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-12 19:16:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:20,500 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-07-12 19:16:20,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:16:20,501 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.413793103448276) internal successors, (70), 30 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 45 [2022-07-12 19:16:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:20,501 INFO L225 Difference]: With dead ends: 62 [2022-07-12 19:16:20,501 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 19:16:20,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=861, Unknown=11, NotChecked=462, Total=1482 [2022-07-12 19:16:20,502 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 49 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 425 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:20,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 247 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 467 Invalid, 0 Unknown, 425 Unchecked, 0.6s Time] [2022-07-12 19:16:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 19:16:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2022-07-12 19:16:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.150943396226415) internal successors, (61), 57 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-07-12 19:16:20,507 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 45 [2022-07-12 19:16:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:20,508 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-07-12 19:16:20,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.413793103448276) internal successors, (70), 30 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-12 19:16:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-07-12 19:16:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:16:20,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:20,508 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:20,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:20,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:16:20,709 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:16:20,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:20,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912180, now seen corresponding path program 1 times [2022-07-12 19:16:20,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:20,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082462835] [2022-07-12 19:16:20,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:20,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:20,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:20,711 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:16:20,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 19:16:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:20,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-12 19:16:20,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:20,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:20,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:20,980 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:20,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:16:20,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:16:21,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, 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-12 19:16:21,028 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-12 19:16:21,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:21,054 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 23 treesize of output 22 [2022-07-12 19:16:21,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:21,062 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 23 treesize of output 22 [2022-07-12 19:16:21,087 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:21,087 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-12 19:16:21,090 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-12 19:16:21,336 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:21,336 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 42 treesize of output 41 [2022-07-12 19:16:21,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:21,340 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 20 treesize of output 22 [2022-07-12 19:16:21,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 19:16:21,409 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 29 treesize of output 24 [2022-07-12 19:16:21,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-12 19:16:21,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:16:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 19:16:21,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:22,513 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2022-07-12 19:16:22,546 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2022-07-12 19:16:22,570 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_dll_update_at_~head#1.offset| (_ bv4 32))) v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_dll_update_at_~head#1.offset| (_ bv4 32)))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1020) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))))) is different from false [2022-07-12 19:16:22,602 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1021) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1020) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))))))) is different from false [2022-07-12 19:16:22,625 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_#res#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1021) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1020) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1)))))) (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3) v_ArrVal_1021) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2022-07-12 19:16:22,646 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1020) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3))))))) is different from false [2022-07-12 19:16:22,688 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1020) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2022-07-12 19:16:22,762 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1019) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1018) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1018)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1019) .cse2 v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1020) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))))))) is different from false [2022-07-12 19:16:22,827 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1015 (_ BitVec 32)) (v_ArrVal_1016 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1015)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1019) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1016)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1018) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_ArrVal_1021)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1015 (_ BitVec 32)) (v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1016 (_ BitVec 32)) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_1016)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1018)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (bvule (bvadd (_ bv8 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_1015)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1019) .cse4 v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_1020) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)))))))) is different from false [2022-07-12 19:16:22,872 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:16:22,872 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 109 treesize of output 100 [2022-07-12 19:16:22,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:22,885 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:16:22,885 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 79 treesize of output 70 [2022-07-12 19:16:22,889 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 102 treesize of output 84 [2022-07-12 19:16:22,892 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 174 treesize of output 144 [2022-07-12 19:16:22,901 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 102 treesize of output 86 [2022-07-12 19:16:22,903 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 124 treesize of output 100 [2022-07-12 19:16:22,909 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-12 19:16:22,955 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:16:22,956 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 109 treesize of output 115 [2022-07-12 19:16:22,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:22,972 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:16:22,973 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 94 treesize of output 70 [2022-07-12 19:16:22,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:22,980 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 92 treesize of output 56 [2022-07-12 19:16:22,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:22,985 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 50 treesize of output 32 [2022-07-12 19:16:22,990 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-12 19:16:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 10 not checked. [2022-07-12 19:16:29,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:29,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082462835] [2022-07-12 19:16:29,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082462835] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:16:29,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:29,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2022-07-12 19:16:29,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71334083] [2022-07-12 19:16:29,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:29,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-12 19:16:29,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:29,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-12 19:16:29,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=592, Unknown=9, NotChecked=504, Total=1190 [2022-07-12 19:16:29,984 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 35 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-12 19:16:34,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:34,811 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-07-12 19:16:34,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 19:16:34,812 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 35 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 45 [2022-07-12 19:16:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:34,813 INFO L225 Difference]: With dead ends: 66 [2022-07-12 19:16:34,813 INFO L226 Difference]: Without dead ends: 66 [2022-07-12 19:16:34,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=177, Invalid=1256, Unknown=9, NotChecked=720, Total=2162 [2022-07-12 19:16:34,814 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 79 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 582 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:34,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 213 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 473 Invalid, 0 Unknown, 582 Unchecked, 1.4s Time] [2022-07-12 19:16:34,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-12 19:16:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2022-07-12 19:16:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-07-12 19:16:34,816 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 45 [2022-07-12 19:16:34,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:34,816 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-07-12 19:16:34,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 35 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-12 19:16:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-07-12 19:16:34,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:16:34,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:34,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:34,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:35,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:16:35,017 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:16:35,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1960736865, now seen corresponding path program 1 times [2022-07-12 19:16:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:35,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126860477] [2022-07-12 19:16:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:35,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:35,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:35,019 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:16:35,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-12 19:16:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:35,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 19:16:35,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:35,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:35,352 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:35,353 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-12 19:16:35,404 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-12 19:16:35,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:35,444 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 23 treesize of output 22 [2022-07-12 19:16:35,492 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:35,493 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 33 treesize of output 34 [2022-07-12 19:16:35,929 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:35,929 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 29 treesize of output 30 [2022-07-12 19:16:36,023 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 28 treesize of output 23 [2022-07-12 19:16:36,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-12 19:16:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 19:16:36,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:36,514 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1091) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv0 32)))) is different from false [2022-07-12 19:16:36,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1091) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-07-12 19:16:36,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_dll_update_at_~head#1.offset| (_ bv4 32))) v_ArrVal_1091) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-07-12 19:16:36,557 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1091) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (_ bv0 32)))) is different from false [2022-07-12 19:16:36,567 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0) v_ArrVal_1091) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0)) (_ bv0 32)))) is different from false [2022-07-12 19:16:36,578 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0) v_ArrVal_1091) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0)) (_ bv0 32)))) is different from false [2022-07-12 19:16:36,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1091) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (_ bv0 32)))) is different from false [2022-07-12 19:16:36,609 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1090))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1091)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))))) is different from false [2022-07-12 19:16:36,634 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1089 (_ BitVec 32)) (v_ArrVal_1091 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1089)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1090))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1091)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) (_ bv0 32)))) is different from false [2022-07-12 19:16:36,688 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:16:36,688 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 55 treesize of output 46 [2022-07-12 19:16:36,693 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 167 treesize of output 131 [2022-07-12 19:16:36,711 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 8 treesize of output 4 [2022-07-12 19:16:36,717 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 8 treesize of output 4 [2022-07-12 19:16:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 10 not checked. [2022-07-12 19:16:37,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:37,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126860477] [2022-07-12 19:16:37,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126860477] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:16:37,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:37,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 32 [2022-07-12 19:16:37,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360005388] [2022-07-12 19:16:37,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:37,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 19:16:37,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:37,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 19:16:37,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=455, Unknown=9, NotChecked=450, Total=992 [2022-07-12 19:16:37,028 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 32 states, 32 states have (on average 2.4375) internal successors, (78), 32 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:39,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:39,410 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2022-07-12 19:16:39,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 19:16:39,411 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 32 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-12 19:16:39,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:39,411 INFO L225 Difference]: With dead ends: 63 [2022-07-12 19:16:39,411 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 19:16:39,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=183, Invalid=1103, Unknown=10, NotChecked=684, Total=1980 [2022-07-12 19:16:39,412 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 58 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 464 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:39,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 309 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 350 Invalid, 0 Unknown, 464 Unchecked, 1.1s Time] [2022-07-12 19:16:39,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 19:16:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-07-12 19:16:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-07-12 19:16:39,413 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 46 [2022-07-12 19:16:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:39,414 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-07-12 19:16:39,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 32 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-07-12 19:16:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 19:16:39,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:39,414 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:39,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-12 19:16:39,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:16:39,615 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:16:39,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:39,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1223965472, now seen corresponding path program 1 times [2022-07-12 19:16:39,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:39,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595921677] [2022-07-12 19:16:39,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:39,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:39,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:39,616 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:16:39,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-12 19:16:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:39,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 19:16:39,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:39,945 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:16:39,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-12 19:16:40,148 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 19:16:40,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 19:16:40,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:16:40,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:40,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:16:40,398 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:40,399 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-07-12 19:16:41,067 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:41,067 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-12 19:16:41,218 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 35 treesize of output 26 [2022-07-12 19:16:41,436 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 31 treesize of output 15 [2022-07-12 19:16:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 19:16:41,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:43,573 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1159) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:16:43,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1159) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:16:43,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0) v_ArrVal_1159) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:16:43,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0) v_ArrVal_1159) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:16:43,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_1159) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:16:43,928 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1158 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1158))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1159)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:16:43,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1156 (_ BitVec 32))) (bvult (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1156)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1158))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1159)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:16:44,012 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:16:44,012 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 54 treesize of output 45 [2022-07-12 19:16:44,028 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 278 treesize of output 224 [2022-07-12 19:16:44,034 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 166 treesize of output 150 [2022-07-12 19:16:44,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 118 [2022-07-12 19:16:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-07-12 19:16:44,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:44,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595921677] [2022-07-12 19:16:44,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595921677] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:16:44,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:44,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 35 [2022-07-12 19:16:44,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467014760] [2022-07-12 19:16:44,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:44,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 19:16:44,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:44,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 19:16:44,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=712, Unknown=33, NotChecked=420, Total=1260 [2022-07-12 19:16:44,535 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 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-12 19:16:47,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:47,790 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-07-12 19:16:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 19:16:47,791 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 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 48 [2022-07-12 19:16:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:47,791 INFO L225 Difference]: With dead ends: 62 [2022-07-12 19:16:47,791 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 19:16:47,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=198, Invalid=1513, Unknown=39, NotChecked=602, Total=2352 [2022-07-12 19:16:47,792 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 489 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:47,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 324 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 399 Invalid, 0 Unknown, 489 Unchecked, 1.2s Time] [2022-07-12 19:16:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 19:16:47,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-07-12 19:16:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 60 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-07-12 19:16:47,794 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 48 [2022-07-12 19:16:47,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:47,794 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-07-12 19:16:47,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 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-12 19:16:47,794 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-07-12 19:16:47,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:16:47,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:47,795 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:47,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-07-12 19:16:48,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:16:48,004 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-12 19:16:48,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:48,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1116795216, now seen corresponding path program 2 times [2022-07-12 19:16:48,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:48,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981482896] [2022-07-12 19:16:48,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:16:48,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:48,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:48,006 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:16:48,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-12 19:16:48,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:16:48,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:16:48,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-12 19:16:48,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:48,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:48,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:16:48,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:16:48,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:48,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:16:48,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:48,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:16:48,461 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:48,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-12 19:16:48,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:16:48,539 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-12 19:16:48,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:16:48,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:16:48,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:48,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 19:16:48,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:48,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 19:16:48,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:48,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:48,724 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:16:48,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2022-07-12 19:16:48,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-07-12 19:16:49,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:49,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:49,434 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:16:49,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 67 [2022-07-12 19:16:49,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:49,461 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-12 19:16:49,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2022-07-12 19:16:49,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-12 19:16:49,610 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:16:49,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2022-07-12 19:16:50,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:50,279 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-12 19:16:50,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2022-07-12 19:16:50,298 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:16:50,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-12 19:16:50,550 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 19:16:50,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:21,771 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-12 19:18:21,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 853 treesize of output 590 [2022-07-12 19:18:21,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:18:21,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:18:21,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 573 treesize of output 470 [2022-07-12 19:18:22,280 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-12 19:18:22,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 853 treesize of output 670 [2022-07-12 19:18:22,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:18:22,426 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:18:22,427 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 653 treesize of output 470