./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --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/verifythis/elimination_max_rec_onepoint.c -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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:13:29,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:13:29,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:13:29,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:13:29,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:13:29,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:13:29,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:13:29,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:13:29,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:13:29,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:13:29,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:13:29,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:13:29,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:13:29,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:13:29,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:13:29,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:13:29,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:13:29,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:13:29,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:13:29,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:13:29,779 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:13:29,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:13:29,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:13:29,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:13:29,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:13:29,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:13:29,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:13:29,789 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:13:29,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:13:29,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:13:29,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:13:29,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:13:29,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:13:29,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:13:29,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:13:29,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:13:29,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:13:29,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:13:29,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:13:29,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:13:29,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:13:29,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:13:29,799 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:13:29,830 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:13:29,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:13:29,831 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:13:29,831 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:13:29,832 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:13:29,832 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:13:29,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:13:29,833 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:13:29,833 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:13:29,834 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:13:29,834 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:13:29,834 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:13:29,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:13:29,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:13:29,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:13:29,834 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:13:29,835 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:13:29,835 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:13:29,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:13:29,835 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:13:29,835 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:13:29,835 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:13:29,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:13:29,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:13:29,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:13:29,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:13:29,836 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:13:29,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:13:29,849 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:13:29,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:13:29,850 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2022-07-14 06:13:30,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:13:30,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:13:30,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:13:30,058 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:13:30,059 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:13:30,060 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2022-07-14 06:13:30,114 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958dcb596/6faa79339bb8418dbfd9d897ab164cad/FLAG2742da43e [2022-07-14 06:13:30,512 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:13:30,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2022-07-14 06:13:30,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958dcb596/6faa79339bb8418dbfd9d897ab164cad/FLAG2742da43e [2022-07-14 06:13:30,532 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958dcb596/6faa79339bb8418dbfd9d897ab164cad [2022-07-14 06:13:30,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:13:30,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:13:30,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:13:30,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:13:30,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:13:30,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:13:30" (1/1) ... [2022-07-14 06:13:30,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c4c9fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:13:30, skipping insertion in model container [2022-07-14 06:13:30,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:13:30" (1/1) ... [2022-07-14 06:13:30,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:13:30,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:13:30,677 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2022-07-14 06:13:30,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:13:30,716 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:13:30,725 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2022-07-14 06:13:30,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:13:30,758 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:13:30,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:13:30 WrapperNode [2022-07-14 06:13:30,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:13:30,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:13:30,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:13:30,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:13:30,766 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:13:30" (1/1) ... [2022-07-14 06:13:30,778 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:13:30" (1/1) ... [2022-07-14 06:13:30,794 INFO L137 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2022-07-14 06:13:30,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:13:30,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:13:30,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:13:30,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:13:30,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:13:30" (1/1) ... [2022-07-14 06:13:30,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:13:30" (1/1) ... [2022-07-14 06:13:30,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:13:30" (1/1) ... [2022-07-14 06:13:30,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:13:30" (1/1) ... [2022-07-14 06:13:30,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:13:30" (1/1) ... [2022-07-14 06:13:30,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:13:30" (1/1) ... [2022-07-14 06:13:30,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:13:30" (1/1) ... [2022-07-14 06:13:30,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:13:30,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:13:30,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:13:30,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:13:30,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:13:30" (1/1) ... [2022-07-14 06:13:30,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:13:30,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:13:30,857 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:13:30,859 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:13:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:13:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 06:13:30,891 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 06:13:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:13:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-07-14 06:13:30,892 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-07-14 06:13:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:13:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:13:30,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:13:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 06:13:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-14 06:13:30,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-14 06:13:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:13:30,949 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:13:30,950 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:13:31,180 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:13:31,184 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:13:31,184 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 06:13:31,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:13:31 BoogieIcfgContainer [2022-07-14 06:13:31,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:13:31,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:13:31,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:13:31,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:13:31,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:13:30" (1/3) ... [2022-07-14 06:13:31,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135d82f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:13:31, skipping insertion in model container [2022-07-14 06:13:31,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:13:30" (2/3) ... [2022-07-14 06:13:31,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135d82f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:13:31, skipping insertion in model container [2022-07-14 06:13:31,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:13:31" (3/3) ... [2022-07-14 06:13:31,192 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2022-07-14 06:13:31,202 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:13:31,202 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-07-14 06:13:31,241 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:13:31,245 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@d5d0280, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6684e94f [2022-07-14 06:13:31,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-07-14 06:13:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 35 states have (on average 1.6) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:13:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:13:31,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:31,255 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:31,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:31,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:31,261 INFO L85 PathProgramCache]: Analyzing trace with hash -724999257, now seen corresponding path program 1 times [2022-07-14 06:13:31,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:31,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291668194] [2022-07-14 06:13:31,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:31,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:31,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:31,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:13:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:31,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291668194] [2022-07-14 06:13:31,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291668194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:13:31,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:13:31,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:13:31,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145473152] [2022-07-14 06:13:31,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:13:31,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 06:13:31,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:31,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 06:13:31,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:13:31,444 INFO L87 Difference]: Start difference. First operand has 64 states, 35 states have (on average 1.6) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:13:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:31,462 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-07-14 06:13:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 06:13:31,465 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-07-14 06:13:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:31,470 INFO L225 Difference]: With dead ends: 64 [2022-07-14 06:13:31,471 INFO L226 Difference]: Without dead ends: 62 [2022-07-14 06:13:31,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:13:31,475 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:31,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:13:31,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-14 06:13:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-14 06:13:31,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:13:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-07-14 06:13:31,513 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 22 [2022-07-14 06:13:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:31,513 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-07-14 06:13:31,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:13:31,514 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-07-14 06:13:31,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:13:31,515 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:31,515 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:31,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:13:31,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:31,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:31,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1833988771, now seen corresponding path program 1 times [2022-07-14 06:13:31,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:31,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361684479] [2022-07-14 06:13:31,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:31,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:31,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:13:31,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:31,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361684479] [2022-07-14 06:13:31,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361684479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:13:31,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:13:31,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:13:31,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943054047] [2022-07-14 06:13:31,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:13:31,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:13:31,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:31,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:13:31,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:13:31,703 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:13:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:31,835 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-07-14 06:13:31,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:13:31,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-14 06:13:31,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:31,838 INFO L225 Difference]: With dead ends: 106 [2022-07-14 06:13:31,838 INFO L226 Difference]: Without dead ends: 106 [2022-07-14 06:13:31,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:13:31,839 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 47 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:31,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 318 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:13:31,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-14 06:13:31,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 85. [2022-07-14 06:13:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.56) internal successors, (78), 67 states have internal predecessors, (78), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 06:13:31,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2022-07-14 06:13:31,853 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 22 [2022-07-14 06:13:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:31,854 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2022-07-14 06:13:31,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:13:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2022-07-14 06:13:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:13:31,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:31,857 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:31,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:13:31,857 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:31,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:31,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1832511589, now seen corresponding path program 1 times [2022-07-14 06:13:31,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:31,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498163147] [2022-07-14 06:13:31,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:31,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:31,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:31,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:31,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 06:13:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:13:31,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:31,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498163147] [2022-07-14 06:13:31,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498163147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:13:31,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:13:31,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:13:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089343774] [2022-07-14 06:13:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:13:31,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:13:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:31,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:13:31,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:13:31,910 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:13:31,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:31,947 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-07-14 06:13:31,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:13:31,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-07-14 06:13:31,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:31,953 INFO L225 Difference]: With dead ends: 82 [2022-07-14 06:13:31,955 INFO L226 Difference]: Without dead ends: 82 [2022-07-14 06:13:31,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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:13:31,957 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 22 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:31,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 129 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:13:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-14 06:13:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-14 06:13:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.5) internal successors, (75), 64 states have internal predecessors, (75), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 06:13:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-07-14 06:13:31,967 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 22 [2022-07-14 06:13:31,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:31,967 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-07-14 06:13:31,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:13:31,967 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-07-14 06:13:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:13:31,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:31,968 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:31,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:13:31,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:31,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:31,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1832511590, now seen corresponding path program 1 times [2022-07-14 06:13:31,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:31,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089436259] [2022-07-14 06:13:31,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:31,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 06:13:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:13:32,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:32,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089436259] [2022-07-14 06:13:32,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089436259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:13:32,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:13:32,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:13:32,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653536087] [2022-07-14 06:13:32,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:13:32,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:13:32,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:32,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:13:32,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:13:32,078 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:13:32,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:32,201 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-07-14 06:13:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:13:32,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-07-14 06:13:32,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:32,204 INFO L225 Difference]: With dead ends: 80 [2022-07-14 06:13:32,204 INFO L226 Difference]: Without dead ends: 80 [2022-07-14 06:13:32,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:13:32,209 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:32,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 237 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:13:32,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-14 06:13:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-14 06:13:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.46) internal successors, (73), 62 states have internal predecessors, (73), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 06:13:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-07-14 06:13:32,228 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 22 [2022-07-14 06:13:32,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:32,229 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-07-14 06:13:32,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:13:32,229 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-07-14 06:13:32,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:13:32,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:32,230 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:32,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:13:32,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:32,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:32,231 INFO L85 PathProgramCache]: Analyzing trace with hash 107045159, now seen corresponding path program 1 times [2022-07-14 06:13:32,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:32,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293855785] [2022-07-14 06:13:32,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:32,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 06:13:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:13:32,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:32,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293855785] [2022-07-14 06:13:32,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293855785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:13:32,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:13:32,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:13:32,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829617121] [2022-07-14 06:13:32,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:13:32,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:13:32,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:32,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:13:32,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:13:32,334 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:13:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:32,465 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2022-07-14 06:13:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:13:32,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-07-14 06:13:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:32,466 INFO L225 Difference]: With dead ends: 119 [2022-07-14 06:13:32,466 INFO L226 Difference]: Without dead ends: 119 [2022-07-14 06:13:32,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:13:32,468 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 79 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:32,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 257 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:13:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-14 06:13:32,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2022-07-14 06:13:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 67 states have internal predecessors, (78), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-14 06:13:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2022-07-14 06:13:32,491 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 24 [2022-07-14 06:13:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:32,491 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2022-07-14 06:13:32,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:13:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2022-07-14 06:13:32,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:13:32,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:32,493 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:32,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:13:32,493 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:32,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1801661154, now seen corresponding path program 1 times [2022-07-14 06:13:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:32,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544248782] [2022-07-14 06:13:32,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:32,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 06:13:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:13:32,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:32,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544248782] [2022-07-14 06:13:32,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544248782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:13:32,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:13:32,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:13:32,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454421985] [2022-07-14 06:13:32,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:13:32,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:13:32,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:32,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:13:32,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:13:32,646 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:13:32,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:32,808 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2022-07-14 06:13:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:13:32,808 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-07-14 06:13:32,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:32,809 INFO L225 Difference]: With dead ends: 90 [2022-07-14 06:13:32,809 INFO L226 Difference]: Without dead ends: 90 [2022-07-14 06:13:32,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:13:32,810 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 43 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:32,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 412 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:13:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-14 06:13:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-14 06:13:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.396551724137931) internal successors, (81), 70 states have internal predecessors, (81), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-14 06:13:32,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2022-07-14 06:13:32,820 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 29 [2022-07-14 06:13:32,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:32,821 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2022-07-14 06:13:32,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:13:32,822 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-07-14 06:13:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:13:32,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:32,823 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:32,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:13:32,824 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:32,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:32,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1023324068, now seen corresponding path program 1 times [2022-07-14 06:13:32,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:32,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032158223] [2022-07-14 06:13:32,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:32,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 06:13:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 06:13:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:13:32,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:32,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032158223] [2022-07-14 06:13:32,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032158223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:13:32,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:13:32,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:13:32,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131752392] [2022-07-14 06:13:32,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:13:32,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:13:32,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:32,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:13:32,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:13:32,938 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:13:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:33,116 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2022-07-14 06:13:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:13:33,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-07-14 06:13:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:33,117 INFO L225 Difference]: With dead ends: 110 [2022-07-14 06:13:33,118 INFO L226 Difference]: Without dead ends: 110 [2022-07-14 06:13:33,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:13:33,118 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 79 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:33,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 197 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:13:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-14 06:13:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 90. [2022-07-14 06:13:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 70 states have internal predecessors, (80), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-14 06:13:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-07-14 06:13:33,123 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 30 [2022-07-14 06:13:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:33,123 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-07-14 06:13:33,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:13:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-07-14 06:13:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:13:33,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:33,124 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:33,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:13:33,124 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:33,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1023324067, now seen corresponding path program 1 times [2022-07-14 06:13:33,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:33,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168354820] [2022-07-14 06:13:33,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:33,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 06:13:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 06:13:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:13:33,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:33,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168354820] [2022-07-14 06:13:33,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168354820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:13:33,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:13:33,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:13:33,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873350328] [2022-07-14 06:13:33,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:13:33,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:13:33,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:33,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:13:33,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:13:33,178 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:13:33,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:33,242 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2022-07-14 06:13:33,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:13:33,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-07-14 06:13:33,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:33,243 INFO L225 Difference]: With dead ends: 86 [2022-07-14 06:13:33,243 INFO L226 Difference]: Without dead ends: 86 [2022-07-14 06:13:33,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:13:33,244 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 54 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:33,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 121 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:13:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-14 06:13:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-14 06:13:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 66 states have internal predecessors, (72), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-14 06:13:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2022-07-14 06:13:33,250 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 30 [2022-07-14 06:13:33,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:33,251 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2022-07-14 06:13:33,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:13:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2022-07-14 06:13:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 06:13:33,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:33,252 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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 06:13:33,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:13:33,252 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:33,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:33,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1658275025, now seen corresponding path program 1 times [2022-07-14 06:13:33,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:33,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516250711] [2022-07-14 06:13:33,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:33,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 06:13:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 06:13:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:13:33,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:33,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516250711] [2022-07-14 06:13:33,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516250711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:13:33,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:13:33,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:13:33,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137353181] [2022-07-14 06:13:33,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:13:33,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:13:33,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:33,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:13:33,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:13:33,374 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:13:33,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:33,552 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-07-14 06:13:33,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:13:33,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-07-14 06:13:33,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:33,554 INFO L225 Difference]: With dead ends: 99 [2022-07-14 06:13:33,554 INFO L226 Difference]: Without dead ends: 99 [2022-07-14 06:13:33,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:13:33,555 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 74 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:33,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 188 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:13:33,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-14 06:13:33,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2022-07-14 06:13:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 66 states have internal predecessors, (71), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-14 06:13:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2022-07-14 06:13:33,562 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 31 [2022-07-14 06:13:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:33,562 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2022-07-14 06:13:33,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:13:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2022-07-14 06:13:33,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:13:33,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:33,563 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:33,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:13:33,564 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:33,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:33,564 INFO L85 PathProgramCache]: Analyzing trace with hash 922787578, now seen corresponding path program 1 times [2022-07-14 06:13:33,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:33,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527535996] [2022-07-14 06:13:33,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:33,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 06:13:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 06:13:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:13:33,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:33,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527535996] [2022-07-14 06:13:33,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527535996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:13:33,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:13:33,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:13:33,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195281235] [2022-07-14 06:13:33,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:13:33,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:13:33,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:33,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:13:33,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:13:33,601 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:13:33,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:33,639 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-07-14 06:13:33,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:13:33,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-07-14 06:13:33,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:33,641 INFO L225 Difference]: With dead ends: 85 [2022-07-14 06:13:33,641 INFO L226 Difference]: Without dead ends: 85 [2022-07-14 06:13:33,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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:13:33,641 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 15 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:33,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 132 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:13:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-14 06:13:33,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-07-14 06:13:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.206896551724138) internal successors, (70), 65 states have internal predecessors, (70), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-14 06:13:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2022-07-14 06:13:33,647 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 32 [2022-07-14 06:13:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:33,647 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2022-07-14 06:13:33,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:13:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2022-07-14 06:13:33,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 06:13:33,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:33,648 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:33,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 06:13:33,649 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:33,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:33,649 INFO L85 PathProgramCache]: Analyzing trace with hash 2035601245, now seen corresponding path program 1 times [2022-07-14 06:13:33,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:33,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433454961] [2022-07-14 06:13:33,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:33,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 06:13:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 06:13:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:13:33,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:33,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433454961] [2022-07-14 06:13:33,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433454961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:13:33,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:13:33,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:13:33,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545098747] [2022-07-14 06:13:33,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:13:33,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:13:33,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:33,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:13:33,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:13:33,704 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:13:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:33,747 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-07-14 06:13:33,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:13:33,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-07-14 06:13:33,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:33,748 INFO L225 Difference]: With dead ends: 84 [2022-07-14 06:13:33,749 INFO L226 Difference]: Without dead ends: 70 [2022-07-14 06:13:33,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:13:33,749 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:33,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 149 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:13:33,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-14 06:13:33,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-14 06:13:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 53 states have internal predecessors, (57), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-07-14 06:13:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2022-07-14 06:13:33,753 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 34 [2022-07-14 06:13:33,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:33,753 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2022-07-14 06:13:33,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:13:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-07-14 06:13:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 06:13:33,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:33,755 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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 06:13:33,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 06:13:33,755 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:33,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:33,756 INFO L85 PathProgramCache]: Analyzing trace with hash 287149833, now seen corresponding path program 1 times [2022-07-14 06:13:33,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:33,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253011284] [2022-07-14 06:13:33,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:33,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 06:13:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 06:13:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:13:33,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:33,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253011284] [2022-07-14 06:13:33,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253011284] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:13:33,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570647945] [2022-07-14 06:13:33,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:33,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:13:33,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:13:33,822 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:13:33,823 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:13:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:33,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 06:13:33,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:13:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:13:34,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:13:34,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570647945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:13:34,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:13:34,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2022-07-14 06:13:34,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378559471] [2022-07-14 06:13:34,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:13:34,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:13:34,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:34,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:13:34,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:13:34,015 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:13:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:34,161 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2022-07-14 06:13:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:13:34,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-07-14 06:13:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:34,162 INFO L225 Difference]: With dead ends: 87 [2022-07-14 06:13:34,162 INFO L226 Difference]: Without dead ends: 87 [2022-07-14 06:13:34,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:13:34,163 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 81 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:34,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 222 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:13:34,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-14 06:13:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2022-07-14 06:13:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 56 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-07-14 06:13:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-07-14 06:13:34,167 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 39 [2022-07-14 06:13:34,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:34,167 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-07-14 06:13:34,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:13:34,168 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-07-14 06:13:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 06:13:34,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:34,168 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:34,210 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:13:34,380 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,SelfDestructingSolverStorable11 [2022-07-14 06:13:34,380 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:34,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:34,381 INFO L85 PathProgramCache]: Analyzing trace with hash 285681908, now seen corresponding path program 1 times [2022-07-14 06:13:34,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:34,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057626628] [2022-07-14 06:13:34,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:34,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:34,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:34,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:34,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 06:13:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:34,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 06:13:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:34,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 06:13:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 06:13:34,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:34,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057626628] [2022-07-14 06:13:34,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057626628] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:13:34,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629811970] [2022-07-14 06:13:34,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:34,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:13:34,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:13:34,551 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:13:34,583 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:13:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:34,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 06:13:34,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:13:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 06:13:34,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:13:34,979 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 30 treesize of output 26 [2022-07-14 06:13:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 06:13:35,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629811970] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:13:35,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:13:35,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2022-07-14 06:13:35,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893077714] [2022-07-14 06:13:35,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:13:35,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-14 06:13:35,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:35,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 06:13:35,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:13:35,177 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 23 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-14 06:13:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:35,678 INFO L93 Difference]: Finished difference Result 148 states and 179 transitions. [2022-07-14 06:13:35,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:13:35,679 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) Word has length 39 [2022-07-14 06:13:35,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:35,680 INFO L225 Difference]: With dead ends: 148 [2022-07-14 06:13:35,680 INFO L226 Difference]: Without dead ends: 146 [2022-07-14 06:13:35,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2022-07-14 06:13:35,681 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 119 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:35,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 467 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 409 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2022-07-14 06:13:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-14 06:13:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2022-07-14 06:13:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 92 states have internal predecessors, (102), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (27), 19 states have call predecessors, (27), 22 states have call successors, (27) [2022-07-14 06:13:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2022-07-14 06:13:35,687 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 39 [2022-07-14 06:13:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:35,688 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2022-07-14 06:13:35,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-14 06:13:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2022-07-14 06:13:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:13:35,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:35,690 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:35,709 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:13:35,902 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,SelfDestructingSolverStorable12 [2022-07-14 06:13:35,902 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:35,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:35,903 INFO L85 PathProgramCache]: Analyzing trace with hash -337593259, now seen corresponding path program 1 times [2022-07-14 06:13:35,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:35,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166314417] [2022-07-14 06:13:35,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:35,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:35,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:36,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:36,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 06:13:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:36,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 06:13:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:36,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 06:13:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:13:36,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:36,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166314417] [2022-07-14 06:13:36,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166314417] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:13:36,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712683360] [2022-07-14 06:13:36,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:36,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:13:36,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:13:36,037 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:13:36,038 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:13:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:36,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 06:13:36,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:13:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:13:36,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:13:36,573 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 31 treesize of output 27 [2022-07-14 06:13:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:13:36,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712683360] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:13:36,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:13:36,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 35 [2022-07-14 06:13:36,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713620390] [2022-07-14 06:13:36,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:13:36,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-14 06:13:36,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:36,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-14 06:13:36,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2022-07-14 06:13:36,707 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 36 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-14 06:13:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:37,968 INFO L93 Difference]: Finished difference Result 278 states and 351 transitions. [2022-07-14 06:13:37,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-14 06:13:37,969 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 41 [2022-07-14 06:13:37,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:37,970 INFO L225 Difference]: With dead ends: 278 [2022-07-14 06:13:37,970 INFO L226 Difference]: Without dead ends: 278 [2022-07-14 06:13:37,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=477, Invalid=3555, Unknown=0, NotChecked=0, Total=4032 [2022-07-14 06:13:37,972 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 317 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:37,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 733 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1013 Invalid, 0 Unknown, 258 Unchecked, 0.5s Time] [2022-07-14 06:13:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-14 06:13:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 167. [2022-07-14 06:13:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 116 states have (on average 1.2413793103448276) internal successors, (144), 127 states have internal predecessors, (144), 29 states have call successors, (29), 11 states have call predecessors, (29), 16 states have return successors, (45), 28 states have call predecessors, (45), 29 states have call successors, (45) [2022-07-14 06:13:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 218 transitions. [2022-07-14 06:13:37,979 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 218 transitions. Word has length 41 [2022-07-14 06:13:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:37,979 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 218 transitions. [2022-07-14 06:13:37,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-14 06:13:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 218 transitions. [2022-07-14 06:13:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:13:37,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:37,979 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:37,998 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:13:38,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:13:38,180 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:38,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:38,180 INFO L85 PathProgramCache]: Analyzing trace with hash -525112999, now seen corresponding path program 1 times [2022-07-14 06:13:38,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:38,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248045593] [2022-07-14 06:13:38,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:38,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:38,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:38,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:38,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 06:13:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:38,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 06:13:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:38,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 06:13:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:13:38,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:38,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248045593] [2022-07-14 06:13:38,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248045593] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:13:38,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652516320] [2022-07-14 06:13:38,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:38,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:13:38,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:13:38,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:13:38,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 06:13:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:38,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 06:13:38,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:13:38,360 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 7 treesize of output 6 [2022-07-14 06:13:40,382 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_5 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_5))) is different from true [2022-07-14 06:13:42,412 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_6 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_6))) is different from true [2022-07-14 06:13:44,452 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_7 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_7))) is different from true [2022-07-14 06:13:44,563 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 29 treesize of output 23 [2022-07-14 06:13:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2022-07-14 06:13:44,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:13:46,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652516320] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:13:46,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:13:46,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 22 [2022-07-14 06:13:46,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360441055] [2022-07-14 06:13:46,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:13:46,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 06:13:46,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:46,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 06:13:46,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=492, Unknown=3, NotChecked=138, Total=702 [2022-07-14 06:13:46,788 INFO L87 Difference]: Start difference. First operand 167 states and 218 transitions. Second operand has 22 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-14 06:13:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:47,079 INFO L93 Difference]: Finished difference Result 169 states and 219 transitions. [2022-07-14 06:13:47,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:13:47,082 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2022-07-14 06:13:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:47,083 INFO L225 Difference]: With dead ends: 169 [2022-07-14 06:13:47,083 INFO L226 Difference]: Without dead ends: 169 [2022-07-14 06:13:47,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=125, Invalid=814, Unknown=3, NotChecked=180, Total=1122 [2022-07-14 06:13:47,084 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 49 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:47,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 308 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 253 Invalid, 0 Unknown, 282 Unchecked, 0.2s Time] [2022-07-14 06:13:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-14 06:13:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-14 06:13:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 118 states have (on average 1.228813559322034) internal successors, (145), 128 states have internal predecessors, (145), 29 states have call successors, (29), 12 states have call predecessors, (29), 17 states have return successors, (45), 28 states have call predecessors, (45), 29 states have call successors, (45) [2022-07-14 06:13:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 219 transitions. [2022-07-14 06:13:47,094 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 219 transitions. Word has length 46 [2022-07-14 06:13:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:47,094 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 219 transitions. [2022-07-14 06:13:47,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-14 06:13:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 219 transitions. [2022-07-14 06:13:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 06:13:47,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:47,095 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:47,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:13:47,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-14 06:13:47,313 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:47,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:47,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1395918346, now seen corresponding path program 1 times [2022-07-14 06:13:47,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:47,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350821129] [2022-07-14 06:13:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:47,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:47,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:47,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:47,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 06:13:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:47,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 06:13:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:47,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 06:13:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:47,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 06:13:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-14 06:13:47,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:47,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350821129] [2022-07-14 06:13:47,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350821129] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:13:47,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58510942] [2022-07-14 06:13:47,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:47,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:13:47,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:13:47,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:13:47,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 06:13:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:47,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-14 06:13:47,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:13:47,497 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:13:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:13:47,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:13:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-14 06:13:48,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58510942] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:13:48,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:13:48,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2022-07-14 06:13:48,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857224878] [2022-07-14 06:13:48,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:13:48,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 06:13:48,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:48,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 06:13:48,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-14 06:13:48,151 INFO L87 Difference]: Start difference. First operand 169 states and 219 transitions. Second operand has 22 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-14 06:13:48,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:48,603 INFO L93 Difference]: Finished difference Result 244 states and 312 transitions. [2022-07-14 06:13:48,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:13:48,604 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 47 [2022-07-14 06:13:48,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:48,605 INFO L225 Difference]: With dead ends: 244 [2022-07-14 06:13:48,605 INFO L226 Difference]: Without dead ends: 244 [2022-07-14 06:13:48,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2022-07-14 06:13:48,605 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 218 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:48,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 352 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 476 Invalid, 0 Unknown, 58 Unchecked, 0.3s Time] [2022-07-14 06:13:48,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-14 06:13:48,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 172. [2022-07-14 06:13:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 130 states have internal predecessors, (145), 29 states have call successors, (29), 13 states have call predecessors, (29), 18 states have return successors, (45), 28 states have call predecessors, (45), 29 states have call successors, (45) [2022-07-14 06:13:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 219 transitions. [2022-07-14 06:13:48,611 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 219 transitions. Word has length 47 [2022-07-14 06:13:48,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:48,612 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 219 transitions. [2022-07-14 06:13:48,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-14 06:13:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 219 transitions. [2022-07-14 06:13:48,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:13:48,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:48,612 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:48,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:13:48,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-14 06:13:48,828 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:48,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash 323795755, now seen corresponding path program 1 times [2022-07-14 06:13:48,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:48,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100113753] [2022-07-14 06:13:48,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:48,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:48,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:48,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 06:13:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:48,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 06:13:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:48,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 06:13:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:48,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 06:13:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-14 06:13:48,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:48,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100113753] [2022-07-14 06:13:48,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100113753] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:13:48,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095019278] [2022-07-14 06:13:48,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:48,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:13:48,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:13:48,955 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:13:48,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 06:13:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:49,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-14 06:13:49,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:13:49,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 06:13:49,247 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:13:49,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:13:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-14 06:13:49,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095019278] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:13:49,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:13:49,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-07-14 06:13:49,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76016194] [2022-07-14 06:13:49,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:13:49,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-14 06:13:49,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:49,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 06:13:49,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:13:49,652 INFO L87 Difference]: Start difference. First operand 172 states and 219 transitions. Second operand has 23 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-14 06:13:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:50,326 INFO L93 Difference]: Finished difference Result 273 states and 335 transitions. [2022-07-14 06:13:50,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:13:50,331 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 48 [2022-07-14 06:13:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:50,333 INFO L225 Difference]: With dead ends: 273 [2022-07-14 06:13:50,333 INFO L226 Difference]: Without dead ends: 273 [2022-07-14 06:13:50,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2022-07-14 06:13:50,334 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 294 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:50,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 484 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 641 Invalid, 0 Unknown, 72 Unchecked, 0.4s Time] [2022-07-14 06:13:50,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-14 06:13:50,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 178. [2022-07-14 06:13:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 128 states have (on average 1.171875) internal successors, (150), 134 states have internal predecessors, (150), 28 states have call successors, (28), 15 states have call predecessors, (28), 19 states have return successors, (38), 28 states have call predecessors, (38), 28 states have call successors, (38) [2022-07-14 06:13:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 216 transitions. [2022-07-14 06:13:50,340 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 216 transitions. Word has length 48 [2022-07-14 06:13:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:50,341 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 216 transitions. [2022-07-14 06:13:50,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-14 06:13:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 216 transitions. [2022-07-14 06:13:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 06:13:50,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:50,341 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:50,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:13:50,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-14 06:13:50,555 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:50,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:50,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2076994669, now seen corresponding path program 1 times [2022-07-14 06:13:50,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:50,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324899155] [2022-07-14 06:13:50,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:50,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:50,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:50,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:50,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 06:13:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:50,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:50,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 06:13:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:50,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 06:13:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 06:13:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 06:13:50,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:50,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324899155] [2022-07-14 06:13:50,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324899155] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:13:50,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745964381] [2022-07-14 06:13:50,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:50,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:13:50,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:13:50,773 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:13:50,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 06:13:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:50,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-14 06:13:50,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:13:50,831 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:13:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 06:13:51,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:13:51,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745964381] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:13:51,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:13:51,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2022-07-14 06:13:51,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460556024] [2022-07-14 06:13:51,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:13:51,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 06:13:51,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:13:51,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 06:13:51,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2022-07-14 06:13:51,922 INFO L87 Difference]: Start difference. First operand 178 states and 216 transitions. Second operand has 20 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 8 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-14 06:13:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:13:52,664 INFO L93 Difference]: Finished difference Result 369 states and 470 transitions. [2022-07-14 06:13:52,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:13:52,665 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 8 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 54 [2022-07-14 06:13:52,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:13:52,667 INFO L225 Difference]: With dead ends: 369 [2022-07-14 06:13:52,667 INFO L226 Difference]: Without dead ends: 346 [2022-07-14 06:13:52,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=1591, Unknown=0, NotChecked=0, Total=1806 [2022-07-14 06:13:52,668 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 127 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:13:52,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 769 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:13:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-14 06:13:52,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 234. [2022-07-14 06:13:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 176 states have (on average 1.1818181818181819) internal successors, (208), 177 states have internal predecessors, (208), 32 states have call successors, (32), 15 states have call predecessors, (32), 23 states have return successors, (51), 41 states have call predecessors, (51), 32 states have call successors, (51) [2022-07-14 06:13:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 291 transitions. [2022-07-14 06:13:52,675 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 291 transitions. Word has length 54 [2022-07-14 06:13:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:13:52,675 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 291 transitions. [2022-07-14 06:13:52,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 8 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-14 06:13:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 291 transitions. [2022-07-14 06:13:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 06:13:52,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:13:52,676 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:13:52,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-14 06:13:52,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:13:52,892 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:13:52,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:13:52,892 INFO L85 PathProgramCache]: Analyzing trace with hash 412534293, now seen corresponding path program 1 times [2022-07-14 06:13:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:13:52,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239168895] [2022-07-14 06:13:52,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:52,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:13:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:52,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:52,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:13:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:52,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 06:13:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:53,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:13:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:53,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 06:13:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:53,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 06:13:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:53,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 06:13:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:53,052 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 06:13:53,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:13:53,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239168895] [2022-07-14 06:13:53,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239168895] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:13:53,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859582664] [2022-07-14 06:13:53,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:13:53,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:13:53,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:13:53,054 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:13:53,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 06:13:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:13:53,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 06:13:53,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:13:53,133 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 7 treesize of output 6 [2022-07-14 06:13:55,147 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|))) is different from true [2022-07-14 06:14:51,636 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 06:15:05,776 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 06:15:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2022-07-14 06:15:05,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:15:07,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859582664] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:07,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:15:07,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 18 [2022-07-14 06:15:07,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936418031] [2022-07-14 06:15:07,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:15:07,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 06:15:07,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:15:07,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 06:15:07,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=238, Unknown=24, NotChecked=32, Total=342 [2022-07-14 06:15:07,916 INFO L87 Difference]: Start difference. First operand 234 states and 291 transitions. Second operand has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 8 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-14 06:15:18,054 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 43 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 06:15:38,207 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 32 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 06:15:58,345 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification. DAG size of input: 38 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 06:15:58,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:15:58,475 INFO L93 Difference]: Finished difference Result 345 states and 437 transitions. [2022-07-14 06:15:58,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 06:15:58,476 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 8 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 54 [2022-07-14 06:15:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:15:58,477 INFO L225 Difference]: With dead ends: 345 [2022-07-14 06:15:58,477 INFO L226 Difference]: Without dead ends: 329 [2022-07-14 06:15:58,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 124.9s TimeCoverageRelationStatistics Valid=85, Invalid=483, Unknown=36, NotChecked=46, Total=650 [2022-07-14 06:15:58,478 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 40 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:15:58,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 326 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 264 Unchecked, 0.2s Time] [2022-07-14 06:15:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-14 06:15:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 232. [2022-07-14 06:15:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 174 states have (on average 1.1781609195402298) internal successors, (205), 175 states have internal predecessors, (205), 32 states have call successors, (32), 16 states have call predecessors, (32), 23 states have return successors, (50), 40 states have call predecessors, (50), 32 states have call successors, (50) [2022-07-14 06:15:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 287 transitions. [2022-07-14 06:15:58,485 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 287 transitions. Word has length 54 [2022-07-14 06:15:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:15:58,485 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 287 transitions. [2022-07-14 06:15:58,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 8 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-14 06:15:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 287 transitions. [2022-07-14 06:15:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 06:15:58,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:15:58,486 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:15:58,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:15:58,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:58,687 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:15:58,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:15:58,688 INFO L85 PathProgramCache]: Analyzing trace with hash 806764368, now seen corresponding path program 1 times [2022-07-14 06:15:58,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:15:58,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094749604] [2022-07-14 06:15:58,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:58,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:15:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:58,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:15:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:58,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:15:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:58,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 06:15:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:58,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 06:15:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:58,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 06:15:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:58,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 06:15:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:58,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-14 06:15:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-14 06:15:58,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:15:58,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094749604] [2022-07-14 06:15:58,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094749604] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:15:58,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989054224] [2022-07-14 06:15:58,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:15:58,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:15:58,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:15:58,813 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:15:58,815 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:15:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:15:58,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 06:15:58,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:15:58,873 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 7 treesize of output 6 [2022-07-14 06:16:00,889 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_28 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_28))) is different from true [2022-07-14 06:16:02,911 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_29 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_29))) is different from true [2022-07-14 06:16:02,973 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 29 treesize of output 23 [2022-07-14 06:16:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 06:16:02,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:16:02,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989054224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:02,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:16:02,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 13 [2022-07-14 06:16:02,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092813122] [2022-07-14 06:16:02,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:02,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:16:02,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:02,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:16:02,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=89, Unknown=2, NotChecked=38, Total=156 [2022-07-14 06:16:02,988 INFO L87 Difference]: Start difference. First operand 232 states and 287 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-14 06:16:03,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:03,025 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions. [2022-07-14 06:16:03,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:16:03,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2022-07-14 06:16:03,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:03,026 INFO L225 Difference]: With dead ends: 187 [2022-07-14 06:16:03,026 INFO L226 Difference]: Without dead ends: 187 [2022-07-14 06:16:03,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2022-07-14 06:16:03,027 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:03,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 204 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 155 Unchecked, 0.0s Time] [2022-07-14 06:16:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-14 06:16:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-14 06:16:03,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 140 states have (on average 1.1571428571428573) internal successors, (162), 141 states have internal predecessors, (162), 25 states have call successors, (25), 13 states have call predecessors, (25), 19 states have return successors, (38), 32 states have call predecessors, (38), 25 states have call successors, (38) [2022-07-14 06:16:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2022-07-14 06:16:03,031 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 56 [2022-07-14 06:16:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:03,032 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2022-07-14 06:16:03,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-14 06:16:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2022-07-14 06:16:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-14 06:16:03,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:03,033 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:03,054 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:16:03,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:03,253 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:16:03,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:03,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1896699969, now seen corresponding path program 1 times [2022-07-14 06:16:03,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:03,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091118327] [2022-07-14 06:16:03,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:03,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:03,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:16:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:03,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 06:16:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 06:16:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:03,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 06:16:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:03,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:16:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:03,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 06:16:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:03,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 06:16:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:03,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 06:16:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-14 06:16:03,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:03,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091118327] [2022-07-14 06:16:03,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091118327] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:03,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888372036] [2022-07-14 06:16:03,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:03,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:03,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:16:03,490 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:16:03,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 06:16:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:03,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-14 06:16:03,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:16:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-14 06:16:03,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:16:04,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888372036] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:04,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:16:04,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2022-07-14 06:16:04,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561787015] [2022-07-14 06:16:04,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:16:04,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-14 06:16:04,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:04,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-14 06:16:04,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-07-14 06:16:04,418 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand has 30 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 25 states have internal predecessors, (57), 12 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-14 06:16:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:05,844 INFO L93 Difference]: Finished difference Result 263 states and 321 transitions. [2022-07-14 06:16:05,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-14 06:16:05,845 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 25 states have internal predecessors, (57), 12 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) Word has length 71 [2022-07-14 06:16:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:05,849 INFO L225 Difference]: With dead ends: 263 [2022-07-14 06:16:05,849 INFO L226 Difference]: Without dead ends: 234 [2022-07-14 06:16:05,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=441, Invalid=2981, Unknown=0, NotChecked=0, Total=3422 [2022-07-14 06:16:05,850 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 308 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:05,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 736 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:16:05,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-14 06:16:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 170. [2022-07-14 06:16:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 127 states have (on average 1.1574803149606299) internal successors, (147), 127 states have internal predecessors, (147), 24 states have call successors, (24), 13 states have call predecessors, (24), 16 states have return successors, (32), 29 states have call predecessors, (32), 24 states have call successors, (32) [2022-07-14 06:16:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2022-07-14 06:16:05,855 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 71 [2022-07-14 06:16:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:05,856 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2022-07-14 06:16:05,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 25 states have internal predecessors, (57), 12 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-14 06:16:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2022-07-14 06:16:05,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-14 06:16:05,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:05,857 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:05,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-14 06:16:06,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-14 06:16:06,072 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:16:06,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:06,072 INFO L85 PathProgramCache]: Analyzing trace with hash 91261635, now seen corresponding path program 1 times [2022-07-14 06:16:06,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:06,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518796149] [2022-07-14 06:16:06,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:06,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:06,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:16:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:06,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:06,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 06:16:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:06,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 06:16:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:06,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 06:16:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:06,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:16:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:06,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 06:16:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:06,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 06:16:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:06,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 06:16:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-14 06:16:06,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:06,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518796149] [2022-07-14 06:16:06,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518796149] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:06,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672904032] [2022-07-14 06:16:06,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:06,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:06,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:16:06,323 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:16:06,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 06:16:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:06,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 06:16:06,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:16:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-14 06:16:06,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:16:07,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672904032] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:07,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:16:07,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2022-07-14 06:16:07,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648847113] [2022-07-14 06:16:07,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:16:07,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-14 06:16:07,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:07,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-14 06:16:07,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2022-07-14 06:16:07,595 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 28 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-07-14 06:16:08,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:08,608 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2022-07-14 06:16:08,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 06:16:08,610 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) Word has length 71 [2022-07-14 06:16:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:08,611 INFO L225 Difference]: With dead ends: 232 [2022-07-14 06:16:08,611 INFO L226 Difference]: Without dead ends: 232 [2022-07-14 06:16:08,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=381, Invalid=2481, Unknown=0, NotChecked=0, Total=2862 [2022-07-14 06:16:08,612 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 239 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:08,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 550 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:16:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-14 06:16:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 170. [2022-07-14 06:16:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 127 states have (on average 1.1496062992125984) internal successors, (146), 127 states have internal predecessors, (146), 24 states have call successors, (24), 13 states have call predecessors, (24), 16 states have return successors, (32), 29 states have call predecessors, (32), 24 states have call successors, (32) [2022-07-14 06:16:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 202 transitions. [2022-07-14 06:16:08,617 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 202 transitions. Word has length 71 [2022-07-14 06:16:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:08,618 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 202 transitions. [2022-07-14 06:16:08,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-07-14 06:16:08,618 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 202 transitions. [2022-07-14 06:16:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-14 06:16:08,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:08,618 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:08,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 06:16:08,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-14 06:16:08,828 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-14 06:16:08,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:08,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1341702710, now seen corresponding path program 2 times [2022-07-14 06:16:08,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:08,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469428986] [2022-07-14 06:16:08,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:08,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:08,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:16:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:08,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:08,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 06:16:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:08,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 06:16:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:08,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 06:16:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:08,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 06:16:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:08,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 06:16:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:08,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 06:16:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:08,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 06:16:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-14 06:16:08,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:08,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469428986] [2022-07-14 06:16:08,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469428986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:08,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800425445] [2022-07-14 06:16:08,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:16:08,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:08,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:16:08,924 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:16:08,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 06:16:09,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:16:09,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:16:09,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 06:16:09,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:16:09,061 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 7 treesize of output 6 [2022-07-14 06:16:11,074 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_34 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_34))) is different from true [2022-07-14 06:16:13,089 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_35 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_35))) is different from true [2022-07-14 06:16:15,109 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_37 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_37))) is different from true [2022-07-14 06:16:17,127 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_38 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_38))) is different from true [2022-07-14 06:16:17,166 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 29 treesize of output 23 [2022-07-14 06:16:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 63 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 8 not checked. [2022-07-14 06:16:17,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:16:19,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800425445] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:19,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:16:19,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 15 [2022-07-14 06:16:19,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15754255] [2022-07-14 06:16:19,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:16:19,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 06:16:19,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:19,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 06:16:19,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=152, Unknown=4, NotChecked=108, Total=306 [2022-07-14 06:16:19,238 INFO L87 Difference]: Start difference. First operand 170 states and 202 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 5 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-14 06:16:21,275 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_check_~a.base_BEFORE_CALL_37 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_37))) (exists ((v_check_~a.base_BEFORE_CALL_34 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_34)))) is different from true [2022-07-14 06:16:23,281 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_check_~a.base_BEFORE_CALL_38 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_38))) (exists ((v_check_~a.base_BEFORE_CALL_35 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_35)))) is different from true [2022-07-14 06:16:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:23,310 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-07-14 06:16:23,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:16:23,311 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 5 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 73 [2022-07-14 06:16:23,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:23,311 INFO L225 Difference]: With dead ends: 46 [2022-07-14 06:16:23,311 INFO L226 Difference]: Without dead ends: 0 [2022-07-14 06:16:23,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=76, Invalid=248, Unknown=6, NotChecked=222, Total=552 [2022-07-14 06:16:23,312 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:23,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 121 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 152 Unchecked, 0.0s Time] [2022-07-14 06:16:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-14 06:16:23,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-14 06:16:23,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:23,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-14 06:16:23,313 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2022-07-14 06:16:23,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:23,313 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 06:16:23,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 5 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-14 06:16:23,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-14 06:16:23,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-14 06:16:23,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2022-07-14 06:16:23,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2022-07-14 06:16:23,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2022-07-14 06:16:23,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2022-07-14 06:16:23,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (12 of 17 remaining) [2022-07-14 06:16:23,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (11 of 17 remaining) [2022-07-14 06:16:23,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (10 of 17 remaining) [2022-07-14 06:16:23,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (9 of 17 remaining) [2022-07-14 06:16:23,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2022-07-14 06:16:23,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2022-07-14 06:16:23,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2022-07-14 06:16:23,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2022-07-14 06:16:23,317 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2022-07-14 06:16:23,317 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2022-07-14 06:16:23,317 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2022-07-14 06:16:23,317 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2022-07-14 06:16:23,317 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2022-07-14 06:16:23,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-14 06:16:23,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-14 06:16:23,520 INFO L356 BasicCegarLoop]: Path program histogram: [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 06:16:23,522 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 06:16:23,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 06:16:23 BoogieIcfgContainer [2022-07-14 06:16:23,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 06:16:23,524 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 06:16:23,524 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 06:16:23,524 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 06:16:23,525 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:13:31" (3/4) ... [2022-07-14 06:16:23,529 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-14 06:16:23,534 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-14 06:16:23,535 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2022-07-14 06:16:23,535 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-14 06:16:23,538 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-07-14 06:16:23,539 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-14 06:16:23,539 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-14 06:16:23,539 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-14 06:16:23,572 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 06:16:23,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 06:16:23,576 INFO L158 Benchmark]: Toolchain (without parser) took 173037.68ms. Allocated memory was 90.2MB in the beginning and 174.1MB in the end (delta: 83.9MB). Free memory was 63.2MB in the beginning and 136.1MB in the end (delta: -72.9MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2022-07-14 06:16:23,577 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:16:23,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.92ms. Allocated memory is still 90.2MB. Free memory was 63.1MB in the beginning and 52.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 06:16:23,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.31ms. Allocated memory is still 90.2MB. Free memory was 52.7MB in the beginning and 51.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:16:23,582 INFO L158 Benchmark]: Boogie Preprocessor took 36.13ms. Allocated memory is still 90.2MB. Free memory was 51.1MB in the beginning and 50.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:16:23,582 INFO L158 Benchmark]: RCFGBuilder took 353.53ms. Allocated memory was 90.2MB in the beginning and 144.7MB in the end (delta: 54.5MB). Free memory was 50.0MB in the beginning and 117.6MB in the end (delta: -67.6MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2022-07-14 06:16:23,582 INFO L158 Benchmark]: TraceAbstraction took 172336.56ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 117.1MB in the beginning and 139.1MB in the end (delta: -22.0MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2022-07-14 06:16:23,582 INFO L158 Benchmark]: Witness Printer took 48.62ms. Allocated memory is still 174.1MB. Free memory was 139.1MB in the beginning and 136.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:16:23,584 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.17ms. Allocated memory is still 90.2MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.92ms. Allocated memory is still 90.2MB. Free memory was 63.1MB in the beginning and 52.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.31ms. Allocated memory is still 90.2MB. Free memory was 52.7MB in the beginning and 51.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.13ms. Allocated memory is still 90.2MB. Free memory was 51.1MB in the beginning and 50.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 353.53ms. Allocated memory was 90.2MB in the beginning and 144.7MB in the end (delta: 54.5MB). Free memory was 50.0MB in the beginning and 117.6MB in the end (delta: -67.6MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 172336.56ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 117.1MB in the beginning and 139.1MB in the end (delta: -22.0MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Witness Printer took 48.62ms. Allocated memory is still 174.1MB. Free memory was 139.1MB in the beginning and 136.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 40]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 172.3s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 62.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2287 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2270 mSDsluCounter, 7482 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1278 IncrementalHoareTripleChecker+Unchecked, 6305 mSDsCounter, 931 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6866 IncrementalHoareTripleChecker+Invalid, 9075 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 931 mSolverCounterUnsat, 1177 mSDtfsCounter, 6866 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1493 GetRequests, 968 SyntacticMatches, 39 SemanticMatches, 486 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2945 ImplicationChecksByTransitivity, 158.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=18, InterpolantAutomatonStates: 304, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 737 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 105.7s InterpolantComputationTime, 1576 NumberOfCodeBlocks, 1576 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1712 ConstructedInterpolants, 105 QuantifiedInterpolants, 10108 SizeOfPredicates, 110 NumberOfNonLiveVariables, 2699 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 39 InterpolantComputations, 13 PerfectInterpolantSequences, 804/977 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-14 06:16:23,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE