./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_append_equal.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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:58:54,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:58:54,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:58:54,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:58:54,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:58:54,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:58:54,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:58:54,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:58:54,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:58:54,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:58:54,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:58:54,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:58:54,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:58:54,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:58:54,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:58:54,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:58:54,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:58:54,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:58:54,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:58:54,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:58:54,774 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:58:54,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:58:54,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:58:54,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:58:54,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:58:54,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:58:54,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:58:54,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:58:54,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:58:54,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:58:54,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:58:54,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:58:54,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:58:54,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:58:54,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:58:54,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:58:54,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:58:54,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:58:54,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:58:54,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:58:54,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:58:54,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:58:54,793 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:58:54,809 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:58:54,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:58:54,810 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:58:54,810 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:58:54,811 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:58:54,811 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:58:54,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:58:54,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:58:54,812 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:58:54,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:58:54,813 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:58:54,813 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:58:54,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:58:54,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:58:54,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:58:54,813 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:58:54,813 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:58:54,813 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:58:54,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:58:54,814 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:58:54,814 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:58:54,814 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:58:54,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:58:54,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:58:54,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:58:54,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:58:54,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:58:54,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:58:54,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:58:54,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:58:54,815 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2022-07-14 06:58:54,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:58:55,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:58:55,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:58:55,024 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:58:55,025 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:58:55,026 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2022-07-14 06:58:55,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d050d6f2/dd490b6d6331433e929965cad7deb575/FLAG8967c24f4 [2022-07-14 06:58:55,494 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:58:55,504 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2022-07-14 06:58:55,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d050d6f2/dd490b6d6331433e929965cad7deb575/FLAG8967c24f4 [2022-07-14 06:58:55,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d050d6f2/dd490b6d6331433e929965cad7deb575 [2022-07-14 06:58:55,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:58:55,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:58:55,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:58:55,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:58:55,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:58:55,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:58:55" (1/1) ... [2022-07-14 06:58:55,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69d7b518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:55, skipping insertion in model container [2022-07-14 06:58:55,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:58:55" (1/1) ... [2022-07-14 06:58:55,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:58:55,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:58:55,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2022-07-14 06:58:55,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:58:55,801 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:58:55,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2022-07-14 06:58:55,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:58:55,877 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:58:55,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:55 WrapperNode [2022-07-14 06:58:55,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:58:55,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:58:55,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:58:55,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:58:55,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:55" (1/1) ... [2022-07-14 06:58:55,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:55" (1/1) ... [2022-07-14 06:58:55,930 INFO L137 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2022-07-14 06:58:55,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:58:55,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:58:55,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:58:55,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:58:55,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:55" (1/1) ... [2022-07-14 06:58:55,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:55" (1/1) ... [2022-07-14 06:58:55,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:55" (1/1) ... [2022-07-14 06:58:55,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:55" (1/1) ... [2022-07-14 06:58:55,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:55" (1/1) ... [2022-07-14 06:58:55,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:55" (1/1) ... [2022-07-14 06:58:55,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:55" (1/1) ... [2022-07-14 06:58:55,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:58:55,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:58:55,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:58:55,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:58:55,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:55" (1/1) ... [2022-07-14 06:58:55,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:58:55,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:55,995 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-14 06:58:56,010 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-14 06:58:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 06:58:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:58:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-14 06:58:56,023 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-14 06:58:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:58:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:58:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 06:58:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:58:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:58:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:58:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 06:58:56,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:58:56,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:58:56,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:58:56,140 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:58:56,144 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:58:56,360 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:58:56,367 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:58:56,368 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-14 06:58:56,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:58:56 BoogieIcfgContainer [2022-07-14 06:58:56,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:58:56,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:58:56,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:58:56,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:58:56,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:58:55" (1/3) ... [2022-07-14 06:58:56,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bec6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:58:56, skipping insertion in model container [2022-07-14 06:58:56,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:55" (2/3) ... [2022-07-14 06:58:56,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bec6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:58:56, skipping insertion in model container [2022-07-14 06:58:56,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:58:56" (3/3) ... [2022-07-14 06:58:56,377 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2022-07-14 06:58:56,387 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:58:56,387 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2022-07-14 06:58:56,426 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:58:56,430 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@65070d9f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e668cab [2022-07-14 06:58:56,431 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2022-07-14 06:58:56,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:58:56,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:56,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:56,440 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:58:56,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:56,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904761, now seen corresponding path program 1 times [2022-07-14 06:58:56,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:56,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570192367] [2022-07-14 06:58:56,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:56,583 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-14 06:58:56,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:56,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570192367] [2022-07-14 06:58:56,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570192367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:56,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:58:56,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:58:56,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767064082] [2022-07-14 06:58:56,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:56,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:58:56,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:56,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:58:56,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:58:56,617 INFO L87 Difference]: Start difference. First operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 06:58:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:56,709 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-07-14 06:58:56,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:58:56,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-07-14 06:58:56,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:56,717 INFO L225 Difference]: With dead ends: 83 [2022-07-14 06:58:56,718 INFO L226 Difference]: Without dead ends: 80 [2022-07-14 06:58:56,719 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-14 06:58:56,722 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:56,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 130 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:58:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-14 06:58:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-14 06:58:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-07-14 06:58:56,757 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 7 [2022-07-14 06:58:56,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:56,757 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-07-14 06:58:56,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 06:58:56,757 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-07-14 06:58:56,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:58:56,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:56,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:56,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:58:56,759 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:58:56,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:56,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904762, now seen corresponding path program 1 times [2022-07-14 06:58:56,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:56,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309787655] [2022-07-14 06:58:56,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:56,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:56,823 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-14 06:58:56,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:56,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309787655] [2022-07-14 06:58:56,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309787655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:56,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:58:56,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:58:56,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618167432] [2022-07-14 06:58:56,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:56,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:58:56,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:56,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:58:56,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:58:56,830 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 06:58:56,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:56,884 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-07-14 06:58:56,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:58:56,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-07-14 06:58:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:56,888 INFO L225 Difference]: With dead ends: 78 [2022-07-14 06:58:56,889 INFO L226 Difference]: Without dead ends: 78 [2022-07-14 06:58:56,891 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-14 06:58:56,893 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:56,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:58:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-14 06:58:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-14 06:58:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-07-14 06:58:56,906 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 7 [2022-07-14 06:58:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:56,908 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-07-14 06:58:56,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 06:58:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-07-14 06:58:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:58:56,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:56,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:56,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:58:56,910 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:58:56,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:56,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810752, now seen corresponding path program 1 times [2022-07-14 06:58:56,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:56,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872329411] [2022-07-14 06:58:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:56,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:56,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 06:58:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:57,038 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-14 06:58:57,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:57,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872329411] [2022-07-14 06:58:57,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872329411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:57,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:58:57,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:58:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348089958] [2022-07-14 06:58:57,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:57,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:58:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:57,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:58:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:58:57,040 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:58:57,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:57,257 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-07-14 06:58:57,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:58:57,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-14 06:58:57,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:57,259 INFO L225 Difference]: With dead ends: 82 [2022-07-14 06:58:57,260 INFO L226 Difference]: Without dead ends: 82 [2022-07-14 06:58:57,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:58:57,261 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 11 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:57,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 300 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:58:57,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-14 06:58:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2022-07-14 06:58:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-07-14 06:58:57,269 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 13 [2022-07-14 06:58:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:57,269 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-07-14 06:58:57,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:58:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-07-14 06:58:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:58:57,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:57,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:57,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:58:57,271 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:58:57,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810753, now seen corresponding path program 1 times [2022-07-14 06:58:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:57,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730952520] [2022-07-14 06:58:57,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:57,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 06:58:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:57,381 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-14 06:58:57,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:57,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730952520] [2022-07-14 06:58:57,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730952520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:57,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:58:57,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:58:57,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714333624] [2022-07-14 06:58:57,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:57,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:58:57,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:57,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:58:57,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:58:57,384 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:58:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:57,543 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-07-14 06:58:57,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:58:57,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-14 06:58:57,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:57,545 INFO L225 Difference]: With dead ends: 81 [2022-07-14 06:58:57,545 INFO L226 Difference]: Without dead ends: 81 [2022-07-14 06:58:57,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:58:57,547 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:57,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 316 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:58:57,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-14 06:58:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2022-07-14 06:58:57,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2022-07-14 06:58:57,554 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 13 [2022-07-14 06:58:57,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:57,554 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2022-07-14 06:58:57,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:58:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-07-14 06:58:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:58:57,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:57,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:57,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:58:57,556 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:58:57,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:57,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1399608384, now seen corresponding path program 1 times [2022-07-14 06:58:57,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:57,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242679766] [2022-07-14 06:58:57,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:57,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:57,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 06:58:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:57,625 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-14 06:58:57,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:57,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242679766] [2022-07-14 06:58:57,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242679766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:57,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:58:57,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:58:57,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015552443] [2022-07-14 06:58:57,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:57,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:58:57,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:57,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:58:57,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:58:57,629 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:58:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:57,687 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-07-14 06:58:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:58:57,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-14 06:58:57,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:57,691 INFO L225 Difference]: With dead ends: 82 [2022-07-14 06:58:57,691 INFO L226 Difference]: Without dead ends: 82 [2022-07-14 06:58:57,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:58:57,694 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:57,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 192 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:58:57,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-14 06:58:57,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2022-07-14 06:58:57,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:57,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-07-14 06:58:57,705 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 15 [2022-07-14 06:58:57,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:57,705 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-07-14 06:58:57,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:58:57,705 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-07-14 06:58:57,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:58:57,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:57,706 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:57,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:58:57,706 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:58:57,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:57,707 INFO L85 PathProgramCache]: Analyzing trace with hash -898428094, now seen corresponding path program 1 times [2022-07-14 06:58:57,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:57,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072224532] [2022-07-14 06:58:57,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:57,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:57,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 06:58:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:57,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 06:58:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 06:58:57,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:57,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072224532] [2022-07-14 06:58:57,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072224532] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:57,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781176725] [2022-07-14 06:58:57,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:57,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:57,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:57,804 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-14 06:58:57,836 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-14 06:58:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:57,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:58:57,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:58:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:58:57,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:58:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 06:58:58,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781176725] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:58:58,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:58:58,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-07-14 06:58:58,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384269636] [2022-07-14 06:58:58,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:58:58,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:58:58,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:58,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:58:58,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:58:58,030 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 06:58:58,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:58,125 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-07-14 06:58:58,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:58:58,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-07-14 06:58:58,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:58,127 INFO L225 Difference]: With dead ends: 83 [2022-07-14 06:58:58,127 INFO L226 Difference]: Without dead ends: 83 [2022-07-14 06:58:58,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:58:58,134 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:58,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 267 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:58:58,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-14 06:58:58,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-14 06:58:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:58:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2022-07-14 06:58:58,140 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 28 [2022-07-14 06:58:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:58,141 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2022-07-14 06:58:58,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 06:58:58,141 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2022-07-14 06:58:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:58:58,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:58,142 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:58,161 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-14 06:58:58,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-14 06:58:58,360 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:58:58,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:58,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186176, now seen corresponding path program 2 times [2022-07-14 06:58:58,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:58,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928091135] [2022-07-14 06:58:58,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:58,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:58,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 06:58:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:58,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 06:58:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:58,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-14 06:58:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 06:58:58,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:58,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928091135] [2022-07-14 06:58:58,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928091135] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:58,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947169973] [2022-07-14 06:58:58,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:58:58,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:58,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:58,640 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-14 06:58:58,668 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-14 06:58:58,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:58:58,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:58:58,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-14 06:58:58,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:58:58,820 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-14 06:58:58,849 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-14 06:58:58,909 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:58:58,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:58:58,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:58:59,080 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:58:59,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:58:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 06:58:59,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:58:59,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947169973] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:59,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:58:59,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2022-07-14 06:58:59,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387905488] [2022-07-14 06:58:59,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:58:59,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:58:59,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:59,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:58:59,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:58:59,216 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:58:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:59,451 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-07-14 06:58:59,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:58:59,452 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-07-14 06:58:59,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:59,452 INFO L225 Difference]: With dead ends: 91 [2022-07-14 06:58:59,452 INFO L226 Difference]: Without dead ends: 91 [2022-07-14 06:58:59,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:58:59,455 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 87 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:59,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 300 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 224 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2022-07-14 06:58:59,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-14 06:58:59,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2022-07-14 06:58:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 74 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:58:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2022-07-14 06:58:59,459 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 41 [2022-07-14 06:58:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:59,459 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2022-07-14 06:58:59,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:58:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2022-07-14 06:58:59,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:58:59,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:59,460 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:59,495 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-14 06:58:59,667 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,SelfDestructingSolverStorable6 [2022-07-14 06:58:59,668 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:58:59,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:59,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186175, now seen corresponding path program 1 times [2022-07-14 06:58:59,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:59,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417765827] [2022-07-14 06:58:59,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:59,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:59,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 06:58:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:59,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 06:58:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:59,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-14 06:58:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-14 06:58:59,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:59,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417765827] [2022-07-14 06:58:59,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417765827] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:59,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13896083] [2022-07-14 06:58:59,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:59,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:59,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:59,881 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-14 06:58:59,882 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-14 06:58:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:59,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-14 06:58:59,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:00,005 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-14 06:59:00,019 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-14 06:59:00,111 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-14 06:59:00,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:00,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:59:00,328 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 32019 column 46: unknown constant v_#length_BEFORE_CALL_2 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) 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-14 06:59:00,330 INFO L158 Benchmark]: Toolchain (without parser) took 4804.85ms. Allocated memory was 92.3MB in the beginning and 151.0MB in the end (delta: 58.7MB). Free memory was 59.0MB in the beginning and 98.8MB in the end (delta: -39.8MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-07-14 06:59:00,331 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 92.3MB. Free memory was 47.0MB in the beginning and 46.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:59:00,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.41ms. Allocated memory is still 92.3MB. Free memory was 58.8MB in the beginning and 61.2MB in the end (delta: -2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 06:59:00,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.75ms. Allocated memory is still 92.3MB. Free memory was 61.2MB in the beginning and 59.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:59:00,331 INFO L158 Benchmark]: Boogie Preprocessor took 36.09ms. Allocated memory is still 92.3MB. Free memory was 58.9MB in the beginning and 57.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:59:00,331 INFO L158 Benchmark]: RCFGBuilder took 402.33ms. Allocated memory is still 92.3MB. Free memory was 57.2MB in the beginning and 40.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-14 06:59:00,331 INFO L158 Benchmark]: TraceAbstraction took 3958.70ms. Allocated memory was 92.3MB in the beginning and 151.0MB in the end (delta: 58.7MB). Free memory was 40.0MB in the beginning and 98.8MB in the end (delta: -58.8MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. [2022-07-14 06:59:00,332 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.11ms. Allocated memory is still 92.3MB. Free memory was 47.0MB in the beginning and 46.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.41ms. Allocated memory is still 92.3MB. Free memory was 58.8MB in the beginning and 61.2MB in the end (delta: -2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.75ms. Allocated memory is still 92.3MB. Free memory was 61.2MB in the beginning and 59.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.09ms. Allocated memory is still 92.3MB. Free memory was 58.9MB in the beginning and 57.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 402.33ms. Allocated memory is still 92.3MB. Free memory was 57.2MB in the beginning and 40.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3958.70ms. Allocated memory was 92.3MB in the beginning and 151.0MB in the end (delta: 58.7MB). Free memory was 40.0MB in the beginning and 98.8MB in the end (delta: -58.8MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 32019 column 46: unknown constant v_#length_BEFORE_CALL_2 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 32019 column 46: unknown constant v_#length_BEFORE_CALL_2: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 06:59:00,345 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 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_append_equal.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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:59:02,044 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:59:02,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:59:02,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:59:02,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:59:02,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:59:02,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:59:02,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:59:02,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:59:02,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:59:02,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:59:02,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:59:02,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:59:02,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:59:02,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:59:02,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:59:02,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:59:02,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:59:02,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:59:02,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:59:02,095 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:59:02,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:59:02,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:59:02,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:59:02,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:59:02,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:59:02,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:59:02,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:59:02,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:59:02,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:59:02,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:59:02,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:59:02,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:59:02,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:59:02,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:59:02,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:59:02,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:59:02,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:59:02,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:59:02,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:59:02,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:59:02,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:59:02,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 06:59:02,148 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:59:02,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:59:02,149 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:59:02,149 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:59:02,150 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:59:02,150 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:59:02,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:59:02,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:59:02,151 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:59:02,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:59:02,151 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:59:02,151 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:59:02,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:59:02,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:59:02,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:59:02,161 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:59:02,161 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:59:02,161 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:59:02,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:59:02,162 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:59:02,162 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 06:59:02,163 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 06:59:02,163 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:59:02,163 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:59:02,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:59:02,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:59:02,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:59:02,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:59:02,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:59:02,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:59:02,165 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 06:59:02,166 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 06:59:02,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 06:59:02,166 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2022-07-14 06:59:02,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:59:02,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:59:02,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:59:02,441 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:59:02,443 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:59:02,444 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2022-07-14 06:59:02,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/384272ad6/6e90753fca704a9ebf2942b9321ed179/FLAG24d392e3a [2022-07-14 06:59:02,925 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:59:02,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2022-07-14 06:59:02,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/384272ad6/6e90753fca704a9ebf2942b9321ed179/FLAG24d392e3a [2022-07-14 06:59:02,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/384272ad6/6e90753fca704a9ebf2942b9321ed179 [2022-07-14 06:59:02,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:59:02,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:59:02,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:59:02,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:59:02,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:59:02,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:59:02" (1/1) ... [2022-07-14 06:59:02,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2854c2ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:02, skipping insertion in model container [2022-07-14 06:59:02,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:59:02" (1/1) ... [2022-07-14 06:59:02,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:59:03,013 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:59:03,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2022-07-14 06:59:03,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:59:03,289 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:59:03,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2022-07-14 06:59:03,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:59:03,367 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:59:03,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:03 WrapperNode [2022-07-14 06:59:03,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:59:03,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:59:03,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:59:03,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:59:03,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:03" (1/1) ... [2022-07-14 06:59:03,401 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:03" (1/1) ... [2022-07-14 06:59:03,426 INFO L137 Inliner]: procedures = 130, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2022-07-14 06:59:03,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:59:03,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:59:03,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:59:03,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:59:03,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:03" (1/1) ... [2022-07-14 06:59:03,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:03" (1/1) ... [2022-07-14 06:59:03,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:03" (1/1) ... [2022-07-14 06:59:03,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:03" (1/1) ... [2022-07-14 06:59:03,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:03" (1/1) ... [2022-07-14 06:59:03,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:03" (1/1) ... [2022-07-14 06:59:03,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:03" (1/1) ... [2022-07-14 06:59:03,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:59:03,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:59:03,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:59:03,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:59:03,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:03" (1/1) ... [2022-07-14 06:59:03,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:59:03,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:59:03,524 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-14 06:59:03,543 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-14 06:59:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 06:59:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-14 06:59:03,556 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-14 06:59:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:59:03,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:59:03,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 06:59:03,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:59:03,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:59:03,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:59:03,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 06:59:03,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 06:59:03,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 06:59:03,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:59:03,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:59:03,684 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:59:03,685 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:59:04,080 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:59:04,087 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:59:04,087 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-14 06:59:04,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:59:04 BoogieIcfgContainer [2022-07-14 06:59:04,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:59:04,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:59:04,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:59:04,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:59:04,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:59:02" (1/3) ... [2022-07-14 06:59:04,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70365b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:59:04, skipping insertion in model container [2022-07-14 06:59:04,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:03" (2/3) ... [2022-07-14 06:59:04,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70365b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:59:04, skipping insertion in model container [2022-07-14 06:59:04,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:59:04" (3/3) ... [2022-07-14 06:59:04,111 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2022-07-14 06:59:04,121 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:59:04,122 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2022-07-14 06:59:04,172 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:59:04,177 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@e8f6ac, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5f5aff6d [2022-07-14 06:59:04,177 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2022-07-14 06:59:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:59:04,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:04,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:04,188 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:04,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904761, now seen corresponding path program 1 times [2022-07-14 06:59:04,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:04,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373905302] [2022-07-14 06:59:04,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:04,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:04,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:04,206 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-14 06:59:04,208 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-14 06:59:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:04,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:59:04,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:04,343 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-14 06:59:04,353 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-14 06:59:04,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:04,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:04,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373905302] [2022-07-14 06:59:04,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373905302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:04,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:04,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:59:04,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645530297] [2022-07-14 06:59:04,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:04,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:59:04,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:04,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:59:04,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:59:04,388 INFO L87 Difference]: Start difference. First operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 06:59:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:04,550 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-07-14 06:59:04,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:59:04,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-07-14 06:59:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:04,567 INFO L225 Difference]: With dead ends: 83 [2022-07-14 06:59:04,567 INFO L226 Difference]: Without dead ends: 80 [2022-07-14 06:59:04,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-14 06:59:04,573 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:04,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 130 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:59:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-14 06:59:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-14 06:59:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-07-14 06:59:04,611 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 7 [2022-07-14 06:59:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:04,611 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-07-14 06:59:04,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 06:59:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-07-14 06:59:04,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:59:04,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:04,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:04,625 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-14 06:59:04,819 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-14 06:59:04,820 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:04,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:04,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904762, now seen corresponding path program 1 times [2022-07-14 06:59:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:04,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717440520] [2022-07-14 06:59:04,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:04,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:04,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:04,822 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-14 06:59:04,824 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-14 06:59:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:04,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:59:04,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:04,893 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-14 06:59:04,912 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-14 06:59:04,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:04,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:04,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717440520] [2022-07-14 06:59:04,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717440520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:04,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:04,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:59:04,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264102888] [2022-07-14 06:59:04,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:04,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:59:04,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:04,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:59:04,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:59:04,917 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 06:59:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:05,033 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-07-14 06:59:05,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:59:05,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-07-14 06:59:05,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:05,035 INFO L225 Difference]: With dead ends: 78 [2022-07-14 06:59:05,035 INFO L226 Difference]: Without dead ends: 78 [2022-07-14 06:59:05,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-14 06:59:05,036 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:05,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:59:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-14 06:59:05,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-14 06:59:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-07-14 06:59:05,042 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 7 [2022-07-14 06:59:05,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:05,042 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-07-14 06:59:05,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 06:59:05,042 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-07-14 06:59:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:59:05,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:05,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:05,051 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-14 06:59:05,250 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-14 06:59:05,251 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:05,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810752, now seen corresponding path program 1 times [2022-07-14 06:59:05,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:05,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120376480] [2022-07-14 06:59:05,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:05,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:05,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:05,253 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-14 06:59:05,255 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-14 06:59:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:05,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:59:05,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:05,328 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-14 06:59:05,369 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-14 06:59:05,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:05,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:05,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120376480] [2022-07-14 06:59:05,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120376480] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:05,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:05,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:59:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335114759] [2022-07-14 06:59:05,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:05,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:59:05,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:05,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:59:05,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:59:05,385 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:05,628 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-07-14 06:59:05,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:59:05,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-14 06:59:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:05,630 INFO L225 Difference]: With dead ends: 82 [2022-07-14 06:59:05,630 INFO L226 Difference]: Without dead ends: 82 [2022-07-14 06:59:05,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:59:05,631 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:05,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 268 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:59:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-14 06:59:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2022-07-14 06:59:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-07-14 06:59:05,637 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 13 [2022-07-14 06:59:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:05,638 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-07-14 06:59:05,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-07-14 06:59:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:59:05,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:05,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:05,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:05,850 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-14 06:59:05,850 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:05,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:05,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810753, now seen corresponding path program 1 times [2022-07-14 06:59:05,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:05,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786895052] [2022-07-14 06:59:05,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:05,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:05,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:05,852 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-14 06:59:05,854 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-14 06:59:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:05,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:59:05,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:05,941 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-14 06:59:06,024 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-14 06:59:06,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:06,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:06,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786895052] [2022-07-14 06:59:06,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786895052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:06,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:06,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:59:06,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475699172] [2022-07-14 06:59:06,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:06,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:59:06,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:06,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:59:06,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:59:06,026 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:06,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:06,286 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-07-14 06:59:06,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:59:06,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-14 06:59:06,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:06,288 INFO L225 Difference]: With dead ends: 81 [2022-07-14 06:59:06,288 INFO L226 Difference]: Without dead ends: 81 [2022-07-14 06:59:06,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:59:06,289 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 9 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:06,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 284 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:59:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-14 06:59:06,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2022-07-14 06:59:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2022-07-14 06:59:06,293 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 13 [2022-07-14 06:59:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:06,294 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2022-07-14 06:59:06,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-07-14 06:59:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:59:06,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:06,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:06,305 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-14 06:59:06,501 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-14 06:59:06,501 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:06,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:06,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1399608384, now seen corresponding path program 1 times [2022-07-14 06:59:06,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:06,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977503965] [2022-07-14 06:59:06,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:06,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:06,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:06,504 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-14 06:59:06,509 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-14 06:59:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:06,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:59:06,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:06,586 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-14 06:59:06,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:06,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:06,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977503965] [2022-07-14 06:59:06,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977503965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:06,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:06,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:59:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694457948] [2022-07-14 06:59:06,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:06,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:59:06,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:06,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:59:06,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:59:06,587 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:06,599 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-07-14 06:59:06,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:59:06,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-14 06:59:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:06,601 INFO L225 Difference]: With dead ends: 82 [2022-07-14 06:59:06,602 INFO L226 Difference]: Without dead ends: 82 [2022-07-14 06:59:06,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-14 06:59:06,605 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:06,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 159 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:59:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-14 06:59:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2022-07-14 06:59:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-07-14 06:59:06,620 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 15 [2022-07-14 06:59:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:06,620 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-07-14 06:59:06,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:06,620 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-07-14 06:59:06,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:59:06,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:06,621 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:06,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:06,821 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-14 06:59:06,822 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:06,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:06,822 INFO L85 PathProgramCache]: Analyzing trace with hash -898428094, now seen corresponding path program 1 times [2022-07-14 06:59:06,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:06,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257838021] [2022-07-14 06:59:06,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:06,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:06,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:06,824 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-14 06:59:06,826 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-14 06:59:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:06,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:59:06,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:59:06,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 06:59:06,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:06,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257838021] [2022-07-14 06:59:06,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257838021] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:59:06,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:59:06,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-14 06:59:06,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737010611] [2022-07-14 06:59:06,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:59:06,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:59:06,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:06,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:59:06,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:59:06,996 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 06:59:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:07,029 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2022-07-14 06:59:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:59:07,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-07-14 06:59:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:07,030 INFO L225 Difference]: With dead ends: 88 [2022-07-14 06:59:07,031 INFO L226 Difference]: Without dead ends: 88 [2022-07-14 06:59:07,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:59:07,031 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 11 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:07,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 317 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:59:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-14 06:59:07,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2022-07-14 06:59:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2022-07-14 06:59:07,035 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 28 [2022-07-14 06:59:07,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:07,035 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2022-07-14 06:59:07,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 06:59:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2022-07-14 06:59:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:59:07,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:07,037 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:07,046 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-14 06:59:07,239 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-14 06:59:07,240 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:07,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:07,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186176, now seen corresponding path program 2 times [2022-07-14 06:59:07,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:07,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134179659] [2022-07-14 06:59:07,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:59:07,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:07,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:07,256 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-14 06:59:07,262 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-14 06:59:07,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:59:07,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:59:07,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 06:59:07,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:07,426 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-14 06:59:07,449 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 5 [2022-07-14 06:59:07,558 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:59:07,558 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 20 treesize of output 27 [2022-07-14 06:59:07,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-14 06:59:07,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:07,698 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 14 treesize of output 16 [2022-07-14 06:59:07,852 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:59:07,853 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-14 06:59:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:59:07,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:08,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:08,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134179659] [2022-07-14 06:59:08,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134179659] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:08,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1984516270] [2022-07-14 06:59:08,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:59:08,125 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:59:08,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:59:08,128 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:59:08,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-07-14 06:59:08,293 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-14 06:59:08,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703545365] [2022-07-14 06:59:08,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:59:08,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:59:08,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:59:08,298 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-14 06:59:08,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 1 [2022-07-14 06:59:08,298 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-14 06:59:08,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:59:08,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:59:08,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 06:59:08,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:08,467 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-14 06:59:10,579 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:59:10,579 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 18 treesize of output 25 [2022-07-14 06:59:10,680 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:59:10,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 17 [2022-07-14 06:59:10,777 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:59:10,777 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-14 06:59:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 8 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 06:59:10,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 06:59:11,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703545365] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:59:11,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:59:11,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 5] total 15 [2022-07-14 06:59:11,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563202370] [2022-07-14 06:59:11,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:59:11,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 06:59:11,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:11,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 06:59:11,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=220, Unknown=1, NotChecked=0, Total=272 [2022-07-14 06:59:11,222 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-14 06:59:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:19,500 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2022-07-14 06:59:19,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:59:19,500 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 41 [2022-07-14 06:59:19,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:19,501 INFO L225 Difference]: With dead ends: 100 [2022-07-14 06:59:19,501 INFO L226 Difference]: Without dead ends: 100 [2022-07-14 06:59:19,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 106 SyntacticMatches, 19 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=92, Invalid=369, Unknown=1, NotChecked=0, Total=462 [2022-07-14 06:59:19,502 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 36 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:19,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 303 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 138 Unchecked, 0.1s Time] [2022-07-14 06:59:19,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-14 06:59:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2022-07-14 06:59:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 82 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-07-14 06:59:19,505 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 41 [2022-07-14 06:59:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:19,505 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-07-14 06:59:19,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-14 06:59:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-07-14 06:59:19,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:59:19,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:19,506 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:19,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-14 06:59:19,724 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-14 06:59:19,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:59:19,907 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:19,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:19,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186175, now seen corresponding path program 1 times [2022-07-14 06:59:19,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:19,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631498942] [2022-07-14 06:59:19,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:19,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:19,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:19,909 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:59:19,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 06:59:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:20,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-14 06:59:20,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:20,071 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-14 06:59:20,084 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-14 06:59:20,113 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-14 06:59:20,117 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-14 06:59:22,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:22,224 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-14 06:59:22,232 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:59:22,233 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-14 06:59:22,289 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-14 06:59:24,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:24,422 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 12 treesize of output 14 [2022-07-14 06:59:24,838 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:59:24,838 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 18 [2022-07-14 06:59:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:59:24,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:25,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:25,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631498942] [2022-07-14 06:59:25,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631498942] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:25,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [556128800] [2022-07-14 06:59:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:25,268 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:59:25,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:59:25,284 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:59:25,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-07-14 06:59:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:25,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 06:59:25,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:25,517 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-14 06:59:25,527 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-14 06:59:25,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:25,620 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-14 06:59:25,740 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-14 06:59:27,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:27,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:59:28,166 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-14 06:59:28,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:28,273 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-14 06:59:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 06:59:28,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:28,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [556128800] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:28,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:59:28,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-07-14 06:59:28,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61007039] [2022-07-14 06:59:28,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:59:28,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 06:59:28,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:28,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 06:59:28,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=479, Unknown=3, NotChecked=0, Total=552 [2022-07-14 06:59:28,496 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 06:59:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:34,565 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-07-14 06:59:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:59:34,566 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-07-14 06:59:34,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:34,566 INFO L225 Difference]: With dead ends: 94 [2022-07-14 06:59:34,566 INFO L226 Difference]: Without dead ends: 94 [2022-07-14 06:59:34,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=115, Invalid=810, Unknown=5, NotChecked=0, Total=930 [2022-07-14 06:59:34,567 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:34,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 660 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 277 Unchecked, 0.2s Time] [2022-07-14 06:59:34,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-14 06:59:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-14 06:59:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.453125) internal successors, (93), 87 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2022-07-14 06:59:34,577 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 41 [2022-07-14 06:59:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:34,577 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2022-07-14 06:59:34,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 06:59:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2022-07-14 06:59:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:59:34,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:34,578 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:34,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-14 06:59:34,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:34,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 06:59:34,987 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:34,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:34,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1843554241, now seen corresponding path program 1 times [2022-07-14 06:59:34,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:34,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197221578] [2022-07-14 06:59:34,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:34,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:34,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:34,989 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:59:34,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 06:59:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:35,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 06:59:35,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:35,115 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-14 06:59:35,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:35,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:35,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197221578] [2022-07-14 06:59:35,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197221578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:35,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:35,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:59:35,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829962568] [2022-07-14 06:59:35,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:35,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:59:35,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:35,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:59:35,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:59:35,116 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:59:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:35,190 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-07-14 06:59:35,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:59:35,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-14 06:59:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:35,191 INFO L225 Difference]: With dead ends: 104 [2022-07-14 06:59:35,191 INFO L226 Difference]: Without dead ends: 104 [2022-07-14 06:59:35,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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-14 06:59:35,192 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 51 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:35,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 77 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:59:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-14 06:59:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2022-07-14 06:59:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.421875) internal successors, (91), 85 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-07-14 06:59:35,194 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 43 [2022-07-14 06:59:35,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:35,195 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-07-14 06:59:35,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:59:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-07-14 06:59:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:59:35,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:35,195 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:35,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:35,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:59:35,403 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:35,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:35,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1843554242, now seen corresponding path program 1 times [2022-07-14 06:59:35,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:35,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400848905] [2022-07-14 06:59:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:35,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:35,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:35,405 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:59:35,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 06:59:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:35,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:59:35,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-14 06:59:35,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:35,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:35,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400848905] [2022-07-14 06:59:35,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400848905] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:35,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:35,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:59:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545377309] [2022-07-14 06:59:35,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:35,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:59:35,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:35,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:59:35,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:59:35,568 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:35,688 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-07-14 06:59:35,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:59:35,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-07-14 06:59:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:35,689 INFO L225 Difference]: With dead ends: 90 [2022-07-14 06:59:35,689 INFO L226 Difference]: Without dead ends: 90 [2022-07-14 06:59:35,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:59:35,690 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 108 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:35,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 96 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:59:35,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-14 06:59:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-14 06:59:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.390625) internal successors, (89), 83 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-07-14 06:59:35,692 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 43 [2022-07-14 06:59:35,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:35,696 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-07-14 06:59:35,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:35,697 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-07-14 06:59:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:59:35,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:35,697 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:35,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:35,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:59:35,898 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:35,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:35,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2129100770, now seen corresponding path program 1 times [2022-07-14 06:59:35,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:35,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842092943] [2022-07-14 06:59:35,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:35,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:35,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:35,900 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:59:35,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 06:59:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:36,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:59:36,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-14 06:59:36,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:36,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:36,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842092943] [2022-07-14 06:59:36,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842092943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:36,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:36,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:59:36,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355928363] [2022-07-14 06:59:36,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:36,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:59:36,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:36,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:59:36,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:59:36,060 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:36,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:36,197 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2022-07-14 06:59:36,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:59:36,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-07-14 06:59:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:36,198 INFO L225 Difference]: With dead ends: 101 [2022-07-14 06:59:36,199 INFO L226 Difference]: Without dead ends: 101 [2022-07-14 06:59:36,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:59:36,199 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 109 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:36,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 91 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:59:36,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-14 06:59:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2022-07-14 06:59:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.375) internal successors, (88), 82 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2022-07-14 06:59:36,203 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 45 [2022-07-14 06:59:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:36,203 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2022-07-14 06:59:36,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-07-14 06:59:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:59:36,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:36,204 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:36,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:36,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:59:36,414 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:36,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2129100771, now seen corresponding path program 1 times [2022-07-14 06:59:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:36,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988717804] [2022-07-14 06:59:36,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:36,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:36,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:36,416 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:59:36,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 06:59:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:36,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:59:36,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-14 06:59:36,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:36,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:36,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988717804] [2022-07-14 06:59:36,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988717804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:36,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:36,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:59:36,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109568977] [2022-07-14 06:59:36,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:36,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:59:36,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:36,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:59:36,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:59:36,610 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:36,698 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-07-14 06:59:36,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:59:36,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-07-14 06:59:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:36,700 INFO L225 Difference]: With dead ends: 87 [2022-07-14 06:59:36,700 INFO L226 Difference]: Without dead ends: 87 [2022-07-14 06:59:36,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:59:36,700 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 146 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:36,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 78 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:59:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-14 06:59:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-14 06:59:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.34375) internal successors, (86), 80 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2022-07-14 06:59:36,703 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 45 [2022-07-14 06:59:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:36,703 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2022-07-14 06:59:36,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:36,703 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2022-07-14 06:59:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:59:36,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:36,703 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:36,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:36,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:59:36,912 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:36,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253767, now seen corresponding path program 1 times [2022-07-14 06:59:36,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:36,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606016493] [2022-07-14 06:59:36,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:36,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:36,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:36,914 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:59:36,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 06:59:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:37,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-14 06:59:37,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:37,167 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-14 06:59:37,263 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 6 treesize of output 5 [2022-07-14 06:59:37,375 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 9 treesize of output 5 [2022-07-14 06:59:37,379 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 7 treesize of output 3 [2022-07-14 06:59:37,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:37,604 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-14 06:59:37,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:37,614 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-14 06:59:37,637 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-14 06:59:37,637 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 16 treesize of output 18 [2022-07-14 06:59:37,754 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 17 treesize of output 9 [2022-07-14 06:59:37,759 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-14 06:59:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:59:38,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:38,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:38,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606016493] [2022-07-14 06:59:38,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606016493] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:38,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [393207212] [2022-07-14 06:59:38,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:38,539 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:59:38,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:59:38,541 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:59:38,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-07-14 06:59:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:38,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-14 06:59:38,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:38,947 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-14 06:59:38,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:59:39,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-14 06:59:39,562 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 7 treesize of output 3 [2022-07-14 06:59:40,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:40,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-14 06:59:40,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:40,061 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-14 06:59:40,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:40,070 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 16 treesize of output 18 [2022-07-14 06:59:40,083 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 06:59:40,083 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 19 treesize of output 19 [2022-07-14 06:59:40,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:59:40,280 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-14 06:59:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:59:40,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:40,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [393207212] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:40,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:59:40,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-07-14 06:59:40,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838184764] [2022-07-14 06:59:40,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:59:40,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-14 06:59:40,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:40,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-14 06:59:40,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1249, Unknown=24, NotChecked=0, Total=1406 [2022-07-14 06:59:40,942 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 33 states, 30 states have (on average 2.3) internal successors, (69), 29 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 06:59:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:41,892 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-07-14 06:59:41,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:59:41,893 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.3) internal successors, (69), 29 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2022-07-14 06:59:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:41,893 INFO L225 Difference]: With dead ends: 88 [2022-07-14 06:59:41,893 INFO L226 Difference]: Without dead ends: 88 [2022-07-14 06:59:41,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=208, Invalid=1832, Unknown=30, NotChecked=0, Total=2070 [2022-07-14 06:59:41,894 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 22 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:41,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 364 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 170 Invalid, 0 Unknown, 118 Unchecked, 0.3s Time] [2022-07-14 06:59:41,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-14 06:59:41,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-14 06:59:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.353846153846154) internal successors, (88), 81 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-07-14 06:59:41,896 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 45 [2022-07-14 06:59:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:41,896 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-07-14 06:59:41,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.3) internal successors, (69), 29 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 06:59:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-07-14 06:59:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:59:41,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:41,897 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:41,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:42,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:42,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 06:59:42,306 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:42,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253766, now seen corresponding path program 1 times [2022-07-14 06:59:42,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:42,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725489107] [2022-07-14 06:59:42,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:42,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:42,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:42,308 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:59:42,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-14 06:59:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:42,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 06:59:42,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:42,536 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-14 06:59:42,613 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 6 treesize of output 5 [2022-07-14 06:59:42,692 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 12 treesize of output 8 [2022-07-14 06:59:42,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:42,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-14 06:59:42,887 INFO L356 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-07-14 06:59:42,887 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 19 treesize of output 24 [2022-07-14 06:59:42,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-14 06:59:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:59:43,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:43,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:43,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725489107] [2022-07-14 06:59:43,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725489107] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:43,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1803775697] [2022-07-14 06:59:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:43,340 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:59:43,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:59:43,341 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:59:43,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-07-14 06:59:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:43,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 06:59:43,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:43,671 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-14 06:59:43,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-14 06:59:44,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:44,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-14 06:59:44,186 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-14 06:59:44,186 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 25 treesize of output 36 [2022-07-14 06:59:44,303 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 28 treesize of output 16 [2022-07-14 06:59:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:59:44,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:44,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1803775697] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:44,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:59:44,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2022-07-14 06:59:44,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825708521] [2022-07-14 06:59:44,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:59:44,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-14 06:59:44,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:44,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-14 06:59:44,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=924, Unknown=16, NotChecked=0, Total=1056 [2022-07-14 06:59:44,538 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 30 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 06:59:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:45,153 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-07-14 06:59:45,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:59:45,154 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2022-07-14 06:59:45,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:45,154 INFO L225 Difference]: With dead ends: 117 [2022-07-14 06:59:45,154 INFO L226 Difference]: Without dead ends: 117 [2022-07-14 06:59:45,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=187, Invalid=1431, Unknown=22, NotChecked=0, Total=1640 [2022-07-14 06:59:45,155 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 54 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:45,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 474 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 189 Unchecked, 0.3s Time] [2022-07-14 06:59:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-14 06:59:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2022-07-14 06:59:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 81 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-07-14 06:59:45,158 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 45 [2022-07-14 06:59:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:45,158 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-07-14 06:59:45,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 06:59:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-07-14 06:59:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 06:59:45,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:45,159 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:45,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:45,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-14 06:59:45,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:59:45,563 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:45,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:45,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1808436912, now seen corresponding path program 1 times [2022-07-14 06:59:45,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:45,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366698390] [2022-07-14 06:59:45,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:45,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:45,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:45,565 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:59:45,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-14 06:59:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:45,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 06:59:45,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-14 06:59:45,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:45,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:45,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366698390] [2022-07-14 06:59:45,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366698390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:45,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:45,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:59:45,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659875259] [2022-07-14 06:59:45,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:45,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:59:45,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:45,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:59:45,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:59:45,704 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:59:45,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:45,795 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-07-14 06:59:45,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:59:45,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-07-14 06:59:45,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:45,796 INFO L225 Difference]: With dead ends: 115 [2022-07-14 06:59:45,796 INFO L226 Difference]: Without dead ends: 115 [2022-07-14 06:59:45,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-14 06:59:45,796 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 35 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:45,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 124 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:59:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-14 06:59:45,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 86. [2022-07-14 06:59:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 79 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-07-14 06:59:45,803 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 47 [2022-07-14 06:59:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:45,803 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-07-14 06:59:45,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:59:45,803 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-07-14 06:59:45,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 06:59:45,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:45,804 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:45,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:46,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:59:46,008 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:46,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1808436913, now seen corresponding path program 1 times [2022-07-14 06:59:46,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:46,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340186969] [2022-07-14 06:59:46,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:46,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:46,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:46,016 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:59:46,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-14 06:59:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:46,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:59:46,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-14 06:59:46,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:46,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:46,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340186969] [2022-07-14 06:59:46,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340186969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:46,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:46,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:59:46,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233057284] [2022-07-14 06:59:46,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:46,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:59:46,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:46,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:59:46,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:59:46,173 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:59:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:46,331 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-07-14 06:59:46,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:59:46,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-07-14 06:59:46,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:46,332 INFO L225 Difference]: With dead ends: 115 [2022-07-14 06:59:46,332 INFO L226 Difference]: Without dead ends: 115 [2022-07-14 06:59:46,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-14 06:59:46,333 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 36 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:46,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 132 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:59:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-14 06:59:46,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 84. [2022-07-14 06:59:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 77 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-07-14 06:59:46,335 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 47 [2022-07-14 06:59:46,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:46,335 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-07-14 06:59:46,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:59:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-07-14 06:59:46,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:59:46,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:46,336 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:46,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:46,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:59:46,544 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:46,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:46,544 INFO L85 PathProgramCache]: Analyzing trace with hash -35949242, now seen corresponding path program 1 times [2022-07-14 06:59:46,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:46,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956032169] [2022-07-14 06:59:46,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:46,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:46,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:46,545 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:59:46,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-14 06:59:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:46,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 06:59:46,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:46,703 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-14 06:59:46,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-14 06:59:46,784 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 17 treesize of output 9 [2022-07-14 06:59:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 06:59:46,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:46,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:46,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956032169] [2022-07-14 06:59:46,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956032169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:46,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:46,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:59:46,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263384770] [2022-07-14 06:59:46,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:46,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:59:46,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:46,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:59:46,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:59:46,805 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:47,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:47,294 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2022-07-14 06:59:47,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:59:47,295 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-07-14 06:59:47,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:47,300 INFO L225 Difference]: With dead ends: 145 [2022-07-14 06:59:47,301 INFO L226 Difference]: Without dead ends: 145 [2022-07-14 06:59:47,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:59:47,302 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 159 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:47,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 279 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:59:47,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-14 06:59:47,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 88. [2022-07-14 06:59:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-07-14 06:59:47,307 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 48 [2022-07-14 06:59:47,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:47,307 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-07-14 06:59:47,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:47,307 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-07-14 06:59:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:59:47,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:47,308 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:47,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-14 06:59:47,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:59:47,516 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:47,516 INFO L85 PathProgramCache]: Analyzing trace with hash -35949241, now seen corresponding path program 1 times [2022-07-14 06:59:47,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:47,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691937446] [2022-07-14 06:59:47,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:47,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:47,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:47,518 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:59:47,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-14 06:59:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:47,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 06:59:47,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:47,700 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-14 06:59:47,812 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-14 06:59:47,818 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-14 06:59:47,843 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-14 06:59:47,847 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 17 treesize of output 9 [2022-07-14 06:59:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 06:59:47,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:47,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:47,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691937446] [2022-07-14 06:59:47,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691937446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:47,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:47,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:59:47,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642690725] [2022-07-14 06:59:47,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:47,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:59:47,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:47,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:59:47,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:59:47,889 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:48,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:48,402 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-07-14 06:59:48,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:59:48,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-07-14 06:59:48,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:48,403 INFO L225 Difference]: With dead ends: 135 [2022-07-14 06:59:48,403 INFO L226 Difference]: Without dead ends: 135 [2022-07-14 06:59:48,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:59:48,404 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 215 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:48,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 287 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:59:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-14 06:59:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 90. [2022-07-14 06:59:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.25) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2022-07-14 06:59:48,407 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 48 [2022-07-14 06:59:48,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:48,407 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2022-07-14 06:59:48,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:48,407 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2022-07-14 06:59:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 06:59:48,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:48,408 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:48,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:48,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:59:48,616 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:48,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:48,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1114427801, now seen corresponding path program 1 times [2022-07-14 06:59:48,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:48,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269156157] [2022-07-14 06:59:48,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:48,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:48,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:48,618 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:59:48,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-14 06:59:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:48,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 06:59:48,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:48,863 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-14 06:59:48,876 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 16 treesize of output 8 [2022-07-14 06:59:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 06:59:48,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:48,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:48,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269156157] [2022-07-14 06:59:48,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269156157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:48,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:48,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:59:48,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676066102] [2022-07-14 06:59:48,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:48,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:59:48,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:48,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:59:48,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:59:48,898 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:49,187 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2022-07-14 06:59:49,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:59:49,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-07-14 06:59:49,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:49,189 INFO L225 Difference]: With dead ends: 118 [2022-07-14 06:59:49,189 INFO L226 Difference]: Without dead ends: 118 [2022-07-14 06:59:49,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:59:49,190 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 147 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:49,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 445 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:59:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-14 06:59:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2022-07-14 06:59:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 83 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-07-14 06:59:49,193 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 49 [2022-07-14 06:59:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:49,194 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-07-14 06:59:49,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-07-14 06:59:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 06:59:49,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:49,194 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:49,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-14 06:59:49,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:59:49,395 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 06:59:49,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:49,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1553828739, now seen corresponding path program 1 times [2022-07-14 06:59:49,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:49,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418318367] [2022-07-14 06:59:49,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:49,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:49,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:49,397 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:59:49,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-14 06:59:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:49,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-14 06:59:49,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:49,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:49,646 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-14 06:59:49,684 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-14 06:59:49,799 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:59:49,799 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 18 treesize of output 25 [2022-07-14 06:59:50,201 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:59:50,202 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 06:59:50,253 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-14 06:59:50,253 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 25 treesize of output 42 [2022-07-14 06:59:50,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:59:50,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:59:51,026 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-14 06:59:51,027 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 53 [2022-07-14 06:59:51,047 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:59:51,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:59:51,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-07-14 06:59:51,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-07-14 06:59:51,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:51,465 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 06:59:51,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 77 [2022-07-14 06:59:51,503 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-14 06:59:51,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 46 [2022-07-14 06:59:51,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:51,533 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:59:51,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-14 06:59:51,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-14 06:59:52,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:59:52,264 INFO L356 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-07-14 06:59:52,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 64 [2022-07-14 06:59:52,302 INFO L356 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2022-07-14 06:59:52,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-07-14 06:59:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:59:52,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:53,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:53,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418318367] [2022-07-14 06:59:53,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418318367] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:53,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1494314687] [2022-07-14 06:59:53,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:53,548 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:59:53,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:59:53,549 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:59:53,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-07-14 06:59:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:53,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-14 06:59:53,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:54,028 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-14 06:59:54,034 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-14 06:59:54,933 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:59:54,933 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 18 [2022-07-14 06:59:54,958 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:59:54,958 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 21 treesize of output 28 [2022-07-14 06:59:55,277 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-14 06:59:55,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:59:56,236 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:56,236 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 38 [2022-07-14 06:59:56,243 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 19 treesize of output 15 [2022-07-14 06:59:56,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:59:56,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:56,256 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 15 treesize of output 7 [2022-07-14 06:59:56,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:56,945 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 20 treesize of output 22 [2022-07-14 06:59:56,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:56,971 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 06:59:56,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 67 [2022-07-14 06:59:57,000 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-14 06:59:57,001 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 37 treesize of output 39 [2022-07-14 06:59:57,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:57,020 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:59:57,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-14 06:59:57,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:57,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:59:57,848 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:57,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 47 [2022-07-14 06:59:57,866 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-14 06:59:57,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-07-14 06:59:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:59:58,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:58,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1494314687] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:58,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:59:58,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2022-07-14 06:59:58,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601170952] [2022-07-14 06:59:58,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:59:58,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-14 06:59:58,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:58,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-14 06:59:58,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3282, Unknown=36, NotChecked=0, Total=3540 [2022-07-14 06:59:58,703 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 53 states, 50 states have (on average 1.72) internal successors, (86), 43 states have internal predecessors, (86), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:00:01,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:01,743 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-07-14 07:00:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 07:00:01,744 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.72) internal successors, (86), 43 states have internal predecessors, (86), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2022-07-14 07:00:01,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:01,744 INFO L225 Difference]: With dead ends: 96 [2022-07-14 07:00:01,744 INFO L226 Difference]: Without dead ends: 96 [2022-07-14 07:00:01,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=403, Invalid=5560, Unknown=43, NotChecked=0, Total=6006 [2022-07-14 07:00:01,746 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 29 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 369 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:01,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 878 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 342 Invalid, 0 Unknown, 369 Unchecked, 0.6s Time] [2022-07-14 07:00:01,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-14 07:00:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-07-14 07:00:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.25) internal successors, (95), 87 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-07-14 07:00:01,749 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 49 [2022-07-14 07:00:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:01,749 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-07-14 07:00:01,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.72) internal successors, (86), 43 states have internal predecessors, (86), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:00:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-07-14 07:00:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 07:00:01,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:01,750 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:01,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:01,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:02,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 07:00:02,154 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 07:00:02,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:02,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1553828740, now seen corresponding path program 1 times [2022-07-14 07:00:02,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:02,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623840626] [2022-07-14 07:00:02,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:02,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:02,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:02,156 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 07:00:02,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-14 07:00:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:02,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-14 07:00:02,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:02,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:02,424 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-14 07:00:02,535 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 07:00:02,535 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 18 treesize of output 25 [2022-07-14 07:00:02,788 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-14 07:00:02,788 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 25 treesize of output 42 [2022-07-14 07:00:02,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 07:00:03,339 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-14 07:00:03,340 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 37 [2022-07-14 07:00:03,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-07-14 07:00:03,353 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 7 treesize of output 3 [2022-07-14 07:00:03,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:03,715 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 14 treesize of output 16 [2022-07-14 07:00:03,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:03,745 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 07:00:03,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 57 [2022-07-14 07:00:03,816 INFO L356 Elim1Store]: treesize reduction 81, result has 43.0 percent of original size [2022-07-14 07:00:03,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 83 [2022-07-14 07:00:04,095 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-14 07:00:04,469 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-14 07:00:04,469 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 50 [2022-07-14 07:00:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 07:00:04,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:05,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:05,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623840626] [2022-07-14 07:00:05,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623840626] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:05,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1934990152] [2022-07-14 07:00:05,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:05,105 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:00:05,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:00:05,106 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:00:05,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-07-14 07:00:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:05,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-14 07:00:05,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:05,580 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-14 07:00:06,239 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 07:00:06,240 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 21 treesize of output 28 [2022-07-14 07:00:06,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 07:00:07,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:07,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 21 [2022-07-14 07:00:07,309 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 7 treesize of output 3 [2022-07-14 07:00:07,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:07,870 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 07:00:07,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 46 [2022-07-14 07:00:07,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:07,883 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-14 07:00:07,930 INFO L356 Elim1Store]: treesize reduction 66, result has 42.6 percent of original size [2022-07-14 07:00:07,930 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 38 treesize of output 67 [2022-07-14 07:00:08,345 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-14 07:00:08,765 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:08,765 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 35 [2022-07-14 07:00:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:00:09,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:09,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1934990152] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:09,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:00:09,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 51 [2022-07-14 07:00:09,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418776277] [2022-07-14 07:00:09,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:00:09,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-14 07:00:09,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:09,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-14 07:00:09,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3162, Unknown=16, NotChecked=0, Total=3422 [2022-07-14 07:00:09,671 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 52 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 43 states have internal predecessors, (86), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:00:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:11,781 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-07-14 07:00:11,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 07:00:11,781 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 43 states have internal predecessors, (86), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2022-07-14 07:00:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:11,782 INFO L225 Difference]: With dead ends: 96 [2022-07-14 07:00:11,782 INFO L226 Difference]: Without dead ends: 96 [2022-07-14 07:00:11,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1970 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=426, Invalid=5404, Unknown=22, NotChecked=0, Total=5852 [2022-07-14 07:00:11,784 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 36 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:11,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 751 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 249 Invalid, 0 Unknown, 288 Unchecked, 0.4s Time] [2022-07-14 07:00:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-14 07:00:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-07-14 07:00:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.236842105263158) internal successors, (94), 87 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:11,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2022-07-14 07:00:11,787 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 49 [2022-07-14 07:00:11,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:11,787 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2022-07-14 07:00:11,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 43 states have internal predecessors, (86), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:00:11,787 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-07-14 07:00:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 07:00:11,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:11,788 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:11,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:12,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:12,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 07:00:12,191 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 07:00:12,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:12,192 INFO L85 PathProgramCache]: Analyzing trace with hash 218878957, now seen corresponding path program 1 times [2022-07-14 07:00:12,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:12,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012576680] [2022-07-14 07:00:12,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:12,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:12,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:12,193 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 07:00:12,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-14 07:00:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:12,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 07:00:12,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:12,626 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 8 treesize of output 4 [2022-07-14 07:00:12,703 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1604) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 07:00:12,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:12,763 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 15 treesize of output 17 [2022-07-14 07:00:12,818 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 16 treesize of output 8 [2022-07-14 07:00:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-07-14 07:00:12,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:12,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:12,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012576680] [2022-07-14 07:00:12,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012576680] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:12,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1721587679] [2022-07-14 07:00:12,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:12,970 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:00:12,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:00:12,971 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:00:12,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2022-07-14 07:00:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:13,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 07:00:13,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:13,659 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 8 treesize of output 4 [2022-07-14 07:00:13,685 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1672 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1672) |c_#memory_$Pointer$.base|)) (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-14 07:00:13,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:13,755 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 15 treesize of output 17 [2022-07-14 07:00:13,819 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 16 treesize of output 8 [2022-07-14 07:00:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-07-14 07:00:13,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:13,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1721587679] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:13,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:00:13,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2022-07-14 07:00:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160182757] [2022-07-14 07:00:13,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:00:13,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-14 07:00:13,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:13,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 07:00:13,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=504, Unknown=10, NotChecked=94, Total=702 [2022-07-14 07:00:13,917 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 25 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 07:00:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:14,375 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-07-14 07:00:14,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 07:00:14,376 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 52 [2022-07-14 07:00:14,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:14,376 INFO L225 Difference]: With dead ends: 86 [2022-07-14 07:00:14,376 INFO L226 Difference]: Without dead ends: 86 [2022-07-14 07:00:14,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=830, Unknown=16, NotChecked=122, Total=1122 [2022-07-14 07:00:14,378 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 22 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:14,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 501 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 158 Unchecked, 0.2s Time] [2022-07-14 07:00:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-14 07:00:14,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-14 07:00:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.25) internal successors, (85), 79 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-07-14 07:00:14,381 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 52 [2022-07-14 07:00:14,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:14,382 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-07-14 07:00:14,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 07:00:14,382 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-07-14 07:00:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 07:00:14,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:14,382 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:14,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-14 07:00:14,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2022-07-14 07:00:14,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 07:00:14,792 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 07:00:14,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash -521057353, now seen corresponding path program 1 times [2022-07-14 07:00:14,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:14,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649251012] [2022-07-14 07:00:14,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:14,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:14,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:14,794 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 07:00:14,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-14 07:00:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:15,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-14 07:00:15,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:15,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 07:00:15,416 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 7 treesize of output 3 [2022-07-14 07:00:15,426 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:15,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-07-14 07:00:15,512 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_1742 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1742) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_1743))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-14 07:00:15,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:15,598 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-14 07:00:15,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:15,635 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 07:00:15,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2022-07-14 07:00:15,843 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-14 07:00:16,185 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 07:00:16,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 33 [2022-07-14 07:00:16,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-14 07:00:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-07-14 07:00:16,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:16,531 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-14 07:00:16,532 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 19 treesize of output 18 [2022-07-14 07:00:16,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1746) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2022-07-14 07:00:17,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:17,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649251012] [2022-07-14 07:00:17,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649251012] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:17,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1499289787] [2022-07-14 07:00:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:17,079 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:00:17,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:00:17,080 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:00:17,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-07-14 07:00:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:17,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-14 07:00:17,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:18,048 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 7 treesize of output 3 [2022-07-14 07:00:18,242 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_1817))) (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-14 07:00:18,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:18,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, 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-14 07:00:18,516 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-14 07:00:18,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2022-07-14 07:00:18,991 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 17 treesize of output 9 [2022-07-14 07:00:18,997 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-07-14 07:00:18,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:19,261 INFO L356 Elim1Store]: treesize reduction 5, result has 77.3 percent of original size [2022-07-14 07:00:19,262 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 26 treesize of output 25 [2022-07-14 07:00:19,500 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:19,501 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 56 treesize of output 47 [2022-07-14 07:00:19,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1499289787] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:19,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:00:19,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21] total 45 [2022-07-14 07:00:19,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785683195] [2022-07-14 07:00:19,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:00:19,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-14 07:00:19,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:19,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-14 07:00:19,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2765, Unknown=26, NotChecked=324, Total=3306 [2022-07-14 07:00:19,875 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 46 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 41 states have internal predecessors, (84), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 07:00:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:21,444 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-07-14 07:00:21,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 07:00:21,444 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 41 states have internal predecessors, (84), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 52 [2022-07-14 07:00:21,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:21,445 INFO L225 Difference]: With dead ends: 93 [2022-07-14 07:00:21,445 INFO L226 Difference]: Without dead ends: 93 [2022-07-14 07:00:21,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=392, Invalid=4992, Unknown=30, NotChecked=438, Total=5852 [2022-07-14 07:00:21,449 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 46 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 394 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:21,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 800 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 187 Invalid, 0 Unknown, 394 Unchecked, 0.2s Time] [2022-07-14 07:00:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-14 07:00:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-07-14 07:00:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2022-07-14 07:00:21,456 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 52 [2022-07-14 07:00:21,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:21,456 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2022-07-14 07:00:21,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 41 states have internal predecessors, (84), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 07:00:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2022-07-14 07:00:21,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 07:00:21,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:21,457 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:21,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-07-14 07:00:21,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2022-07-14 07:00:21,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 07:00:21,868 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 07:00:21,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:21,869 INFO L85 PathProgramCache]: Analyzing trace with hash -521057352, now seen corresponding path program 1 times [2022-07-14 07:00:21,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:21,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862227447] [2022-07-14 07:00:21,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:21,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:21,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:21,870 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 07:00:21,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-14 07:00:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:22,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-14 07:00:22,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:22,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 07:00:22,519 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 7 treesize of output 3 [2022-07-14 07:00:22,528 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:22,529 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-07-14 07:00:22,635 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1890 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1890))) (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_1889 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_1889) |c_#memory_$Pointer$.offset|)) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-14 07:00:22,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:22,713 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-14 07:00:22,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:22,742 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 07:00:22,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2022-07-14 07:00:23,375 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 07:00:23,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 53 [2022-07-14 07:00:23,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:23,384 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 44 treesize of output 42 [2022-07-14 07:00:23,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-07-14 07:00:23,519 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 30 treesize of output 18 [2022-07-14 07:00:23,524 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 26 treesize of output 14 [2022-07-14 07:00:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-07-14 07:00:23,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:24,119 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1893 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1894 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1894) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-14 07:00:24,382 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:24,382 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 52 treesize of output 56 [2022-07-14 07:00:26,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:26,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862227447] [2022-07-14 07:00:26,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862227447] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:26,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [790364126] [2022-07-14 07:00:26,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:26,418 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:00:26,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:00:26,419 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:00:26,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-07-14 07:00:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:26,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-14 07:00:26,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:26,824 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-14 07:00:26,943 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-14 07:00:27,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:27,264 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-14 07:00:27,457 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-14 07:00:27,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:27,886 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-14 07:00:28,605 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-14 07:00:28,609 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 7 treesize of output 3 [2022-07-14 07:00:29,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:29,298 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-14 07:00:29,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:29,308 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-14 07:00:29,872 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 07:00:29,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-07-14 07:00:29,884 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 07:00:29,885 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 33 treesize of output 33 [2022-07-14 07:00:30,099 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 23 treesize of output 15 [2022-07-14 07:00:30,103 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 26 treesize of output 14 [2022-07-14 07:00:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:00:30,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:31,340 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:31,340 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 107 treesize of output 86 [2022-07-14 07:00:31,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:31,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:31,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:31,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:32,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:32,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-14 07:00:32,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-14 07:00:32,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-14 07:00:32,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:33,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:33,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:33,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 16 treesize of output 14 [2022-07-14 07:00:33,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:34,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:34,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-14 07:00:34,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-14 07:00:34,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 9 treesize of output 7 [2022-07-14 07:00:34,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:34,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:34,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:35,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:35,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:35,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:35,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-14 07:00:36,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-14 07:00:36,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-14 07:00:36,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:36,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:36,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:36,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:37,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:37,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:37,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-14 07:00:37,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-14 07:00:37,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-14 07:00:37,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 07:00:38,033 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 22 treesize of output 20 [2022-07-14 07:00:38,585 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 22 treesize of output 20 [2022-07-14 07:00:38,707 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 22 treesize of output 20 [2022-07-14 07:00:38,824 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 22 treesize of output 20 [2022-07-14 07:00:39,021 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 22 treesize of output 20 [2022-07-14 07:00:39,129 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 22 treesize of output 20 [2022-07-14 07:00:39,241 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 22 treesize of output 20 [2022-07-14 07:00:39,470 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 22 treesize of output 20 [2022-07-14 07:00:39,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-14 07:00:39,693 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 22 treesize of output 20 [2022-07-14 07:00:40,121 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 22 treesize of output 20 [2022-07-14 07:00:40,228 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 22 treesize of output 20 [2022-07-14 07:00:40,350 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 22 treesize of output 20 [2022-07-14 07:00:40,594 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 22 treesize of output 20 [2022-07-14 07:00:40,730 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 22 treesize of output 20 [2022-07-14 07:00:40,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 22 treesize of output 20 [2022-07-14 07:00:41,072 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 22 treesize of output 20 [2022-07-14 07:00:41,172 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 22 treesize of output 20 [2022-07-14 07:00:41,252 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 22 treesize of output 20 [2022-07-14 07:00:41,812 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 12 treesize of output 10 [2022-07-14 07:00:42,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-14 07:00:42,529 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 22 treesize of output 20 [2022-07-14 07:00:42,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-14 07:00:42,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-14 07:00:43,037 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 22 treesize of output 20 [2022-07-14 07:00:43,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-14 07:00:43,408 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 22 treesize of output 20 [2022-07-14 07:00:43,508 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 22 treesize of output 20 [2022-07-14 07:00:43,634 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 22 treesize of output 20 [2022-07-14 07:00:44,615 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 22 treesize of output 20 [2022-07-14 07:00:44,767 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 22 treesize of output 20 [2022-07-14 07:00:44,886 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 22 treesize of output 20 [2022-07-14 07:00:47,126 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 12 treesize of output 10 [2022-07-14 07:00:47,765 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 12 treesize of output 10 [2022-07-14 07:00:49,364 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 22 treesize of output 20 [2022-07-14 07:00:49,504 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 22 treesize of output 20 [2022-07-14 07:00:50,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [790364126] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:50,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:00:50,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 50 [2022-07-14 07:00:50,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351717363] [2022-07-14 07:00:50,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:00:50,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-14 07:00:50,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:50,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-14 07:00:50,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3464, Unknown=102, NotChecked=242, Total=4032 [2022-07-14 07:00:50,477 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 51 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 43 states have internal predecessors, (91), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:00:54,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:54,609 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-07-14 07:00:54,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-14 07:00:54,609 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 43 states have internal predecessors, (91), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2022-07-14 07:00:54,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:54,610 INFO L225 Difference]: With dead ends: 93 [2022-07-14 07:00:54,610 INFO L226 Difference]: Without dead ends: 93 [2022-07-14 07:00:54,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2081 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=496, Invalid=7209, Unknown=135, NotChecked=350, Total=8190 [2022-07-14 07:00:54,612 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 42 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 431 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:54,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1017 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 336 Invalid, 0 Unknown, 431 Unchecked, 0.4s Time] [2022-07-14 07:00:54,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-14 07:00:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-07-14 07:00:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2022-07-14 07:00:54,615 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 52 [2022-07-14 07:00:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:54,616 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2022-07-14 07:00:54,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 43 states have internal predecessors, (91), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:00:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2022-07-14 07:00:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 07:00:54,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:54,617 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:54,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:54,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2022-07-14 07:00:55,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 07:00:55,031 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 07:00:55,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1027089942, now seen corresponding path program 1 times [2022-07-14 07:00:55,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:55,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759240760] [2022-07-14 07:00:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:55,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:55,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:55,036 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 07:00:55,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-14 07:00:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:55,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-14 07:00:55,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:55,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 07:00:55,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 07:00:55,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:55,683 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2022-07-14 07:00:55,688 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 7 treesize of output 3 [2022-07-14 07:00:55,779 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2046))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_2045))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-07-14 07:00:55,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:55,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 07:00:55,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:55,885 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 07:00:55,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-07-14 07:00:56,079 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-14 07:00:56,378 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 07:00:56,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 32 [2022-07-14 07:00:56,456 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 23 treesize of output 11 [2022-07-14 07:00:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-07-14 07:00:56,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:56,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2049 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2049) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 07:00:57,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:57,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759240760] [2022-07-14 07:00:57,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759240760] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:57,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [809793340] [2022-07-14 07:00:57,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:57,190 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:00:57,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:00:57,191 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:00:57,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-07-14 07:00:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:57,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 07:00:57,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:58,280 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 7 treesize of output 3 [2022-07-14 07:00:58,474 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_2120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_2120) |c_#memory_$Pointer$.offset|)) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-14 07:00:58,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:58,624 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-14 07:00:58,962 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-14 07:00:59,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-07-14 07:00:59,286 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 16 treesize of output 8 [2022-07-14 07:00:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-07-14 07:00:59,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:59,843 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:59,843 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 66 treesize of output 61 [2022-07-14 07:01:00,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [809793340] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:00,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:01:00,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23] total 49 [2022-07-14 07:01:00,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201984229] [2022-07-14 07:01:00,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:01:00,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-14 07:01:00,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:01:00,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-14 07:01:00,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=3181, Unknown=26, NotChecked=348, Total=3782 [2022-07-14 07:01:00,261 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 49 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 44 states have internal predecessors, (90), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 07:01:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:02,276 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-07-14 07:01:02,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 07:01:02,277 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 44 states have internal predecessors, (90), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2022-07-14 07:01:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:02,277 INFO L225 Difference]: With dead ends: 93 [2022-07-14 07:01:02,277 INFO L226 Difference]: Without dead ends: 93 [2022-07-14 07:01:02,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=453, Invalid=5691, Unknown=30, NotChecked=468, Total=6642 [2022-07-14 07:01:02,279 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 07:01:02,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1132 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 377 Invalid, 0 Unknown, 295 Unchecked, 0.5s Time] [2022-07-14 07:01:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-14 07:01:02,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-07-14 07:01:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 85 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:01:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-07-14 07:01:02,281 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 53 [2022-07-14 07:01:02,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:02,281 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-07-14 07:01:02,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 44 states have internal predecessors, (90), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 07:01:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-07-14 07:01:02,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 07:01:02,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:02,282 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:01:02,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2022-07-14 07:01:02,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-14 07:01:02,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 07:01:02,686 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 07:01:02,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:02,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1947817869, now seen corresponding path program 2 times [2022-07-14 07:01:02,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:01:02,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629632480] [2022-07-14 07:01:02,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:01:02,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:01:02,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:01:02,688 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 07:01:02,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-14 07:01:02,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 07:01:02,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:01:02,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-14 07:01:02,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:03,006 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-14 07:01:03,127 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-14 07:01:03,136 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-14 07:01:03,506 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:01:03,507 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-14 07:01:03,515 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-14 07:01:03,547 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:01:03,547 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-14 07:01:03,552 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-14 07:01:03,588 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 07:01:03,588 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 21 treesize of output 28 [2022-07-14 07:01:03,803 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-14 07:01:03,808 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 27 treesize of output 26 [2022-07-14 07:01:04,334 INFO L356 Elim1Store]: treesize reduction 11, result has 66.7 percent of original size [2022-07-14 07:01:04,335 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 65 [2022-07-14 07:01:04,342 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 17 treesize of output 13 [2022-07-14 07:01:04,356 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-14 07:01:04,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2022-07-14 07:01:04,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:04,672 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-14 07:01:04,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 82 [2022-07-14 07:01:04,697 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-14 07:01:04,697 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 35 treesize of output 37 [2022-07-14 07:01:04,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:04,726 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-14 07:01:04,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2022-07-14 07:01:05,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:01:05,572 INFO L356 Elim1Store]: treesize reduction 82, result has 29.3 percent of original size [2022-07-14 07:01:05,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 109 [2022-07-14 07:01:05,606 INFO L356 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2022-07-14 07:01:05,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 40 [2022-07-14 07:01:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 07:01:05,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:06,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:01:06,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629632480] [2022-07-14 07:01:06,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629632480] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:06,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1843364779] [2022-07-14 07:01:06,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:01:06,290 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:01:06,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:01:06,291 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:01:06,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-07-14 07:01:06,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 07:01:06,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:01:06,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-14 07:01:06,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:06,796 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-14 07:01:07,036 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-14 07:01:07,043 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-14 07:01:07,439 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:01:07,440 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-14 07:01:07,446 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-14 07:01:07,473 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 07:01:07,473 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 21 treesize of output 28 [2022-07-14 07:01:07,487 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-14 07:01:07,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, 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-14 07:01:07,861 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 27 treesize of output 26 [2022-07-14 07:01:08,623 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 07:01:08,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 46 [2022-07-14 07:01:08,631 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 19 treesize of output 15 [2022-07-14 07:01:08,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:08,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2022-07-14 07:01:08,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:08,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:08,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:08,850 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-14 07:01:08,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2022-07-14 07:01:08,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:08,890 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-14 07:01:08,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 84 [2022-07-14 07:01:08,916 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-14 07:01:08,916 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 37 treesize of output 39 [2022-07-14 07:01:11,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:01:11,465 INFO L356 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-07-14 07:01:11,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 82 [2022-07-14 07:01:11,501 INFO L356 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2022-07-14 07:01:11,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 29 [2022-07-14 07:01:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 07:01:11,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:11,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1843364779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:11,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:01:11,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 45 [2022-07-14 07:01:11,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151152075] [2022-07-14 07:01:11,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:01:11,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-14 07:01:11,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:01:11,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-14 07:01:11,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2368, Unknown=6, NotChecked=0, Total=2550 [2022-07-14 07:01:11,857 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 45 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 39 states have internal predecessors, (71), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:01:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:12,528 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2022-07-14 07:01:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 07:01:12,530 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 39 states have internal predecessors, (71), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-07-14 07:01:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:12,530 INFO L225 Difference]: With dead ends: 128 [2022-07-14 07:01:12,531 INFO L226 Difference]: Without dead ends: 128 [2022-07-14 07:01:12,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 78 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=211, Invalid=2858, Unknown=11, NotChecked=0, Total=3080 [2022-07-14 07:01:12,532 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 11 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 391 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 07:01:12,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1032 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 391 Unchecked, 0.3s Time] [2022-07-14 07:01:12,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-14 07:01:12,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2022-07-14 07:01:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.1826923076923077) internal successors, (123), 115 states have internal predecessors, (123), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-14 07:01:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2022-07-14 07:01:12,537 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 53 [2022-07-14 07:01:12,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:12,537 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2022-07-14 07:01:12,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 39 states have internal predecessors, (71), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:01:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2022-07-14 07:01:12,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 07:01:12,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:12,538 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:01:12,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-07-14 07:01:12,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2022-07-14 07:01:12,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 07:01:12,948 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 07:01:12,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:12,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1775059065, now seen corresponding path program 1 times [2022-07-14 07:01:12,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:01:12,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143434566] [2022-07-14 07:01:12,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:12,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:01:12,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:01:12,950 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 07:01:12,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-07-14 07:01:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:13,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 07:01:13,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:13,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 07:01:13,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-14 07:01:13,707 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 7 treesize of output 3 [2022-07-14 07:01:13,718 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:13,718 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-07-14 07:01:13,830 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2357) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_2358) |c_#memory_$Pointer$.offset|)) (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-14 07:01:13,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:13,944 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 07:01:13,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2022-07-14 07:01:13,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:13,960 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-14 07:01:14,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:01:14,437 INFO L356 Elim1Store]: treesize reduction 17, result has 56.4 percent of original size [2022-07-14 07:01:14,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 44 [2022-07-14 07:01:14,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:14,671 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-14 07:01:14,734 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-14 07:01:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-07-14 07:01:14,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:14,955 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 22 treesize of output 18 [2022-07-14 07:01:15,334 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2361 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2361) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2361 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2361) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-14 07:01:17,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:01:17,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143434566] [2022-07-14 07:01:17,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143434566] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:17,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [832173641] [2022-07-14 07:01:17,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:17,000 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:01:17,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:01:17,002 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:01:17,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-07-14 07:01:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:17,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-14 07:01:17,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:17,433 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-14 07:01:17,554 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-14 07:01:17,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:17,771 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-14 07:01:17,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 5 treesize of output 3 [2022-07-14 07:01:18,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:18,258 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-14 07:01:18,898 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 7 treesize of output 3 [2022-07-14 07:01:18,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 07:01:19,184 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_2436))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((v_ArrVal_2435 (_ BitVec 32))) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| v_ArrVal_2435) |c_#length|))) is different from true [2022-07-14 07:01:19,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:19,372 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-14 07:01:19,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:19,384 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-14 07:01:19,572 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 7 treesize of output 3 [2022-07-14 07:01:19,883 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 07:01:19,883 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 25 treesize of output 25 [2022-07-14 07:01:20,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-14 07:01:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 07:01:20,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:22,429 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 63 treesize of output 47 [2022-07-14 07:01:23,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [832173641] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:23,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:01:23,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24] total 52 [2022-07-14 07:01:23,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693436870] [2022-07-14 07:01:23,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:01:23,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-14 07:01:23,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:01:23,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-14 07:01:23,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=4069, Unknown=81, NotChecked=396, Total=4830 [2022-07-14 07:01:23,665 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand has 53 states, 50 states have (on average 1.9) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:01:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:27,580 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2022-07-14 07:01:27,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-14 07:01:27,580 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.9) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2022-07-14 07:01:27,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:27,581 INFO L225 Difference]: With dead ends: 130 [2022-07-14 07:01:27,581 INFO L226 Difference]: Without dead ends: 130 [2022-07-14 07:01:27,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2419 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=549, Invalid=7546, Unknown=107, NotChecked=540, Total=8742 [2022-07-14 07:01:27,582 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 67 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 07:01:27,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 702 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 232 Invalid, 0 Unknown, 383 Unchecked, 0.3s Time] [2022-07-14 07:01:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-14 07:01:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2022-07-14 07:01:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.179245283018868) internal successors, (125), 117 states have internal predecessors, (125), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-14 07:01:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2022-07-14 07:01:27,585 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 54 [2022-07-14 07:01:27,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:27,585 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2022-07-14 07:01:27,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.9) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:01:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2022-07-14 07:01:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 07:01:27,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:27,586 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:01:27,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-07-14 07:01:27,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-07-14 07:01:27,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 07:01:27,992 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 07:01:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash 729745886, now seen corresponding path program 1 times [2022-07-14 07:01:27,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:01:27,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001653812] [2022-07-14 07:01:27,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:27,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:01:27,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:01:27,993 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 07:01:27,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-07-14 07:01:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:28,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-14 07:01:28,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:28,420 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-14 07:01:28,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 07:01:28,764 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:28,765 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2022-07-14 07:01:28,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-14 07:01:28,776 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 7 treesize of output 3 [2022-07-14 07:01:29,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:29,006 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-14 07:01:29,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:29,029 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 07:01:29,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-07-14 07:01:29,048 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 07:01:29,048 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 19 treesize of output 19 [2022-07-14 07:01:29,156 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-14 07:01:29,307 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:29,308 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2022-07-14 07:01:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 07:01:29,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:29,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:01:29,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001653812] [2022-07-14 07:01:29,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001653812] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:29,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [642802985] [2022-07-14 07:01:29,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:29,670 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:01:29,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:01:29,671 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:01:29,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2022-07-14 07:01:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:30,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-14 07:01:30,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:30,217 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-14 07:01:30,320 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-14 07:01:30,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:30,744 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-14 07:01:31,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-14 07:01:31,220 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 7 treesize of output 3 [2022-07-14 07:01:31,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-14 07:01:31,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 07:01:31,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:31,667 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 37 treesize of output 35 [2022-07-14 07:01:31,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:31,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 07:01:31,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:31,696 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-14 07:01:31,722 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 07:01:31,722 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 19 treesize of output 19 [2022-07-14 07:01:32,413 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 07:01:32,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2022-07-14 07:01:32,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:32,423 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 37 treesize of output 32 [2022-07-14 07:01:32,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:32,434 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 18 treesize of output 20 [2022-07-14 07:01:32,597 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 34 treesize of output 18 [2022-07-14 07:01:32,601 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-14 07:01:32,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 07:01:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 07:01:32,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:33,271 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2597 (_ BitVec 32))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|) v_ArrVal_2597)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2599) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-14 07:01:33,307 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2597 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~mem9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|) v_ArrVal_2597)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem9#1.base| v_ArrVal_2599) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-14 07:01:33,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2597 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 32)) v_ArrVal_2597)) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2596) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2599) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-14 07:01:34,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [642802985] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:34,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:01:34,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 45 [2022-07-14 07:01:34,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666058421] [2022-07-14 07:01:34,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:01:34,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-14 07:01:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:01:34,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-14 07:01:34,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2650, Unknown=39, NotChecked=318, Total=3192 [2022-07-14 07:01:34,305 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand has 45 states, 43 states have (on average 2.255813953488372) internal successors, (97), 40 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 07:01:37,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:37,762 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-07-14 07:01:37,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 07:01:37,763 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 2.255813953488372) internal successors, (97), 40 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 56 [2022-07-14 07:01:37,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:37,763 INFO L225 Difference]: With dead ends: 120 [2022-07-14 07:01:37,764 INFO L226 Difference]: Without dead ends: 120 [2022-07-14 07:01:37,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1453 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=402, Invalid=5102, Unknown=58, NotChecked=444, Total=6006 [2022-07-14 07:01:37,765 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 41 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 07:01:37,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 703 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 425 Invalid, 0 Unknown, 302 Unchecked, 0.7s Time] [2022-07-14 07:01:37,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-14 07:01:37,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-14 07:01:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.1734693877551021) internal successors, (115), 109 states have internal predecessors, (115), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-14 07:01:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2022-07-14 07:01:37,768 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 56 [2022-07-14 07:01:37,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:37,769 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2022-07-14 07:01:37,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 2.255813953488372) internal successors, (97), 40 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 07:01:37,769 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2022-07-14 07:01:37,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 07:01:37,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:37,769 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-14 07:01:37,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (43)] Ended with exit code 0 [2022-07-14 07:01:37,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-07-14 07:01:38,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 07:01:38,174 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 07:01:38,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:38,174 INFO L85 PathProgramCache]: Analyzing trace with hash 294390785, now seen corresponding path program 1 times [2022-07-14 07:01:38,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:01:38,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92859444] [2022-07-14 07:01:38,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:38,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:01:38,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:01:38,176 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 07:01:38,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-07-14 07:01:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:38,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 81 conjunts are in the unsatisfiable core [2022-07-14 07:01:38,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:38,484 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-14 07:01:38,491 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-14 07:01:38,520 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-14 07:01:38,524 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-14 07:01:38,643 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 07:01:38,643 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-14 07:01:38,650 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-14 07:01:38,798 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-14 07:01:38,963 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:01:38,964 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 07:01:39,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 07:01:39,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 07:01:39,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:39,529 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 28 [2022-07-14 07:01:39,535 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:39,536 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 27 [2022-07-14 07:01:39,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-07-14 07:01:39,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:39,950 INFO L356 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-07-14 07:01:39,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 38 [2022-07-14 07:01:39,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:40,004 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 07:01:40,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 61 [2022-07-14 07:01:40,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:40,018 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 20 treesize of output 22 [2022-07-14 07:01:40,136 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 6 treesize of output 4 [2022-07-14 07:01:42,270 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-07-14 07:01:42,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 39 [2022-07-14 07:01:43,861 INFO L356 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-07-14 07:01:43,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 111 treesize of output 106 [2022-07-14 07:01:43,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:43,892 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:43,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-14 07:01:44,074 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:44,076 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 53 treesize of output 57 [2022-07-14 07:01:44,401 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:44,402 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 37 [2022-07-14 07:01:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:01:44,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:46,061 INFO L356 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2022-07-14 07:01:46,061 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 28 treesize of output 27 [2022-07-14 07:01:47,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:01:47,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92859444] [2022-07-14 07:01:47,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92859444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:47,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [401818229] [2022-07-14 07:01:47,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:47,491 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:01:47,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:01:47,492 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:01:47,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-07-14 07:01:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:47,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-14 07:01:47,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:47,938 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-14 07:01:48,062 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-14 07:01:48,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:48,251 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-14 07:01:48,419 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-14 07:01:48,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:48,870 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-14 07:01:49,208 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-14 07:01:49,216 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-14 07:01:49,563 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:01:49,563 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 18 [2022-07-14 07:01:51,047 INFO L356 Elim1Store]: treesize reduction 64, result has 31.2 percent of original size [2022-07-14 07:01:51,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 56 [2022-07-14 07:01:51,068 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:51,068 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 17 [2022-07-14 07:01:54,854 INFO L356 Elim1Store]: treesize reduction 210, result has 41.5 percent of original size [2022-07-14 07:01:54,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 179 treesize of output 241 [2022-07-14 07:02:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 07:02:42,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:02:54,576 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:54,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 87 [2022-07-14 07:02:59,856 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 07:02:59,856 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 36 treesize of output 35 [2022-07-14 07:03:00,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [401818229] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:03:00,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:03:00,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 21] total 51 [2022-07-14 07:03:00,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245191556] [2022-07-14 07:03:00,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:03:00,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-14 07:03:00,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:03:00,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-14 07:03:00,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=4733, Unknown=22, NotChecked=0, Total=4970 [2022-07-14 07:03:00,329 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 52 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 44 states have internal predecessors, (96), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:03:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:09,918 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2022-07-14 07:03:09,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-14 07:03:09,918 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 44 states have internal predecessors, (96), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 56 [2022-07-14 07:03:09,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:09,919 INFO L225 Difference]: With dead ends: 127 [2022-07-14 07:03:09,919 INFO L226 Difference]: Without dead ends: 127 [2022-07-14 07:03:09,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=491, Invalid=9577, Unknown=32, NotChecked=0, Total=10100 [2022-07-14 07:03:09,920 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 27 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 710 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:09,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1080 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 360 Invalid, 0 Unknown, 710 Unchecked, 0.6s Time] [2022-07-14 07:03:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-14 07:03:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-14 07:03:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.1904761904761905) internal successors, (125), 116 states have internal predecessors, (125), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-14 07:03:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2022-07-14 07:03:09,922 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 56 [2022-07-14 07:03:09,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:09,923 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2022-07-14 07:03:09,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 44 states have internal predecessors, (96), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:03:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2022-07-14 07:03:09,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 07:03:09,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:09,923 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-14 07:03:09,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (45)] Ended with exit code 0 [2022-07-14 07:03:10,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Ended with exit code 0 [2022-07-14 07:03:10,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 07:03:10,329 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-14 07:03:10,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:10,329 INFO L85 PathProgramCache]: Analyzing trace with hash 294390786, now seen corresponding path program 1 times [2022-07-14 07:03:10,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:03:10,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918582615] [2022-07-14 07:03:10,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:10,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:03:10,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:03:10,330 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 07:03:10,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-07-14 07:03:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:10,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-14 07:03:10,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:03:10,651 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-14 07:03:10,673 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-14 07:03:10,701 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-14 07:03:10,704 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-14 07:03:10,863 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 07:03:10,863 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 18 treesize of output 25 [2022-07-14 07:03:10,879 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-14 07:03:11,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 07:03:11,034 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 9 [2022-07-14 07:03:11,175 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:03:11,175 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 07:03:11,204 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 07:03:11,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2022-07-14 07:03:11,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-14 07:03:11,738 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 7 treesize of output 3 [2022-07-14 07:03:11,743 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:03:11,744 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 20 [2022-07-14 07:03:11,747 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-14 07:03:11,895 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_2839 (_ BitVec 32))) (= (store |c_old(#length)| |c_node_create_~temp~0#1.base| v_ArrVal_2839) |c_#length|)) (exists ((v_ArrVal_2840 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_2840) |c_#memory_$Pointer$.offset|)) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2841)))) is different from true [2022-07-14 07:03:12,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:12,031 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-14 07:03:12,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:12,067 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 07:03:12,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 51 [2022-07-14 07:03:12,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:12,083 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 12 treesize of output 14 [2022-07-14 07:03:12,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-14 07:03:13,797 INFO L356 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-07-14 07:03:13,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 149 treesize of output 128 [2022-07-14 07:03:13,840 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 07:03:13,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 102 [2022-07-14 07:03:13,934 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-14 07:03:13,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:03:13,971 INFO L356 Elim1Store]: treesize reduction 8, result has 50.0 percent of original size [2022-07-14 07:03:13,972 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 51 [2022-07-14 07:03:14,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:14,908 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:03:14,908 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 62 [2022-07-14 07:03:14,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2022-07-14 07:03:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-07-14 07:03:16,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:03:16,712 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|))) (or (not (bvule .cse0 (select |c_#length| |c_ULTIMATE.start_sll_append_~last~0#1.base|))) (and (forall ((v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))) (forall ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2844) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (bvule (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|) .cse0)))) is different from false [2022-07-14 07:03:16,745 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|))) (or (not (bvule .cse0 (select |c_#length| |c_ULTIMATE.start_sll_append_~last~0#1.base|))) (not (= |c_ULTIMATE.start_sll_append_#t~mem11#1.base| (_ bv0 32))) (and (forall ((v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))) (forall ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2844) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (bvule (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|) .cse0)))) is different from false [2022-07-14 07:03:16,777 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_sll_append_~last~0#1.offset| (_ BitVec 32))) (let ((.cse0 (bvadd |ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))) (.cse1 (bvadd |ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv8 32)))) (or (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0) (_ bv0 32))) (not (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_sll_append_~last~0#1.base|))) (not (bvule .cse0 .cse1))))) (and (forall ((v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32))))) (forall ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2844) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-14 07:03:16,812 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2844) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) (forall ((|ULTIMATE.start_sll_append_~last~0#1.offset| (_ BitVec 32))) (let ((.cse1 (bvadd |ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv4 32))) (.cse2 (bvadd |ULTIMATE.start_sll_append_~last~0#1.offset| (_ bv8 32)))) (or (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) .cse1) (_ bv0 32))) (not (bvule .cse2 (select |c_#length| |c_ULTIMATE.start_sll_append_#t~mem10#1.base|))) (not (bvule .cse1 .cse2)))))) is different from false [2022-07-14 07:03:16,849 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)) v_ArrVal_2845) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2845) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2844) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_48| (_ BitVec 32))) (let ((.cse3 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_48| (_ bv4 32))) (.cse4 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_48| (_ bv8 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)))) (or (not (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) (_ bv0 32))) (not (bvule .cse3 .cse4)) (not (bvule .cse4 (select |c_#length| .cse2))))))) is different from false [2022-07-14 07:03:16,910 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)) v_ArrVal_2845) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2845) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2844) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (bvule (bvadd (_ bv8 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (select |c_#length| |c_ULTIMATE.start_sll_append_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_48| (_ BitVec 32))) (let ((.cse3 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_48| (_ bv4 32))) (.cse4 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_48| (_ bv8 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)))) (or (not (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) (_ bv0 32))) (not (bvule .cse3 .cse4)) (not (bvule .cse4 (select |c_#length| .cse2))))))) is different from false [2022-07-14 07:03:16,952 WARN L833 $PredicateComparison]: unable to prove that (or (not (bvule (bvadd (_ bv8 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|) (select |c_#length| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|))) (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_48| (_ BitVec 32))) (let ((.cse0 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_48| (_ bv8 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|))) (.cse2 (bvadd |v_ULTIMATE.start_sll_append_~last~0#1.offset_48| (_ bv4 32)))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (not (bvule .cse2 .cse0)) (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| .cse1) .cse2)))))) (and (forall ((v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|)) v_ArrVal_2845) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))) (forall ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_append_#t~mem9#1.offset|)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2845) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2844) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-14 07:03:19,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:03:19,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918582615] [2022-07-14 07:03:19,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918582615] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:03:19,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1940251997] [2022-07-14 07:03:19,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:19,289 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:03:19,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:03:19,290 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:03:19,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (47)] Waiting until timeout for monitored process