./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:15:51,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:15:51,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:15:51,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:15:51,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:15:51,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:15:51,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:15:51,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:15:51,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:15:51,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:15:51,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:15:51,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:15:51,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:15:51,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:15:51,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:15:51,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:15:51,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:15:51,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:15:51,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:15:51,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:15:51,588 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:15:51,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:15:51,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:15:51,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:15:51,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:15:51,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:15:51,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:15:51,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:15:51,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:15:51,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:15:51,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:15:51,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:15:51,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:15:51,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:15:51,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:15:51,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:15:51,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:15:51,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:15:51,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:15:51,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:15:51,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:15:51,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:15:51,608 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:15:51,632 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:15:51,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:15:51,632 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:15:51,633 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:15:51,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:15:51,633 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:15:51,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:15:51,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:15:51,634 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:15:51,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:15:51,635 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:15:51,635 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:15:51,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:15:51,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:15:51,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:15:51,636 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:15:51,636 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:15:51,636 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:15:51,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:15:51,636 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:15:51,637 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:15:51,637 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:15:51,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:15:51,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:15:51,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:15:51,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:15:51,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:15:51,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:15:51,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:15:51,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:15:51,638 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 -> 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 [2022-07-21 17:15:51,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:15:51,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:15:51,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:15:51,923 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:15:51,925 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:15:51,926 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2022-07-21 17:15:51,967 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42f42610/6fa8b34a51eb4d259ecf7f1c36af9179/FLAG457a174d8 [2022-07-21 17:15:52,363 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:15:52,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2022-07-21 17:15:52,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42f42610/6fa8b34a51eb4d259ecf7f1c36af9179/FLAG457a174d8 [2022-07-21 17:15:52,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42f42610/6fa8b34a51eb4d259ecf7f1c36af9179 [2022-07-21 17:15:52,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:15:52,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:15:52,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:15:52,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:15:52,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:15:52,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:15:52" (1/1) ... [2022-07-21 17:15:52,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e7062b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:15:52, skipping insertion in model container [2022-07-21 17:15:52,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:15:52" (1/1) ... [2022-07-21 17:15:52,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:15:52,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:15:52,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:15:52,667 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:15:52,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:15:52,732 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:15:52,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:15:52 WrapperNode [2022-07-21 17:15:52,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:15:52,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:15:52,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:15:52,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:15:52,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:15:52" (1/1) ... [2022-07-21 17:15:52,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:15:52" (1/1) ... [2022-07-21 17:15:52,800 INFO L137 Inliner]: procedures = 125, calls = 94, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 304 [2022-07-21 17:15:52,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:15:52,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:15:52,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:15:52,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:15:52,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:15:52" (1/1) ... [2022-07-21 17:15:52,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:15:52" (1/1) ... [2022-07-21 17:15:52,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:15:52" (1/1) ... [2022-07-21 17:15:52,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:15:52" (1/1) ... [2022-07-21 17:15:52,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:15:52" (1/1) ... [2022-07-21 17:15:52,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:15:52" (1/1) ... [2022-07-21 17:15:52,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:15:52" (1/1) ... [2022-07-21 17:15:52,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:15:52,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:15:52,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:15:52,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:15:52,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:15:52" (1/1) ... [2022-07-21 17:15:52,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:15:52,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:15:52,888 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-21 17:15:52,909 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-21 17:15:52,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 17:15:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 17:15:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:15:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:15:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:15:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:15:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:15:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 17:15:52,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:15:52,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:15:52,921 INFO L130 BoogieDeclarations]: Found specification of procedure append [2022-07-21 17:15:52,921 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2022-07-21 17:15:52,998 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:15:52,999 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:15:53,472 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:15:53,477 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:15:53,477 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-21 17:15:53,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:15:53 BoogieIcfgContainer [2022-07-21 17:15:53,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:15:53,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:15:53,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:15:53,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:15:53,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:15:52" (1/3) ... [2022-07-21 17:15:53,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e19df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:15:53, skipping insertion in model container [2022-07-21 17:15:53,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:15:52" (2/3) ... [2022-07-21 17:15:53,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e19df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:15:53, skipping insertion in model container [2022-07-21 17:15:53,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:15:53" (3/3) ... [2022-07-21 17:15:53,484 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2022-07-21 17:15:53,492 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:15:53,492 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2022-07-21 17:15:53,529 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:15:53,533 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@4485a94e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69e69dd6 [2022-07-21 17:15:53,533 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2022-07-21 17:15:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 323 states, 160 states have (on average 2.1375) internal successors, (342), 309 states have internal predecessors, (342), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:15:53,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:15:53,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:15:53,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:15:53,540 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:15:53,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:15:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-21 17:15:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:15:53,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778458630] [2022-07-21 17:15:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:15:53,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:15:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:15:53,634 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-21 17:15:53,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:15:53,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778458630] [2022-07-21 17:15:53,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778458630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:15:53,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:15:53,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:15:53,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239865100] [2022-07-21 17:15:53,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:15:53,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:15:53,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:15:53,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:15:53,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:15:53,657 INFO L87 Difference]: Start difference. First operand has 323 states, 160 states have (on average 2.1375) internal successors, (342), 309 states have internal predecessors, (342), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:15:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:15:53,980 INFO L93 Difference]: Finished difference Result 548 states and 601 transitions. [2022-07-21 17:15:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:15:53,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-21 17:15:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:15:53,990 INFO L225 Difference]: With dead ends: 548 [2022-07-21 17:15:53,990 INFO L226 Difference]: Without dead ends: 546 [2022-07-21 17:15:53,991 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-21 17:15:53,994 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 246 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:15:53,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 436 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:15:54,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-21 17:15:54,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 407. [2022-07-21 17:15:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 247 states have (on average 2.0890688259109313) internal successors, (516), 393 states have internal predecessors, (516), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:15:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 544 transitions. [2022-07-21 17:15:54,041 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 544 transitions. Word has length 3 [2022-07-21 17:15:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:15:54,042 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 544 transitions. [2022-07-21 17:15:54,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:15:54,042 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 544 transitions. [2022-07-21 17:15:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:15:54,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:15:54,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:15:54,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 17:15:54,043 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:15:54,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:15:54,044 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-21 17:15:54,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:15:54,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351532611] [2022-07-21 17:15:54,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:15:54,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:15:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:15:54,083 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-21 17:15:54,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:15:54,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351532611] [2022-07-21 17:15:54,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351532611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:15:54,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:15:54,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:15:54,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629377540] [2022-07-21 17:15:54,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:15:54,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:15:54,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:15:54,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:15:54,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:15:54,087 INFO L87 Difference]: Start difference. First operand 407 states and 544 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:15:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:15:54,227 INFO L93 Difference]: Finished difference Result 408 states and 547 transitions. [2022-07-21 17:15:54,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:15:54,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-21 17:15:54,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:15:54,229 INFO L225 Difference]: With dead ends: 408 [2022-07-21 17:15:54,230 INFO L226 Difference]: Without dead ends: 408 [2022-07-21 17:15:54,233 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-21 17:15:54,234 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 6 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:15:54,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 554 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:15:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-07-21 17:15:54,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 405. [2022-07-21 17:15:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 247 states have (on average 2.080971659919028) internal successors, (514), 391 states have internal predecessors, (514), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:15:54,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 542 transitions. [2022-07-21 17:15:54,259 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 542 transitions. Word has length 3 [2022-07-21 17:15:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:15:54,259 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 542 transitions. [2022-07-21 17:15:54,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:15:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 542 transitions. [2022-07-21 17:15:54,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 17:15:54,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:15:54,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:15:54,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 17:15:54,264 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:15:54,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:15:54,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1117390162, now seen corresponding path program 1 times [2022-07-21 17:15:54,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:15:54,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876249535] [2022-07-21 17:15:54,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:15:54,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:15:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:15:54,300 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-21 17:15:54,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:15:54,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876249535] [2022-07-21 17:15:54,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876249535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:15:54,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:15:54,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:15:54,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152163839] [2022-07-21 17:15:54,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:15:54,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:15:54,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:15:54,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:15:54,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:15:54,303 INFO L87 Difference]: Start difference. First operand 405 states and 542 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-21 17:15:54,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:15:54,453 INFO L93 Difference]: Finished difference Result 400 states and 537 transitions. [2022-07-21 17:15:54,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:15:54,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 10 [2022-07-21 17:15:54,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:15:54,455 INFO L225 Difference]: With dead ends: 400 [2022-07-21 17:15:54,455 INFO L226 Difference]: Without dead ends: 400 [2022-07-21 17:15:54,455 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-21 17:15:54,458 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 43 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:15:54,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 497 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:15:54,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-07-21 17:15:54,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2022-07-21 17:15:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 247 states have (on average 2.0607287449392713) internal successors, (509), 386 states have internal predecessors, (509), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:15:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 537 transitions. [2022-07-21 17:15:54,465 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 537 transitions. Word has length 10 [2022-07-21 17:15:54,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:15:54,466 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 537 transitions. [2022-07-21 17:15:54,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-21 17:15:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 537 transitions. [2022-07-21 17:15:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 17:15:54,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:15:54,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:15:54,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 17:15:54,467 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:15:54,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:15:54,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1117390163, now seen corresponding path program 1 times [2022-07-21 17:15:54,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:15:54,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153746434] [2022-07-21 17:15:54,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:15:54,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:15:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:15:54,500 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-21 17:15:54,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:15:54,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153746434] [2022-07-21 17:15:54,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153746434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:15:54,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:15:54,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:15:54,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126045819] [2022-07-21 17:15:54,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:15:54,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:15:54,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:15:54,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:15:54,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:15:54,502 INFO L87 Difference]: Start difference. First operand 400 states and 537 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-21 17:15:54,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:15:54,634 INFO L93 Difference]: Finished difference Result 395 states and 532 transitions. [2022-07-21 17:15:54,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:15:54,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 10 [2022-07-21 17:15:54,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:15:54,636 INFO L225 Difference]: With dead ends: 395 [2022-07-21 17:15:54,637 INFO L226 Difference]: Without dead ends: 395 [2022-07-21 17:15:54,637 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-21 17:15:54,637 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 38 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:15:54,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 510 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:15:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-07-21 17:15:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2022-07-21 17:15:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 247 states have (on average 2.0404858299595143) internal successors, (504), 381 states have internal predecessors, (504), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:15:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 532 transitions. [2022-07-21 17:15:54,658 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 532 transitions. Word has length 10 [2022-07-21 17:15:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:15:54,658 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 532 transitions. [2022-07-21 17:15:54,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-21 17:15:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 532 transitions. [2022-07-21 17:15:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:15:54,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:15:54,659 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:15:54,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 17:15:54,659 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:15:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:15:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash 279357079, now seen corresponding path program 1 times [2022-07-21 17:15:54,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:15:54,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118255151] [2022-07-21 17:15:54,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:15:54,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:15:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:15:54,731 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-21 17:15:54,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:15:54,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118255151] [2022-07-21 17:15:54,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118255151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:15:54,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:15:54,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:15:54,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839721422] [2022-07-21 17:15:54,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:15:54,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:15:54,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:15:54,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:15:54,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:15:54,733 INFO L87 Difference]: Start difference. First operand 395 states and 532 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-21 17:15:55,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:15:55,138 INFO L93 Difference]: Finished difference Result 523 states and 574 transitions. [2022-07-21 17:15:55,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:15:55,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) Word has length 11 [2022-07-21 17:15:55,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:15:55,140 INFO L225 Difference]: With dead ends: 523 [2022-07-21 17:15:55,140 INFO L226 Difference]: Without dead ends: 523 [2022-07-21 17:15:55,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:15:55,141 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 318 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:15:55,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 806 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:15:55,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-07-21 17:15:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 387. [2022-07-21 17:15:55,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 247 states have (on average 2.0080971659919027) internal successors, (496), 373 states have internal predecessors, (496), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:15:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 524 transitions. [2022-07-21 17:15:55,149 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 524 transitions. Word has length 11 [2022-07-21 17:15:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:15:55,149 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 524 transitions. [2022-07-21 17:15:55,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-21 17:15:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 524 transitions. [2022-07-21 17:15:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:15:55,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:15:55,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:15:55,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 17:15:55,151 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:15:55,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:15:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash 279357080, now seen corresponding path program 1 times [2022-07-21 17:15:55,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:15:55,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676466608] [2022-07-21 17:15:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:15:55,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:15:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:15:55,215 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-21 17:15:55,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:15:55,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676466608] [2022-07-21 17:15:55,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676466608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:15:55,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:15:55,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:15:55,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722693655] [2022-07-21 17:15:55,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:15:55,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:15:55,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:15:55,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:15:55,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:15:55,217 INFO L87 Difference]: Start difference. First operand 387 states and 524 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-21 17:15:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:15:55,686 INFO L93 Difference]: Finished difference Result 513 states and 564 transitions. [2022-07-21 17:15:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:15:55,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) Word has length 11 [2022-07-21 17:15:55,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:15:55,688 INFO L225 Difference]: With dead ends: 513 [2022-07-21 17:15:55,688 INFO L226 Difference]: Without dead ends: 513 [2022-07-21 17:15:55,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:15:55,689 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 804 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:15:55,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 447 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:15:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-21 17:15:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 378. [2022-07-21 17:15:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 247 states have (on average 1.9676113360323886) internal successors, (486), 364 states have internal predecessors, (486), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:15:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 514 transitions. [2022-07-21 17:15:55,696 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 514 transitions. Word has length 11 [2022-07-21 17:15:55,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:15:55,696 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 514 transitions. [2022-07-21 17:15:55,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-21 17:15:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 514 transitions. [2022-07-21 17:15:55,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:15:55,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:15:55,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:15:55,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 17:15:55,697 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:15:55,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:15:55,698 INFO L85 PathProgramCache]: Analyzing trace with hash 693745101, now seen corresponding path program 1 times [2022-07-21 17:15:55,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:15:55,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093931772] [2022-07-21 17:15:55,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:15:55,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:15:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:15:55,781 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-21 17:15:55,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:15:55,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093931772] [2022-07-21 17:15:55,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093931772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:15:55,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:15:55,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:15:55,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949978492] [2022-07-21 17:15:55,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:15:55,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:15:55,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:15:55,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:15:55,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:15:55,784 INFO L87 Difference]: Start difference. First operand 378 states and 514 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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-21 17:15:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:15:56,001 INFO L93 Difference]: Finished difference Result 398 states and 537 transitions. [2022-07-21 17:15:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:15:56,002 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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) Word has length 20 [2022-07-21 17:15:56,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:15:56,003 INFO L225 Difference]: With dead ends: 398 [2022-07-21 17:15:56,003 INFO L226 Difference]: Without dead ends: 398 [2022-07-21 17:15:56,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:15:56,006 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 32 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:15:56,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1568 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:15:56,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-07-21 17:15:56,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 386. [2022-07-21 17:15:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 254 states have (on average 1.9448818897637796) internal successors, (494), 371 states have internal predecessors, (494), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-21 17:15:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 524 transitions. [2022-07-21 17:15:56,014 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 524 transitions. Word has length 20 [2022-07-21 17:15:56,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:15:56,015 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 524 transitions. [2022-07-21 17:15:56,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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-21 17:15:56,015 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 524 transitions. [2022-07-21 17:15:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:15:56,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:15:56,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:15:56,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 17:15:56,016 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:15:56,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:15:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash -964577360, now seen corresponding path program 1 times [2022-07-21 17:15:56,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:15:56,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649409512] [2022-07-21 17:15:56,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:15:56,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:15:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:15:56,174 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-21 17:15:56,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:15:56,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649409512] [2022-07-21 17:15:56,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649409512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:15:56,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:15:56,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:15:56,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516965350] [2022-07-21 17:15:56,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:15:56,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:15:56,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:15:56,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:15:56,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:15:56,176 INFO L87 Difference]: Start difference. First operand 386 states and 524 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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-21 17:15:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:15:56,698 INFO L93 Difference]: Finished difference Result 526 states and 579 transitions. [2022-07-21 17:15:56,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:15:56,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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) Word has length 22 [2022-07-21 17:15:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:15:56,700 INFO L225 Difference]: With dead ends: 526 [2022-07-21 17:15:56,700 INFO L226 Difference]: Without dead ends: 526 [2022-07-21 17:15:56,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:15:56,701 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 753 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:15:56,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1277 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 17:15:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-21 17:15:56,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 389. [2022-07-21 17:15:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 257 states have (on average 1.933852140077821) internal successors, (497), 374 states have internal predecessors, (497), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-21 17:15:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 527 transitions. [2022-07-21 17:15:56,709 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 527 transitions. Word has length 22 [2022-07-21 17:15:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:15:56,710 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 527 transitions. [2022-07-21 17:15:56,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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-21 17:15:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 527 transitions. [2022-07-21 17:15:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 17:15:56,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:15:56,713 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:15:56,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 17:15:56,714 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:15:56,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:15:56,714 INFO L85 PathProgramCache]: Analyzing trace with hash -339455757, now seen corresponding path program 1 times [2022-07-21 17:15:56,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:15:56,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212519092] [2022-07-21 17:15:56,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:15:56,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:15:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:15:56,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 17:15:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:15:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:15:57,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:15:57,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212519092] [2022-07-21 17:15:57,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212519092] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:15:57,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337529654] [2022-07-21 17:15:57,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:15:57,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:15:57,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:15:57,112 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-21 17:15:57,156 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-21 17:15:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:15:57,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-21 17:15:57,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:15:57,297 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-21 17:15:57,467 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-21 17:15:57,521 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:15:57,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-21 17:15:57,534 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-21 17:15:57,619 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:15:57,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 17:15:57,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:15:57,735 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-21 17:15:57,736 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 29 treesize of output 28 [2022-07-21 17:15:57,852 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-07-21 17:15:57,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-07-21 17:15:57,900 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 38 treesize of output 36 [2022-07-21 17:15:57,998 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 38 treesize of output 36 [2022-07-21 17:15:58,049 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 38 treesize of output 36 [2022-07-21 17:15:58,096 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:15:58,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2022-07-21 17:15:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:15:58,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:15:58,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_21 Int) (v_ArrVal_322 (Array Int Int))) (or (= (select (store |c_#valid| v_append_~node~0.base_21 1) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_21 v_ArrVal_322) |c_append_#in~head.base|) (+ 4 |c_append_#in~head.offset|))) 1) (not (= (select |c_#valid| v_append_~node~0.base_21) 0)))) is different from false [2022-07-21 17:15:58,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_21 Int) (v_ArrVal_322 (Array Int Int))) (or (not (= (select |c_#valid| v_append_~node~0.base_21) 0)) (= (select (store |c_#valid| v_append_~node~0.base_21 1) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_21 v_ArrVal_322) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1))) is different from false [2022-07-21 17:15:58,293 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:15:58,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-21 17:15:58,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:15:58,302 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 332 treesize of output 218 [2022-07-21 17:15:58,308 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 91 treesize of output 83 [2022-07-21 17:15:58,313 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 174 treesize of output 158 [2022-07-21 17:15:58,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337529654] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:15:58,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:15:58,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2022-07-21 17:15:58,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294417135] [2022-07-21 17:15:58,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:15:58,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-21 17:15:58,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:15:58,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-21 17:15:58,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=824, Unknown=12, NotChecked=118, Total=1056 [2022-07-21 17:15:58,806 INFO L87 Difference]: Start difference. First operand 389 states and 527 transitions. Second operand has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 24 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:15:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:15:59,675 INFO L93 Difference]: Finished difference Result 432 states and 590 transitions. [2022-07-21 17:15:59,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 17:15:59,676 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 24 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-07-21 17:15:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:15:59,679 INFO L225 Difference]: With dead ends: 432 [2022-07-21 17:15:59,679 INFO L226 Difference]: Without dead ends: 432 [2022-07-21 17:15:59,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=1176, Unknown=12, NotChecked=142, Total=1482 [2022-07-21 17:15:59,680 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 91 mSDsluCounter, 3248 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 3558 SdHoareTripleChecker+Invalid, 2184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 658 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:15:59,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 3558 Invalid, 2184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1507 Invalid, 0 Unknown, 658 Unchecked, 0.6s Time] [2022-07-21 17:15:59,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-07-21 17:15:59,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 426. [2022-07-21 17:15:59,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 290 states have (on average 1.8551724137931034) internal successors, (538), 409 states have internal predecessors, (538), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (32), 15 states have call predecessors, (32), 17 states have call successors, (32) [2022-07-21 17:15:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 587 transitions. [2022-07-21 17:15:59,689 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 587 transitions. Word has length 37 [2022-07-21 17:15:59,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:15:59,690 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 587 transitions. [2022-07-21 17:15:59,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 24 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:15:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 587 transitions. [2022-07-21 17:15:59,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 17:15:59,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:15:59,691 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:15:59,723 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-21 17:15:59,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:15:59,908 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:15:59,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:15:59,909 INFO L85 PathProgramCache]: Analyzing trace with hash -339455756, now seen corresponding path program 1 times [2022-07-21 17:15:59,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:15:59,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588366564] [2022-07-21 17:15:59,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:15:59,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:15:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:00,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 17:16:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:16:00,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:16:00,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588366564] [2022-07-21 17:16:00,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588366564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:16:00,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220160112] [2022-07-21 17:16:00,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:00,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:16:00,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:16:00,442 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-21 17:16:00,455 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-21 17:16:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:00,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-21 17:16:00,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:00,561 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-21 17:16:00,764 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-21 17:16:00,767 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-21 17:16:00,828 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:00,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-21 17:16:00,854 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:00,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-21 17:16:00,860 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-21 17:16:00,870 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-21 17:16:00,967 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:00,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 17:16:00,981 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:00,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 17:16:01,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:01,213 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-21 17:16:01,213 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 29 treesize of output 28 [2022-07-21 17:16:01,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:01,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 28 [2022-07-21 17:16:01,344 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-21 17:16:01,345 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 22 treesize of output 24 [2022-07-21 17:16:01,390 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 46 treesize of output 44 [2022-07-21 17:16:01,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 35 [2022-07-21 17:16:01,498 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 46 treesize of output 44 [2022-07-21 17:16:01,501 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 35 [2022-07-21 17:16:01,540 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 46 treesize of output 44 [2022-07-21 17:16:01,543 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 35 [2022-07-21 17:16:01,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:01,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-21 17:16:01,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:01,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-07-21 17:16:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:16:01,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:16:01,686 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_509 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (let ((.cse0 (+ c_append_~head.offset 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_510) c_append_~head.base) .cse0) 9) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_509) c_append_~head.base) .cse0))))) (forall ((v_ArrVal_510 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_510) c_append_~head.base) (+ c_append_~head.offset 4)) 5)))) is different from false [2022-07-21 17:16:02,062 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:02,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-07-21 17:16:02,070 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:02,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2022-07-21 17:16:02,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:02,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:02,081 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 74 treesize of output 74 [2022-07-21 17:16:02,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:02,090 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:02,090 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 108 treesize of output 102 [2022-07-21 17:16:02,095 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 86 treesize of output 78 [2022-07-21 17:16:02,100 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 42 treesize of output 34 [2022-07-21 17:16:02,171 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 17:16:02,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2022-07-21 17:16:02,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:16:03,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220160112] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:16:03,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:16:03,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2022-07-21 17:16:03,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724789460] [2022-07-21 17:16:03,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:16:03,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 17:16:03,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:16:03,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 17:16:03,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=4, NotChecked=60, Total=1056 [2022-07-21 17:16:03,378 INFO L87 Difference]: Start difference. First operand 426 states and 587 transitions. Second operand has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 23 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:16:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:16:05,212 INFO L93 Difference]: Finished difference Result 495 states and 664 transitions. [2022-07-21 17:16:05,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 17:16:05,213 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 23 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-07-21 17:16:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:16:05,215 INFO L225 Difference]: With dead ends: 495 [2022-07-21 17:16:05,215 INFO L226 Difference]: Without dead ends: 495 [2022-07-21 17:16:05,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=268, Invalid=1894, Unknown=4, NotChecked=90, Total=2256 [2022-07-21 17:16:05,216 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 168 mSDsluCounter, 3256 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 3575 SdHoareTripleChecker+Invalid, 3230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1180 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 17:16:05,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 3575 Invalid, 3230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1990 Invalid, 0 Unknown, 1180 Unchecked, 0.9s Time] [2022-07-21 17:16:05,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-07-21 17:16:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 480. [2022-07-21 17:16:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 339 states have (on average 1.761061946902655) internal successors, (597), 459 states have internal predecessors, (597), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (37), 17 states have call predecessors, (37), 20 states have call successors, (37) [2022-07-21 17:16:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 654 transitions. [2022-07-21 17:16:05,228 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 654 transitions. Word has length 37 [2022-07-21 17:16:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:16:05,229 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 654 transitions. [2022-07-21 17:16:05,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 23 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:16:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 654 transitions. [2022-07-21 17:16:05,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:16:05,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:05,233 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:16:05,251 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-21 17:16:05,447 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,SelfDestructingSolverStorable9 [2022-07-21 17:16:05,448 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:05,449 INFO L85 PathProgramCache]: Analyzing trace with hash -794458392, now seen corresponding path program 1 times [2022-07-21 17:16:05,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:16:05,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442162874] [2022-07-21 17:16:05,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:05,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:16:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:05,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 17:16:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:16:05,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:16:05,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442162874] [2022-07-21 17:16:05,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442162874] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:16:05,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654535243] [2022-07-21 17:16:05,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:05,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:16:05,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:16:05,781 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-21 17:16:05,810 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-21 17:16:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:05,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-21 17:16:05,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:05,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:16:06,046 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-21 17:16:06,076 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-21 17:16:06,082 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-21 17:16:06,116 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:06,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 17:16:06,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:06,168 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-21 17:16:06,168 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 29 treesize of output 28 [2022-07-21 17:16:06,269 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-07-21 17:16:06,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-07-21 17:16:06,307 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 38 treesize of output 36 [2022-07-21 17:16:06,406 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 38 treesize of output 36 [2022-07-21 17:16:06,426 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 38 treesize of output 36 [2022-07-21 17:16:06,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:06,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2022-07-21 17:16:06,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:16:06,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:16:06,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_698) c_append_~head.base) (+ c_append_~head.offset 4))) 1)) is different from false [2022-07-21 17:16:06,636 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:06,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-21 17:16:06,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:06,642 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 170 treesize of output 122 [2022-07-21 17:16:06,646 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 86 treesize of output 78 [2022-07-21 17:16:06,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-07-21 17:16:06,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654535243] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:16:06,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:16:06,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2022-07-21 17:16:06,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957788795] [2022-07-21 17:16:06,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:16:06,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-21 17:16:06,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:16:06,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-21 17:16:06,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1006, Unknown=3, NotChecked=64, Total=1190 [2022-07-21 17:16:06,934 INFO L87 Difference]: Start difference. First operand 480 states and 654 transitions. Second operand has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 25 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:16:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:16:08,249 INFO L93 Difference]: Finished difference Result 649 states and 738 transitions. [2022-07-21 17:16:08,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 17:16:08,250 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 25 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-07-21 17:16:08,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:16:08,253 INFO L225 Difference]: With dead ends: 649 [2022-07-21 17:16:08,253 INFO L226 Difference]: Without dead ends: 649 [2022-07-21 17:16:08,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=280, Invalid=1701, Unknown=3, NotChecked=86, Total=2070 [2022-07-21 17:16:08,254 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 1113 mSDsluCounter, 3014 mSDsCounter, 0 mSdLazyCounter, 2253 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 888 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 17:16:08,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 3213 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2253 Invalid, 0 Unknown, 888 Unchecked, 0.9s Time] [2022-07-21 17:16:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-07-21 17:16:08,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 450. [2022-07-21 17:16:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 312 states have (on average 1.7916666666666667) internal successors, (559), 431 states have internal predecessors, (559), 18 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (34), 16 states have call predecessors, (34), 18 states have call successors, (34) [2022-07-21 17:16:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 611 transitions. [2022-07-21 17:16:08,263 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 611 transitions. Word has length 39 [2022-07-21 17:16:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:16:08,263 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 611 transitions. [2022-07-21 17:16:08,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 25 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:16:08,263 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 611 transitions. [2022-07-21 17:16:08,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:16:08,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:08,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:16:08,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 17:16:08,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:16:08,479 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:08,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:08,480 INFO L85 PathProgramCache]: Analyzing trace with hash -794458391, now seen corresponding path program 1 times [2022-07-21 17:16:08,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:16:08,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119805739] [2022-07-21 17:16:08,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:08,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:16:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:08,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 17:16:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:16:08,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:16:08,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119805739] [2022-07-21 17:16:08,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119805739] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:16:08,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474890602] [2022-07-21 17:16:08,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:08,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:16:08,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:16:08,828 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-21 17:16:08,829 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-21 17:16:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:08,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-21 17:16:08,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:08,944 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-21 17:16:09,114 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-21 17:16:09,117 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-21 17:16:09,169 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:09,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-21 17:16:09,182 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:09,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-21 17:16:09,188 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-21 17:16:09,198 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-21 17:16:09,282 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:09,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 17:16:09,294 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:09,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 17:16:09,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:09,489 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-21 17:16:09,490 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 29 treesize of output 28 [2022-07-21 17:16:09,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:09,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 28 [2022-07-21 17:16:09,640 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-21 17:16:09,640 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 22 treesize of output 24 [2022-07-21 17:16:09,685 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 46 treesize of output 44 [2022-07-21 17:16:09,688 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 35 [2022-07-21 17:16:09,780 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 46 treesize of output 44 [2022-07-21 17:16:09,783 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 35 [2022-07-21 17:16:09,832 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 46 treesize of output 44 [2022-07-21 17:16:09,835 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 35 [2022-07-21 17:16:09,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:09,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-21 17:16:09,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:09,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-07-21 17:16:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:16:09,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:16:09,953 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_887 (Array Int Int)) (v_ArrVal_888 (Array Int Int))) (let ((.cse0 (+ c_append_~head.offset 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_888) c_append_~head.base) .cse0) 9) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_887) c_append_~head.base) .cse0))))) (forall ((v_ArrVal_888 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_888) c_append_~head.base) (+ c_append_~head.offset 4)) 5)))) is different from false [2022-07-21 17:16:12,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:12,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-21 17:16:12,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:12,315 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:12,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 40 [2022-07-21 17:16:12,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 17:16:12,333 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 17:16:12,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1 [2022-07-21 17:16:12,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:16:13,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474890602] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:16:13,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:16:13,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2022-07-21 17:16:13,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370366175] [2022-07-21 17:16:13,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:16:13,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 17:16:13,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:16:13,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 17:16:13,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=841, Unknown=3, NotChecked=58, Total=992 [2022-07-21 17:16:13,445 INFO L87 Difference]: Start difference. First operand 450 states and 611 transitions. Second operand has 26 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:16:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:16:14,663 INFO L93 Difference]: Finished difference Result 490 states and 660 transitions. [2022-07-21 17:16:14,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 17:16:14,663 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-07-21 17:16:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:16:14,665 INFO L225 Difference]: With dead ends: 490 [2022-07-21 17:16:14,665 INFO L226 Difference]: Without dead ends: 490 [2022-07-21 17:16:14,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=183, Invalid=1540, Unknown=3, NotChecked=80, Total=1806 [2022-07-21 17:16:14,667 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 76 mSDsluCounter, 3125 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 3440 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 853 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:16:14,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 3440 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1551 Invalid, 0 Unknown, 853 Unchecked, 0.6s Time] [2022-07-21 17:16:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-07-21 17:16:14,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 467. [2022-07-21 17:16:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 328 states have (on average 1.7652439024390243) internal successors, (579), 446 states have internal predecessors, (579), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (36), 17 states have call predecessors, (36), 19 states have call successors, (36) [2022-07-21 17:16:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 634 transitions. [2022-07-21 17:16:14,678 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 634 transitions. Word has length 39 [2022-07-21 17:16:14,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:16:14,678 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 634 transitions. [2022-07-21 17:16:14,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:16:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 634 transitions. [2022-07-21 17:16:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:16:14,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:14,680 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:16:14,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-21 17:16:14,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:16:14,895 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:14,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:14,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1733156521, now seen corresponding path program 1 times [2022-07-21 17:16:14,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:16:14,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382946925] [2022-07-21 17:16:14,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:14,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:16:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:14,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 17:16:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:16:15,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:16:15,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382946925] [2022-07-21 17:16:15,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382946925] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:16:15,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37327993] [2022-07-21 17:16:15,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:15,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:16:15,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:16:15,128 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-21 17:16:15,152 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-21 17:16:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:15,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-21 17:16:15,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:15,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:16:15,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 11 treesize of output 7 [2022-07-21 17:16:15,421 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 17:16:15,421 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 21 treesize of output 20 [2022-07-21 17:16:15,442 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:15,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-07-21 17:16:15,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:15,449 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 0 case distinctions, treesize of input 13 treesize of output 7 [2022-07-21 17:16:15,482 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:15,483 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 28 treesize of output 32 [2022-07-21 17:16:15,547 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:16:15,547 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 15 treesize of output 15 [2022-07-21 17:16:15,612 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:16:15,612 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-21 17:16:15,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-07-21 17:16:15,660 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:15,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2022-07-21 17:16:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:16:15,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:16:15,684 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1074 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_1074) c_append_~head.base) c_append_~head.offset) 0))) is different from false [2022-07-21 17:16:15,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_37 Int) (v_ArrVal_1074 (Array Int Int))) (or (not (= (select |c_#valid| v_append_~node~0.base_37) 0)) (not (= (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_37 v_ArrVal_1074) |c_append_#in~head.base|) |c_append_#in~head.offset|) 0)))) is different from false [2022-07-21 17:16:15,700 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_37 Int) (v_ArrVal_1074 (Array Int Int))) (or (not (= (select |c_#valid| v_append_~node~0.base_37) 0)) (not (= (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_37 v_ArrVal_1074) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 0)))) is different from false [2022-07-21 17:16:15,780 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 17:16:15,780 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 33 [2022-07-21 17:16:15,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:15,784 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 17:16:15,785 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 64 treesize of output 34 [2022-07-21 17:16:15,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-21 17:16:15,792 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:16:15,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 13 treesize of output 12 [2022-07-21 17:16:15,962 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 17:16:15,962 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-21 17:16:15,981 INFO L356 Elim1Store]: treesize reduction 10, result has 71.4 percent of original size [2022-07-21 17:16:15,982 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 147 [2022-07-21 17:16:15,986 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 114 treesize of output 110 [2022-07-21 17:16:15,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2022-07-21 17:16:16,250 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:16:16,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-21 17:16:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-21 17:16:16,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37327993] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:16:16,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:16:16,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 37 [2022-07-21 17:16:16,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986194768] [2022-07-21 17:16:16,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:16:16,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-21 17:16:16,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:16:16,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-21 17:16:16,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=965, Unknown=6, NotChecked=198, Total=1332 [2022-07-21 17:16:16,334 INFO L87 Difference]: Start difference. First operand 467 states and 634 transitions. Second operand has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 31 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:16:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:16:17,608 INFO L93 Difference]: Finished difference Result 869 states and 997 transitions. [2022-07-21 17:16:17,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 17:16:17,608 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 31 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2022-07-21 17:16:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:16:17,611 INFO L225 Difference]: With dead ends: 869 [2022-07-21 17:16:17,611 INFO L226 Difference]: Without dead ends: 869 [2022-07-21 17:16:17,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=343, Invalid=1639, Unknown=10, NotChecked=264, Total=2256 [2022-07-21 17:16:17,612 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 1083 mSDsluCounter, 2746 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 3840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1725 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 17:16:17,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 2933 Invalid, 3840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1932 Invalid, 0 Unknown, 1725 Unchecked, 0.9s Time] [2022-07-21 17:16:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-07-21 17:16:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 479. [2022-07-21 17:16:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 338 states have (on average 1.7396449704142012) internal successors, (588), 456 states have internal predecessors, (588), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (38), 18 states have call predecessors, (38), 20 states have call successors, (38) [2022-07-21 17:16:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 646 transitions. [2022-07-21 17:16:17,624 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 646 transitions. Word has length 39 [2022-07-21 17:16:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:16:17,624 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 646 transitions. [2022-07-21 17:16:17,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 31 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:16:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 646 transitions. [2022-07-21 17:16:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:16:17,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:17,625 INFO L195 NwaCegarLoop]: trace histogram [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-21 17:16:17,645 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-21 17:16:17,843 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,SelfDestructingSolverStorable12 [2022-07-21 17:16:17,843 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:17,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:17,844 INFO L85 PathProgramCache]: Analyzing trace with hash -904024564, now seen corresponding path program 1 times [2022-07-21 17:16:17,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:16:17,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263382724] [2022-07-21 17:16:17,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:17,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:16:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:17,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 17:16:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:16:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:16:18,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263382724] [2022-07-21 17:16:18,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263382724] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:16:18,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384024712] [2022-07-21 17:16:18,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:18,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:16:18,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:16:18,082 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-21 17:16:18,082 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-21 17:16:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:18,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-21 17:16:18,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:18,225 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-21 17:16:18,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:16:18,387 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 17:16:18,387 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 21 treesize of output 20 [2022-07-21 17:16:18,418 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:18,418 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 27 [2022-07-21 17:16:18,423 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 17:16:18,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 7 [2022-07-21 17:16:18,459 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:18,459 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 28 treesize of output 32 [2022-07-21 17:16:18,515 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:16:18,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-21 17:16:18,592 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:16:18,592 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-21 17:16:18,615 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 34 treesize of output 30 [2022-07-21 17:16:18,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:18,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2022-07-21 17:16:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:16:18,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:16:18,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1254 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_1254) c_append_~head.base) c_append_~head.offset) 0))) is different from false [2022-07-21 17:16:18,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_42 Int) (v_ArrVal_1254 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_42 v_ArrVal_1254) |c_append_#in~head.base|) |c_append_#in~head.offset|) 0)) (not (= (select |c_#valid| v_append_~node~0.base_42) 0)))) is different from false [2022-07-21 17:16:18,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_42 Int) (v_ArrVal_1254 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_42 v_ArrVal_1254) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 0)) (not (= (select |c_#valid| v_append_~node~0.base_42) 0)))) is different from false [2022-07-21 17:16:18,748 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 17:16:18,748 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 33 [2022-07-21 17:16:18,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:18,752 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 17:16:18,752 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 72 treesize of output 34 [2022-07-21 17:16:18,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-21 17:16:18,775 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:16:18,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-21 17:16:18,914 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 17:16:18,915 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-21 17:16:18,934 INFO L356 Elim1Store]: treesize reduction 10, result has 71.4 percent of original size [2022-07-21 17:16:18,935 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 85 [2022-07-21 17:16:18,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2022-07-21 17:16:18,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-07-21 17:16:19,176 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:16:19,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-21 17:16:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-21 17:16:19,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384024712] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:16:19,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:16:19,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 37 [2022-07-21 17:16:19,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006734684] [2022-07-21 17:16:19,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:16:19,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-21 17:16:19,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:16:19,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-21 17:16:19,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=963, Unknown=8, NotChecked=198, Total=1332 [2022-07-21 17:16:19,292 INFO L87 Difference]: Start difference. First operand 479 states and 646 transitions. Second operand has 37 states, 37 states have (on average 2.4054054054054053) internal successors, (89), 31 states have internal predecessors, (89), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:16:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:16:20,464 INFO L93 Difference]: Finished difference Result 592 states and 649 transitions. [2022-07-21 17:16:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 17:16:20,464 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.4054054054054053) internal successors, (89), 31 states have internal predecessors, (89), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2022-07-21 17:16:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:16:20,466 INFO L225 Difference]: With dead ends: 592 [2022-07-21 17:16:20,466 INFO L226 Difference]: Without dead ends: 592 [2022-07-21 17:16:20,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=365, Invalid=1709, Unknown=8, NotChecked=270, Total=2352 [2022-07-21 17:16:20,467 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 671 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 3474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1347 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:16:20,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 2323 Invalid, 3474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1941 Invalid, 0 Unknown, 1347 Unchecked, 0.7s Time] [2022-07-21 17:16:20,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-21 17:16:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 444. [2022-07-21 17:16:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 306 states have (on average 1.7875816993464053) internal successors, (547), 423 states have internal predecessors, (547), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-21 17:16:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 585 transitions. [2022-07-21 17:16:20,482 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 585 transitions. Word has length 41 [2022-07-21 17:16:20,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:16:20,483 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 585 transitions. [2022-07-21 17:16:20,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.4054054054054053) internal successors, (89), 31 states have internal predecessors, (89), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:16:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 585 transitions. [2022-07-21 17:16:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-21 17:16:20,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:20,484 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1] [2022-07-21 17:16:20,517 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-21 17:16:20,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:16:20,701 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:20,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:20,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1807925701, now seen corresponding path program 1 times [2022-07-21 17:16:20,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:16:20,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554755436] [2022-07-21 17:16:20,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:20,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:16:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:20,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 17:16:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:20,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 17:16:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:16:20,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:16:20,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554755436] [2022-07-21 17:16:20,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554755436] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:16:20,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984287571] [2022-07-21 17:16:20,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:20,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:16:20,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:16:20,971 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-21 17:16:20,972 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-21 17:16:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:21,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-21 17:16:21,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:21,176 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-21 17:16:21,317 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-21 17:16:21,321 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-21 17:16:21,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:21,431 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 26 treesize of output 28 [2022-07-21 17:16:21,442 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-07-21 17:16:21,442 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 22 treesize of output 24 [2022-07-21 17:16:21,478 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 36 treesize of output 36 [2022-07-21 17:16:21,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, 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 35 [2022-07-21 17:16:21,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 36 treesize of output 36 [2022-07-21 17:16:21,575 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 35 [2022-07-21 17:16:21,609 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 36 treesize of output 36 [2022-07-21 17:16:21,611 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 35 [2022-07-21 17:16:21,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:21,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-21 17:16:21,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:21,641 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:21,641 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 32 treesize of output 17 [2022-07-21 17:16:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:16:21,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:16:21,686 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1534 (Array Int Int)) (v_ArrVal_1533 (Array Int Int))) (let ((.cse0 (+ c_append_~head.offset 4))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_1533) c_append_~head.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_1534) c_append_~head.base) .cse0))))) (forall ((v_ArrVal_1533 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_1533) c_append_~head.base) (+ c_append_~head.offset 4)))))) is different from false [2022-07-21 17:16:21,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:21,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2022-07-21 17:16:21,929 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:21,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-21 17:16:21,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:21,935 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-21 17:16:21,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2022-07-21 17:16:21,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:21,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:21,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-21 17:16:21,943 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 17:16:21,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2022-07-21 17:16:22,058 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:22,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-21 17:16:22,063 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:22,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2022-07-21 17:16:22,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 17:16:22,077 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:22,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2022-07-21 17:16:22,081 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:22,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-21 17:16:22,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:22,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:22,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-21 17:16:22,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:22,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:22,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-21 17:16:22,266 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 50 treesize of output 46 [2022-07-21 17:16:22,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2022-07-21 17:16:22,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984287571] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:16:22,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:16:22,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-07-21 17:16:22,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910112177] [2022-07-21 17:16:22,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:16:22,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-21 17:16:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:16:22,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-21 17:16:22,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=944, Unknown=1, NotChecked=62, Total=1122 [2022-07-21 17:16:22,530 INFO L87 Difference]: Start difference. First operand 444 states and 585 transitions. Second operand has 34 states, 30 states have (on average 3.7333333333333334) internal successors, (112), 27 states have internal predecessors, (112), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 17:16:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:16:23,868 INFO L93 Difference]: Finished difference Result 613 states and 667 transitions. [2022-07-21 17:16:23,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 17:16:23,869 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 3.7333333333333334) internal successors, (112), 27 states have internal predecessors, (112), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-07-21 17:16:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:16:23,870 INFO L225 Difference]: With dead ends: 613 [2022-07-21 17:16:23,870 INFO L226 Difference]: Without dead ends: 613 [2022-07-21 17:16:23,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=330, Invalid=1743, Unknown=1, NotChecked=88, Total=2162 [2022-07-21 17:16:23,871 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 820 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 2578 SdHoareTripleChecker+Invalid, 4233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2337 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 17:16:23,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 2578 Invalid, 4233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1818 Invalid, 0 Unknown, 2337 Unchecked, 0.9s Time] [2022-07-21 17:16:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-07-21 17:16:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 459. [2022-07-21 17:16:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 321 states have (on average 1.750778816199377) internal successors, (562), 438 states have internal predecessors, (562), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-21 17:16:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 598 transitions. [2022-07-21 17:16:23,882 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 598 transitions. Word has length 54 [2022-07-21 17:16:23,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:16:23,882 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 598 transitions. [2022-07-21 17:16:23,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 3.7333333333333334) internal successors, (112), 27 states have internal predecessors, (112), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 17:16:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 598 transitions. [2022-07-21 17:16:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 17:16:23,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:23,883 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:16:23,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-21 17:16:24,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:16:24,101 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:24,101 INFO L85 PathProgramCache]: Analyzing trace with hash 374181204, now seen corresponding path program 1 times [2022-07-21 17:16:24,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:16:24,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356710962] [2022-07-21 17:16:24,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:24,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:16:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:24,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 17:16:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:24,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 17:16:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:24,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 17:16:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 17:16:24,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:16:24,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356710962] [2022-07-21 17:16:24,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356710962] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:16:24,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423094959] [2022-07-21 17:16:24,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:24,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:16:24,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:16:24,426 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-21 17:16:24,441 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-21 17:16:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:24,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-21 17:16:24,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:24,661 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-21 17:16:24,791 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-21 17:16:24,793 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-21 17:16:24,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:24,884 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 26 treesize of output 28 [2022-07-21 17:16:24,894 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-07-21 17:16:24,894 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 22 treesize of output 24 [2022-07-21 17:16:24,928 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 36 treesize of output 36 [2022-07-21 17:16:24,930 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 35 [2022-07-21 17:16:25,017 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 36 treesize of output 36 [2022-07-21 17:16:25,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 35 [2022-07-21 17:16:25,043 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 36 treesize of output 36 [2022-07-21 17:16:25,046 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 35 [2022-07-21 17:16:25,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:25,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-21 17:16:25,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:25,077 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:25,077 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 32 treesize of output 17 [2022-07-21 17:16:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 41 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 17:16:25,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:16:25,126 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1908 (Array Int Int)) (v_ArrVal_1907 (Array Int Int))) (let ((.cse0 (+ c_append_~head.offset 4))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_1907) c_append_~head.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_1908) c_append_~head.base) .cse0))))) (forall ((v_ArrVal_1907 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_1907) c_append_~head.base) (+ c_append_~head.offset 4)))))) is different from false [2022-07-21 17:16:25,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:25,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-21 17:16:25,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:25,431 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-21 17:16:25,431 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 22 treesize of output 13 [2022-07-21 17:16:25,450 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 17:16:25,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2022-07-21 17:16:25,589 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:25,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2022-07-21 17:16:25,592 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:25,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-21 17:16:25,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:25,599 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 68 treesize of output 71 [2022-07-21 17:16:25,605 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:25,605 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 108 treesize of output 105 [2022-07-21 17:16:25,608 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 86 treesize of output 78 [2022-07-21 17:16:25,610 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 42 treesize of output 34 [2022-07-21 17:16:25,659 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:25,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-21 17:16:25,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:16:25,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:25,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-21 17:16:25,902 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 73 treesize of output 69 [2022-07-21 17:16:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2022-07-21 17:16:26,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423094959] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:16:26,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:16:26,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2022-07-21 17:16:26,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119071246] [2022-07-21 17:16:26,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:16:26,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-21 17:16:26,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:16:26,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-21 17:16:26,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=894, Unknown=1, NotChecked=60, Total=1056 [2022-07-21 17:16:26,340 INFO L87 Difference]: Start difference. First operand 459 states and 598 transitions. Second operand has 33 states, 29 states have (on average 4.206896551724138) internal successors, (122), 26 states have internal predecessors, (122), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 17:16:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:16:27,892 INFO L93 Difference]: Finished difference Result 624 states and 677 transitions. [2022-07-21 17:16:27,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 17:16:27,892 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 4.206896551724138) internal successors, (122), 26 states have internal predecessors, (122), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-07-21 17:16:27,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:16:27,894 INFO L225 Difference]: With dead ends: 624 [2022-07-21 17:16:27,894 INFO L226 Difference]: Without dead ends: 624 [2022-07-21 17:16:27,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 129 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=303, Invalid=1680, Unknown=1, NotChecked=86, Total=2070 [2022-07-21 17:16:27,895 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 1371 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 4869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2889 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 17:16:27,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 2272 Invalid, 4869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1852 Invalid, 0 Unknown, 2889 Unchecked, 0.9s Time] [2022-07-21 17:16:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-07-21 17:16:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 462. [2022-07-21 17:16:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 324 states have (on average 1.7407407407407407) internal successors, (564), 441 states have internal predecessors, (564), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-21 17:16:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 600 transitions. [2022-07-21 17:16:27,916 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 600 transitions. Word has length 71 [2022-07-21 17:16:27,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:16:27,916 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 600 transitions. [2022-07-21 17:16:27,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 4.206896551724138) internal successors, (122), 26 states have internal predecessors, (122), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 17:16:27,916 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 600 transitions. [2022-07-21 17:16:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-07-21 17:16:27,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:27,918 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:16:27,939 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-21 17:16:28,118 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,SelfDestructingSolverStorable15 [2022-07-21 17:16:28,118 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:28,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:28,119 INFO L85 PathProgramCache]: Analyzing trace with hash -943842599, now seen corresponding path program 1 times [2022-07-21 17:16:28,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:16:28,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441253956] [2022-07-21 17:16:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:28,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:16:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:30,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 17:16:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:30,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 17:16:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:31,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 17:16:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:31,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 17:16:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:32,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 17:16:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:32,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 17:16:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:32,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 17:16:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:33,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 17:16:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:33,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 17:16:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:33,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 17:16:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:33,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-21 17:16:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:34,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-21 17:16:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:34,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-21 17:16:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:34,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-21 17:16:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:34,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 311 proven. 681 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2022-07-21 17:16:34,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:16:34,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441253956] [2022-07-21 17:16:34,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441253956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:16:34,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947758075] [2022-07-21 17:16:34,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:34,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:16:34,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:16:34,910 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-21 17:16:34,911 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-21 17:16:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:35,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 2131 conjuncts, 419 conjunts are in the unsatisfiable core [2022-07-21 17:16:35,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:35,590 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-21 17:16:35,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:16:35,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:35,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, 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-21 17:16:35,814 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:35,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-07-21 17:16:35,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:35,822 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 0 case distinctions, treesize of input 13 treesize of output 7 [2022-07-21 17:16:35,874 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:35,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-07-21 17:16:35,936 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 17:16:35,936 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 15 treesize of output 15 [2022-07-21 17:16:36,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:36,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:36,466 INFO L356 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2022-07-21 17:16:36,467 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 17:16:36,502 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-21 17:16:36,667 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-21 17:16:36,668 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_10| input size 58 context size 58 output size 58 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) 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:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) 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-21 17:16:36,670 INFO L158 Benchmark]: Toolchain (without parser) took 44288.69ms. Allocated memory was 56.6MB in the beginning and 524.3MB in the end (delta: 467.7MB). Free memory was 33.9MB in the beginning and 193.5MB in the end (delta: -159.6MB). Peak memory consumption was 308.4MB. Max. memory is 16.1GB. [2022-07-21 17:16:36,670 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 56.6MB. Free memory was 38.5MB in the beginning and 38.5MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:16:36,670 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.17ms. Allocated memory is still 56.6MB. Free memory was 33.7MB in the beginning and 31.7MB in the end (delta: 2.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 17:16:36,670 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.64ms. Allocated memory is still 56.6MB. Free memory was 31.7MB in the beginning and 28.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:16:36,670 INFO L158 Benchmark]: Boogie Preprocessor took 54.27ms. Allocated memory is still 56.6MB. Free memory was 28.8MB in the beginning and 26.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 17:16:36,670 INFO L158 Benchmark]: RCFGBuilder took 619.58ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 26.0MB in the beginning and 32.4MB in the end (delta: -6.4MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2022-07-21 17:16:36,671 INFO L158 Benchmark]: TraceAbstraction took 43189.33ms. Allocated memory was 69.2MB in the beginning and 524.3MB in the end (delta: 455.1MB). Free memory was 31.8MB in the beginning and 193.5MB in the end (delta: -161.8MB). Peak memory consumption was 294.6MB. Max. memory is 16.1GB. [2022-07-21 17:16:36,671 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 56.6MB. Free memory was 38.5MB in the beginning and 38.5MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.17ms. Allocated memory is still 56.6MB. Free memory was 33.7MB in the beginning and 31.7MB in the end (delta: 2.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.64ms. Allocated memory is still 56.6MB. Free memory was 31.7MB in the beginning and 28.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.27ms. Allocated memory is still 56.6MB. Free memory was 28.8MB in the beginning and 26.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 619.58ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 26.0MB in the beginning and 32.4MB in the end (delta: -6.4MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * TraceAbstraction took 43189.33ms. Allocated memory was 69.2MB in the beginning and 524.3MB in the end (delta: 455.1MB). Free memory was 31.8MB in the beginning and 193.5MB in the end (delta: -161.8MB). Peak memory consumption was 294.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_10| input size 58 context size 58 output size 58 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_10| input size 58 context size 58 output size 58: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 17:16:36,703 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/memsafety-ext2/split_list_test05-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:16:38,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:16:38,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:16:38,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:16:38,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:16:38,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:16:38,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:16:38,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:16:38,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:16:38,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:16:38,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:16:38,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:16:38,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:16:38,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:16:38,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:16:38,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:16:38,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:16:38,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:16:38,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:16:38,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:16:38,496 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:16:38,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:16:38,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:16:38,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:16:38,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:16:38,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:16:38,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:16:38,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:16:38,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:16:38,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:16:38,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:16:38,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:16:38,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:16:38,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:16:38,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:16:38,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:16:38,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:16:38,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:16:38,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:16:38,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:16:38,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:16:38,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:16:38,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-21 17:16:38,542 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:16:38,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:16:38,543 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:16:38,543 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:16:38,544 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:16:38,544 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:16:38,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:16:38,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:16:38,545 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:16:38,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:16:38,546 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:16:38,546 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:16:38,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:16:38,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:16:38,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:16:38,546 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:16:38,547 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:16:38,547 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:16:38,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:16:38,547 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:16:38,547 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 17:16:38,547 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 17:16:38,547 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:16:38,548 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:16:38,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:16:38,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:16:38,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:16:38,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:16:38,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:16:38,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:16:38,549 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 17:16:38,549 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 17:16:38,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 17:16:38,549 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 -> 753b20bc59ec3e8b11fc0f1b54dadf2ece41f6cecc7eda05bde7d4413de53136 [2022-07-21 17:16:38,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:16:38,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:16:38,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:16:38,850 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:16:38,850 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:16:38,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2022-07-21 17:16:38,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6d0f242/4edf16422fcc4833a2c1dc88b61c15c4/FLAG8b389f8f9 [2022-07-21 17:16:39,276 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:16:39,279 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-1.i [2022-07-21 17:16:39,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6d0f242/4edf16422fcc4833a2c1dc88b61c15c4/FLAG8b389f8f9 [2022-07-21 17:16:39,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6d0f242/4edf16422fcc4833a2c1dc88b61c15c4 [2022-07-21 17:16:39,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:16:39,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:16:39,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:16:39,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:16:39,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:16:39,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:16:39" (1/1) ... [2022-07-21 17:16:39,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a7d095b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:16:39, skipping insertion in model container [2022-07-21 17:16:39,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:16:39" (1/1) ... [2022-07-21 17:16:39,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:16:39,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:16:39,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:16:39,931 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:16:39,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:16:40,013 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:16:40,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:16:40 WrapperNode [2022-07-21 17:16:40,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:16:40,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:16:40,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:16:40,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:16:40,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:16:40" (1/1) ... [2022-07-21 17:16:40,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:16:40" (1/1) ... [2022-07-21 17:16:40,085 INFO L137 Inliner]: procedures = 126, calls = 94, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 294 [2022-07-21 17:16:40,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:16:40,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:16:40,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:16:40,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:16:40,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:16:40" (1/1) ... [2022-07-21 17:16:40,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:16:40" (1/1) ... [2022-07-21 17:16:40,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:16:40" (1/1) ... [2022-07-21 17:16:40,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:16:40" (1/1) ... [2022-07-21 17:16:40,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:16:40" (1/1) ... [2022-07-21 17:16:40,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:16:40" (1/1) ... [2022-07-21 17:16:40,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:16:40" (1/1) ... [2022-07-21 17:16:40,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:16:40,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:16:40,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:16:40,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:16:40,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:16:40" (1/1) ... [2022-07-21 17:16:40,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:16:40,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:16:40,180 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-21 17:16:40,193 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-21 17:16:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-21 17:16:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:16:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:16:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:16:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:16:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-21 17:16:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:16:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 17:16:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:16:40,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:16:40,212 INFO L130 BoogieDeclarations]: Found specification of procedure append [2022-07-21 17:16:40,212 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2022-07-21 17:16:40,323 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:16:40,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:16:41,152 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:16:41,158 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:16:41,158 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-21 17:16:41,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:16:41 BoogieIcfgContainer [2022-07-21 17:16:41,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:16:41,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:16:41,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:16:41,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:16:41,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:16:39" (1/3) ... [2022-07-21 17:16:41,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b81e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:16:41, skipping insertion in model container [2022-07-21 17:16:41,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:16:40" (2/3) ... [2022-07-21 17:16:41,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b81e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:16:41, skipping insertion in model container [2022-07-21 17:16:41,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:16:41" (3/3) ... [2022-07-21 17:16:41,189 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-1.i [2022-07-21 17:16:41,198 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:16:41,199 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2022-07-21 17:16:41,236 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:16:41,241 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@47204640, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@79c1ae53 [2022-07-21 17:16:41,241 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2022-07-21 17:16:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 157 states have (on average 2.159235668789809) internal successors, (339), 306 states have internal predecessors, (339), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:16:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:16:41,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:41,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:16:41,249 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:41,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:41,253 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-21 17:16:41,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:16:41,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402055560] [2022-07-21 17:16:41,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:41,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:16:41,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:16:41,277 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-21 17:16:41,278 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-21 17:16:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:41,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:16:41,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:41,371 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-21 17:16:41,378 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-21 17:16:41,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:16:41,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:16:41,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402055560] [2022-07-21 17:16:41,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402055560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:16:41,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:16:41,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:16:41,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940743014] [2022-07-21 17:16:41,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:16:41,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:16:41,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:16:41,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:16:41,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:16:41,402 INFO L87 Difference]: Start difference. First operand has 320 states, 157 states have (on average 2.159235668789809) internal successors, (339), 306 states have internal predecessors, (339), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:16:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:16:41,885 INFO L93 Difference]: Finished difference Result 545 states and 598 transitions. [2022-07-21 17:16:41,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:16:41,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-21 17:16:41,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:16:41,896 INFO L225 Difference]: With dead ends: 545 [2022-07-21 17:16:41,896 INFO L226 Difference]: Without dead ends: 543 [2022-07-21 17:16:41,897 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-21 17:16:41,899 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 246 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:16:41,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 430 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:16:41,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-07-21 17:16:41,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 404. [2022-07-21 17:16:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 244 states have (on average 2.1024590163934427) internal successors, (513), 390 states have internal predecessors, (513), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:16:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 541 transitions. [2022-07-21 17:16:41,945 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 541 transitions. Word has length 3 [2022-07-21 17:16:41,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:16:41,947 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 541 transitions. [2022-07-21 17:16:41,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:16:41,948 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 541 transitions. [2022-07-21 17:16:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:16:41,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:41,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:16:41,967 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-21 17:16:42,162 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-21 17:16:42,163 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:42,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:42,164 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-21 17:16:42,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:16:42,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118649601] [2022-07-21 17:16:42,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:42,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:16:42,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:16:42,166 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-21 17:16:42,167 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-21 17:16:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:42,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:16:42,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:42,270 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-21 17:16:42,280 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-21 17:16:42,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:16:42,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:16:42,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118649601] [2022-07-21 17:16:42,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118649601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:16:42,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:16:42,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:16:42,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220127601] [2022-07-21 17:16:42,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:16:42,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:16:42,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:16:42,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:16:42,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:16:42,285 INFO L87 Difference]: Start difference. First operand 404 states and 541 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:16:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:16:42,719 INFO L93 Difference]: Finished difference Result 405 states and 544 transitions. [2022-07-21 17:16:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:16:42,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-21 17:16:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:16:42,722 INFO L225 Difference]: With dead ends: 405 [2022-07-21 17:16:42,722 INFO L226 Difference]: Without dead ends: 405 [2022-07-21 17:16:42,722 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-21 17:16:42,723 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 6 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:16:42,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 548 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:16:42,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-07-21 17:16:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2022-07-21 17:16:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 244 states have (on average 2.0942622950819674) internal successors, (511), 388 states have internal predecessors, (511), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:16:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 539 transitions. [2022-07-21 17:16:42,750 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 539 transitions. Word has length 3 [2022-07-21 17:16:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:16:42,751 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 539 transitions. [2022-07-21 17:16:42,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:16:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 539 transitions. [2022-07-21 17:16:42,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 17:16:42,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:42,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:16:42,777 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-21 17:16:42,974 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-21 17:16:42,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:42,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:42,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1117387183, now seen corresponding path program 1 times [2022-07-21 17:16:42,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:16:42,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911988054] [2022-07-21 17:16:42,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:42,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:16:42,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:16:42,980 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-21 17:16:42,982 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-21 17:16:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:43,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:16:43,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:43,121 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-21 17:16:43,124 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-21 17:16:43,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:16:43,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:16:43,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911988054] [2022-07-21 17:16:43,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911988054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:16:43,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:16:43,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:16:43,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062965905] [2022-07-21 17:16:43,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:16:43,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:16:43,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:16:43,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:16:43,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:16:43,126 INFO L87 Difference]: Start difference. First operand 402 states and 539 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-21 17:16:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:16:43,384 INFO L93 Difference]: Finished difference Result 397 states and 534 transitions. [2022-07-21 17:16:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:16:43,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 10 [2022-07-21 17:16:43,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:16:43,386 INFO L225 Difference]: With dead ends: 397 [2022-07-21 17:16:43,386 INFO L226 Difference]: Without dead ends: 397 [2022-07-21 17:16:43,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-21 17:16:43,387 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 43 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:16:43,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 491 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:16:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-07-21 17:16:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2022-07-21 17:16:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 244 states have (on average 2.0737704918032787) internal successors, (506), 383 states have internal predecessors, (506), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:16:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 534 transitions. [2022-07-21 17:16:43,397 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 534 transitions. Word has length 10 [2022-07-21 17:16:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:16:43,397 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 534 transitions. [2022-07-21 17:16:43,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-21 17:16:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 534 transitions. [2022-07-21 17:16:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 17:16:43,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:43,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:16:43,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-21 17:16:43,604 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-21 17:16:43,605 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:43,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:43,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1117387184, now seen corresponding path program 1 times [2022-07-21 17:16:43,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:16:43,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342231180] [2022-07-21 17:16:43,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:43,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:16:43,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:16:43,607 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-21 17:16:43,610 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-21 17:16:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:43,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:16:43,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:43,683 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-21 17:16:43,690 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-21 17:16:43,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:16:43,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:16:43,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342231180] [2022-07-21 17:16:43,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342231180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:16:43,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:16:43,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:16:43,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863765672] [2022-07-21 17:16:43,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:16:43,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:16:43,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:16:43,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:16:43,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:16:43,693 INFO L87 Difference]: Start difference. First operand 397 states and 534 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-21 17:16:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:16:44,011 INFO L93 Difference]: Finished difference Result 392 states and 529 transitions. [2022-07-21 17:16:44,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:16:44,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 10 [2022-07-21 17:16:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:16:44,014 INFO L225 Difference]: With dead ends: 392 [2022-07-21 17:16:44,014 INFO L226 Difference]: Without dead ends: 392 [2022-07-21 17:16:44,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-21 17:16:44,015 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 38 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:16:44,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 504 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:16:44,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-07-21 17:16:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2022-07-21 17:16:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 244 states have (on average 2.05327868852459) internal successors, (501), 378 states have internal predecessors, (501), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:16:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 529 transitions. [2022-07-21 17:16:44,033 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 529 transitions. Word has length 10 [2022-07-21 17:16:44,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:16:44,033 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 529 transitions. [2022-07-21 17:16:44,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-21 17:16:44,033 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 529 transitions. [2022-07-21 17:16:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:16:44,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:44,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:16:44,041 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-21 17:16:44,234 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-21 17:16:44,234 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:44,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:44,235 INFO L85 PathProgramCache]: Analyzing trace with hash 279264727, now seen corresponding path program 1 times [2022-07-21 17:16:44,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:16:44,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71290926] [2022-07-21 17:16:44,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:44,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:16:44,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:16:44,239 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-21 17:16:44,244 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-21 17:16:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:44,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 17:16:44,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:44,313 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-21 17:16:44,345 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 17:16:44,345 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-21 17:16:44,365 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-21 17:16:44,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:16:44,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:16:44,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71290926] [2022-07-21 17:16:44,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71290926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:16:44,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:16:44,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:16:44,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249816553] [2022-07-21 17:16:44,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:16:44,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:16:44,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:16:44,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:16:44,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:16:44,368 INFO L87 Difference]: Start difference. First operand 392 states and 529 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-21 17:16:44,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:16:44,995 INFO L93 Difference]: Finished difference Result 520 states and 571 transitions. [2022-07-21 17:16:44,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:16:44,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 11 [2022-07-21 17:16:44,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:16:44,997 INFO L225 Difference]: With dead ends: 520 [2022-07-21 17:16:44,997 INFO L226 Difference]: Without dead ends: 520 [2022-07-21 17:16:44,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:16:44,998 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 314 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:16:44,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 639 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 17:16:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-07-21 17:16:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 384. [2022-07-21 17:16:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 244 states have (on average 2.0204918032786887) internal successors, (493), 370 states have internal predecessors, (493), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:16:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 521 transitions. [2022-07-21 17:16:45,005 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 521 transitions. Word has length 11 [2022-07-21 17:16:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:16:45,005 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 521 transitions. [2022-07-21 17:16:45,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-21 17:16:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 521 transitions. [2022-07-21 17:16:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:16:45,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:45,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:16:45,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-21 17:16:45,212 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-21 17:16:45,213 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:45,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:45,214 INFO L85 PathProgramCache]: Analyzing trace with hash 279264728, now seen corresponding path program 1 times [2022-07-21 17:16:45,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:16:45,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014083493] [2022-07-21 17:16:45,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:45,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:16:45,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:16:45,216 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-21 17:16:45,219 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-21 17:16:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:45,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-21 17:16:45,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:45,329 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-21 17:16:45,333 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-21 17:16:45,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:45,418 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-21 17:16:45,424 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:16:45,424 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 12 treesize of output 12 [2022-07-21 17:16:45,439 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-21 17:16:45,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:16:45,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:16:45,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014083493] [2022-07-21 17:16:45,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014083493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:16:45,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:16:45,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:16:45,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233245373] [2022-07-21 17:16:45,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:16:45,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:16:45,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:16:45,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:16:45,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:16:45,441 INFO L87 Difference]: Start difference. First operand 384 states and 521 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-21 17:16:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:16:46,272 INFO L93 Difference]: Finished difference Result 511 states and 562 transitions. [2022-07-21 17:16:46,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:16:46,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 11 [2022-07-21 17:16:46,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:16:46,274 INFO L225 Difference]: With dead ends: 511 [2022-07-21 17:16:46,274 INFO L226 Difference]: Without dead ends: 511 [2022-07-21 17:16:46,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:16:46,275 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 298 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 17:16:46,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 443 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 17:16:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-07-21 17:16:46,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 376. [2022-07-21 17:16:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 244 states have (on average 1.9836065573770492) internal successors, (484), 362 states have internal predecessors, (484), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:16:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 512 transitions. [2022-07-21 17:16:46,281 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 512 transitions. Word has length 11 [2022-07-21 17:16:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:16:46,282 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 512 transitions. [2022-07-21 17:16:46,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-21 17:16:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 512 transitions. [2022-07-21 17:16:46,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:16:46,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:46,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:16:46,308 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-21 17:16:46,492 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-21 17:16:46,492 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:46,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:46,493 INFO L85 PathProgramCache]: Analyzing trace with hash 314804234, now seen corresponding path program 1 times [2022-07-21 17:16:46,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:16:46,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503938124] [2022-07-21 17:16:46,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:46,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:16:46,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:16:46,495 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-21 17:16:46,497 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-21 17:16:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:46,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-21 17:16:46,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:46,610 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-21 17:16:46,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:16:46,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:16:46,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:46,675 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-21 17:16:46,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:16:46,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:16:46,741 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:16:46,741 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 12 treesize of output 12 [2022-07-21 17:16:46,804 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-21 17:16:46,810 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-21 17:16:46,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:16:46,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 17:16:46,858 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-21 17:16:46,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:16:46,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:16:46,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503938124] [2022-07-21 17:16:46,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503938124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:16:46,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:16:46,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:16:46,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052591490] [2022-07-21 17:16:46,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:16:46,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:16:46,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:16:46,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:16:46,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:16:46,862 INFO L87 Difference]: Start difference. First operand 376 states and 512 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-21 17:16:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:16:47,525 INFO L93 Difference]: Finished difference Result 396 states and 535 transitions. [2022-07-21 17:16:47,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:16:47,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) Word has length 20 [2022-07-21 17:16:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:16:47,528 INFO L225 Difference]: With dead ends: 396 [2022-07-21 17:16:47,528 INFO L226 Difference]: Without dead ends: 396 [2022-07-21 17:16:47,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:16:47,528 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 25 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:16:47,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1823 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 17:16:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-21 17:16:47,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 384. [2022-07-21 17:16:47,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 251 states have (on average 1.9601593625498008) internal successors, (492), 369 states have internal predecessors, (492), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-21 17:16:47,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 522 transitions. [2022-07-21 17:16:47,537 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 522 transitions. Word has length 20 [2022-07-21 17:16:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:16:47,537 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 522 transitions. [2022-07-21 17:16:47,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-21 17:16:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 522 transitions. [2022-07-21 17:16:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:16:47,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:47,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:16:47,550 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-21 17:16:47,751 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-21 17:16:47,751 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:47,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:47,752 INFO L85 PathProgramCache]: Analyzing trace with hash -54530483, now seen corresponding path program 1 times [2022-07-21 17:16:47,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:16:47,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312894457] [2022-07-21 17:16:47,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:47,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:16:47,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:16:47,754 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-21 17:16:47,756 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-21 17:16:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:47,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 17:16:47,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:47,854 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-21 17:16:47,867 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-21 17:16:47,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 17:16:47,927 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:16:47,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 12 treesize of output 12 [2022-07-21 17:16:47,949 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-21 17:16:47,953 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-21 17:16:47,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 17:16:47,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 17:16:48,020 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-21 17:16:48,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:16:48,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:16:48,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312894457] [2022-07-21 17:16:48,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312894457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:16:48,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:16:48,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:16:48,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533776991] [2022-07-21 17:16:48,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:16:48,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:16:48,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:16:48,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:16:48,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:16:48,022 INFO L87 Difference]: Start difference. First operand 384 states and 522 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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-21 17:16:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:16:49,269 INFO L93 Difference]: Finished difference Result 524 states and 577 transitions. [2022-07-21 17:16:49,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:16:49,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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) Word has length 22 [2022-07-21 17:16:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:16:49,271 INFO L225 Difference]: With dead ends: 524 [2022-07-21 17:16:49,271 INFO L226 Difference]: Without dead ends: 524 [2022-07-21 17:16:49,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:16:49,271 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 249 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:16:49,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1334 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-21 17:16:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-07-21 17:16:49,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 387. [2022-07-21 17:16:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 254 states have (on average 1.9488188976377954) internal successors, (495), 372 states have internal predecessors, (495), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-21 17:16:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 525 transitions. [2022-07-21 17:16:49,280 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 525 transitions. Word has length 22 [2022-07-21 17:16:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:16:49,281 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 525 transitions. [2022-07-21 17:16:49,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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-21 17:16:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 525 transitions. [2022-07-21 17:16:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:16:49,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:16:49,282 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:16:49,292 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-21 17:16:49,482 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-21 17:16:49,482 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-21 17:16:49,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:16:49,483 INFO L85 PathProgramCache]: Analyzing trace with hash 67877176, now seen corresponding path program 1 times [2022-07-21 17:16:49,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:16:49,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863079326] [2022-07-21 17:16:49,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:49,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:16:49,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:16:49,485 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-21 17:16:49,533 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-21 17:16:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:49,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-21 17:16:49,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:49,680 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-21 17:16:49,680 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-21 17:16:49,888 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-21 17:16:49,928 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:49,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-21 17:16:49,941 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-21 17:16:49,991 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:49,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 17:16:50,096 INFO L356 Elim1Store]: treesize reduction 128, result has 20.5 percent of original size [2022-07-21 17:16:50,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 54 treesize of output 101 [2022-07-21 17:16:50,108 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-21 17:16:50,108 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 1 case distinctions, treesize of input 45 treesize of output 20 [2022-07-21 17:16:50,296 INFO L356 Elim1Store]: treesize reduction 85, result has 36.6 percent of original size [2022-07-21 17:16:50,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 47 treesize of output 80 [2022-07-21 17:16:50,520 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 57 treesize of output 53 [2022-07-21 17:16:51,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2022-07-21 17:16:52,113 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 57 treesize of output 53 [2022-07-21 17:16:52,441 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 60 treesize of output 30 [2022-07-21 17:16:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:16:52,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:16:52,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_252) c_append_~head.base) (bvadd (_ bv4 32) c_append_~head.offset))) (_ bv1 1))) is different from false [2022-07-21 17:16:52,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32))) (v_append_~node~0.base_21 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_21)))) (= (_ bv1 1) (select (store |c_#valid| v_append_~node~0.base_21 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_21 v_ArrVal_252) |c_append_#in~head.base|) (bvadd (_ bv4 32) |c_append_#in~head.offset|)))))) is different from false [2022-07-21 17:16:52,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32))) (v_append_~node~0.base_21 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_21)))) (= (_ bv1 1) (select (store |c_#valid| v_append_~node~0.base_21 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_21 v_ArrVal_252) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) is different from false [2022-07-21 17:16:53,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:53,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-21 17:16:53,082 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 335 treesize of output 209 [2022-07-21 17:16:53,088 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 182 treesize of output 174 [2022-07-21 17:16:53,095 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 174 treesize of output 158 [2022-07-21 17:16:57,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:16:57,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863079326] [2022-07-21 17:16:57,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863079326] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:16:57,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [813763696] [2022-07-21 17:16:57,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:16:57,325 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:16:57,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:16:57,327 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:16:57,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-07-21 17:16:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:16:57,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-21 17:16:57,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:16:57,686 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 17:16:57,686 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-21 17:16:57,802 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-21 17:16:57,832 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:57,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-21 17:16:57,839 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-21 17:16:57,866 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:16:57,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 17:16:57,923 INFO L356 Elim1Store]: treesize reduction 138, result has 14.3 percent of original size [2022-07-21 17:16:57,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 89 [2022-07-21 17:16:57,946 INFO L356 Elim1Store]: treesize reduction 71, result has 29.0 percent of original size [2022-07-21 17:16:57,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 44 [2022-07-21 17:16:58,114 INFO L356 Elim1Store]: treesize reduction 65, result has 40.9 percent of original size [2022-07-21 17:16:58,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 66 [2022-07-21 17:16:58,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-21 17:16:58,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-21 17:16:58,373 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 42 treesize of output 38 [2022-07-21 17:16:58,437 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 35 treesize of output 19 [2022-07-21 17:16:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:16:58,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:16:58,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_337) c_append_~head.base) (bvadd (_ bv4 32) c_append_~head.offset))) (_ bv1 1))) is different from false [2022-07-21 17:16:58,532 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_25 (_ BitVec 32)) (v_ArrVal_334 (_ BitVec 1)) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_25)))) (= (_ bv1 1) (select (store |c_#valid| v_append_~node~0.base_25 v_ArrVal_334) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_25 v_ArrVal_337) |c_append_#in~head.base|) (bvadd (_ bv4 32) |c_append_#in~head.offset|)))))) is different from false [2022-07-21 17:16:58,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_25 (_ BitVec 32)) (v_ArrVal_334 (_ BitVec 1)) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_25)))) (= (select (store |c_#valid| v_append_~node~0.base_25 v_ArrVal_334) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_25 v_ArrVal_337) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (_ bv1 1)))) is different from false [2022-07-21 17:16:58,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:16:58,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-21 17:16:58,647 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 172 treesize of output 112 [2022-07-21 17:16:58,652 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 44 treesize of output 40 [2022-07-21 17:16:58,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-07-21 17:16:58,669 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 17:16:58,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-07-21 17:16:58,878 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-21 17:16:59,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:16:59,070 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Quantifier not flattened at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForLocalEliminatees.findSomePushableLocalEliminateeSet(QuantifierPushUtilsForLocalEliminatees.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForLocalEliminatees.pushLocalEliminateesOverCorrespondingFiniteJunction(QuantifierPushUtilsForLocalEliminatees.java:97) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) 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:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) 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.computeBackwardSequence(IterativePredicateTransformer.java:364) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) 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-21 17:16:59,072 INFO L158 Benchmark]: Toolchain (without parser) took 19442.63ms. Allocated memory was 60.8MB in the beginning and 136.3MB in the end (delta: 75.5MB). Free memory was 40.4MB in the beginning and 44.5MB in the end (delta: -4.1MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. [2022-07-21 17:16:59,072 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:16:59,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.92ms. Allocated memory is still 60.8MB. Free memory was 40.2MB in the beginning and 35.7MB in the end (delta: 4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 17:16:59,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.20ms. Allocated memory is still 60.8MB. Free memory was 35.7MB in the beginning and 32.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:16:59,073 INFO L158 Benchmark]: Boogie Preprocessor took 60.29ms. Allocated memory is still 60.8MB. Free memory was 32.7MB in the beginning and 29.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 17:16:59,073 INFO L158 Benchmark]: RCFGBuilder took 1012.21ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 29.7MB in the beginning and 33.1MB in the end (delta: -3.4MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2022-07-21 17:16:59,073 INFO L158 Benchmark]: TraceAbstraction took 17901.34ms. Allocated memory was 73.4MB in the beginning and 136.3MB in the end (delta: 62.9MB). Free memory was 52.8MB in the beginning and 44.5MB in the end (delta: 8.3MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2022-07-21 17:16:59,074 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.16ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.92ms. Allocated memory is still 60.8MB. Free memory was 40.2MB in the beginning and 35.7MB in the end (delta: 4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.20ms. Allocated memory is still 60.8MB. Free memory was 35.7MB in the beginning and 32.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.29ms. Allocated memory is still 60.8MB. Free memory was 32.7MB in the beginning and 29.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1012.21ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 29.7MB in the beginning and 33.1MB in the end (delta: -3.4MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17901.34ms. Allocated memory was 73.4MB in the beginning and 136.3MB in the end (delta: 62.9MB). Free memory was 52.8MB in the beginning and 44.5MB in the end (delta: 8.3MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Quantifier not flattened de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Quantifier not flattened: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForLocalEliminatees.findSomePushableLocalEliminateeSet(QuantifierPushUtilsForLocalEliminatees.java:180) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 17:16:59,100 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 Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Quantifier not flattened