./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-examples/relax-2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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/array-examples/relax-2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 21:46:10,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:46:10,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:46:11,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:46:11,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:46:11,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:46:11,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:46:11,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:46:11,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:46:11,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:46:11,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:46:11,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:46:11,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:46:11,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:46:11,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:46:11,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:46:11,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:46:11,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:46:11,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:46:11,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:46:11,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:46:11,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:46:11,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:46:11,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:46:11,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:46:11,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:46:11,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:46:11,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:46:11,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:46:11,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:46:11,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:46:11,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:46:11,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:46:11,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:46:11,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:46:11,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:46:11,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:46:11,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:46:11,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:46:11,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:46:11,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:46:11,058 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 21:46:11,077 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:46:11,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:46:11,078 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:46:11,078 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:46:11,079 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:46:11,079 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:46:11,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:46:11,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:46:11,080 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:46:11,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:46:11,080 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:46:11,081 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 21:46:11,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:46:11,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:46:11,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:46:11,081 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 21:46:11,081 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 21:46:11,081 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 21:46:11,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:46:11,082 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 21:46:11,082 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:46:11,082 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:46:11,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:46:11,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:46:11,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:46:11,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:46:11,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:46:11,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:46:11,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 21:46:11,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 21:46:11,083 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:46:11,083 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:46:11,084 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:46:11,084 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:46:11,084 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef [2023-02-15 21:46:11,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:46:11,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:46:11,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:46:11,289 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:46:11,289 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:46:11,290 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/relax-2-2.i [2023-02-15 21:46:12,311 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:46:12,520 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:46:12,521 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i [2023-02-15 21:46:12,527 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2061be41/7d8d3053d41647428f9b0dc619c893c2/FLAG496d5bfba [2023-02-15 21:46:12,540 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2061be41/7d8d3053d41647428f9b0dc619c893c2 [2023-02-15 21:46:12,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:46:12,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:46:12,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:46:12,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:46:12,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:46:12,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:46:12" (1/1) ... [2023-02-15 21:46:12,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd58be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:12, skipping insertion in model container [2023-02-15 21:46:12,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:46:12" (1/1) ... [2023-02-15 21:46:12,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:46:12,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:46:12,723 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i[982,995] [2023-02-15 21:46:12,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:46:12,837 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 21:46:12,846 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i[982,995] [2023-02-15 21:46:12,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:46:12,881 INFO L208 MainTranslator]: Completed translation [2023-02-15 21:46:12,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:12 WrapperNode [2023-02-15 21:46:12,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:46:12,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 21:46:12,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 21:46:12,882 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 21:46:12,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:12" (1/1) ... [2023-02-15 21:46:12,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:12" (1/1) ... [2023-02-15 21:46:12,919 INFO L138 Inliner]: procedures = 120, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 137 [2023-02-15 21:46:12,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 21:46:12,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 21:46:12,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 21:46:12,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 21:46:12,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:12" (1/1) ... [2023-02-15 21:46:12,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:12" (1/1) ... [2023-02-15 21:46:12,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:12" (1/1) ... [2023-02-15 21:46:12,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:12" (1/1) ... [2023-02-15 21:46:12,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:12" (1/1) ... [2023-02-15 21:46:12,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:12" (1/1) ... [2023-02-15 21:46:12,941 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:12" (1/1) ... [2023-02-15 21:46:12,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:12" (1/1) ... [2023-02-15 21:46:12,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 21:46:12,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 21:46:12,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 21:46:12,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 21:46:12,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:12" (1/1) ... [2023-02-15 21:46:12,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:46:12,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:46:12,980 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) [2023-02-15 21:46:12,990 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 [2023-02-15 21:46:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 21:46:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 21:46:13,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 21:46:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 21:46:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-15 21:46:13,011 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-15 21:46:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 21:46:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 21:46:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 21:46:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 21:46:13,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 21:46:13,109 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 21:46:13,110 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 21:46:13,410 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 21:46:13,415 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 21:46:13,415 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 21:46:13,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:46:13 BoogieIcfgContainer [2023-02-15 21:46:13,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 21:46:13,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 21:46:13,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 21:46:13,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 21:46:13,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 09:46:12" (1/3) ... [2023-02-15 21:46:13,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ef7a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:46:13, skipping insertion in model container [2023-02-15 21:46:13,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:12" (2/3) ... [2023-02-15 21:46:13,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ef7a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:46:13, skipping insertion in model container [2023-02-15 21:46:13,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:46:13" (3/3) ... [2023-02-15 21:46:13,422 INFO L112 eAbstractionObserver]: Analyzing ICFG relax-2-2.i [2023-02-15 21:46:13,435 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 21:46:13,435 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-02-15 21:46:13,463 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 21:46:13,468 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@74cc69d7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 21:46:13,468 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-02-15 21:46:13,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 84 states have internal predecessors, (107), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:46:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 21:46:13,477 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:13,478 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:13,478 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:13,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:13,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1952693727, now seen corresponding path program 1 times [2023-02-15 21:46:13,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:13,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633971627] [2023-02-15 21:46:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:13,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:13,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:13,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:13,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:13,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:13,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633971627] [2023-02-15 21:46:13,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633971627] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:13,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:13,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:46:13,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383895081] [2023-02-15 21:46:13,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:13,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 21:46:13,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:13,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 21:46:13,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 21:46:13,661 INFO L87 Difference]: Start difference. First operand has 93 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 84 states have internal predecessors, (107), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 21:46:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:13,676 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2023-02-15 21:46:13,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 21:46:13,678 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2023-02-15 21:46:13,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:13,684 INFO L225 Difference]: With dead ends: 93 [2023-02-15 21:46:13,684 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 21:46:13,685 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 [2023-02-15 21:46:13,688 INFO L413 NwaCegarLoop]: 114 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, 114 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 [2023-02-15 21:46:13,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:46:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 21:46:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-15 21:46:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.75) internal successors, (98), 82 states have internal predecessors, (98), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:46:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2023-02-15 21:46:13,736 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 15 [2023-02-15 21:46:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:13,737 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2023-02-15 21:46:13,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 21:46:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2023-02-15 21:46:13,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 21:46:13,738 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:13,738 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:13,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 21:46:13,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:13,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1194370847, now seen corresponding path program 1 times [2023-02-15 21:46:13,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:13,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641939907] [2023-02-15 21:46:13,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:13,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:14,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:14,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:14,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641939907] [2023-02-15 21:46:14,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641939907] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:46:14,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121563276] [2023-02-15 21:46:14,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:14,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:46:14,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:46:14,212 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) [2023-02-15 21:46:14,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 21:46:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:14,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 21:46:14,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:14,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:46:14,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-02-15 21:46:14,442 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 21:46:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:14,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:14,630 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:46:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:14,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121563276] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:14,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:46:14,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-02-15 21:46:14,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815097102] [2023-02-15 21:46:14,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:14,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 21:46:14,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:14,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 21:46:14,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:46:14,771 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 21:46:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:15,338 INFO L93 Difference]: Finished difference Result 177 states and 223 transitions. [2023-02-15 21:46:15,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:46:15,339 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2023-02-15 21:46:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:15,340 INFO L225 Difference]: With dead ends: 177 [2023-02-15 21:46:15,340 INFO L226 Difference]: Without dead ends: 177 [2023-02-15 21:46:15,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2023-02-15 21:46:15,341 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 493 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:15,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 490 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 21:46:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-15 21:46:15,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2023-02-15 21:46:15,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 88 states have internal predecessors, (108), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:46:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 122 transitions. [2023-02-15 21:46:15,355 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 122 transitions. Word has length 15 [2023-02-15 21:46:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:15,355 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 122 transitions. [2023-02-15 21:46:15,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 21:46:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2023-02-15 21:46:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 21:46:15,356 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:15,357 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:15,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:15,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:46:15,570 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:15,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:15,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1194370848, now seen corresponding path program 1 times [2023-02-15 21:46:15,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:15,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454200974] [2023-02-15 21:46:15,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:15,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:15,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:15,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:15,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:15,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454200974] [2023-02-15 21:46:15,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454200974] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:15,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:15,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:46:15,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869923845] [2023-02-15 21:46:15,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:15,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:46:15,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:15,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:46:15,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:46:15,652 INFO L87 Difference]: Start difference. First operand 97 states and 122 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:15,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:15,685 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2023-02-15 21:46:15,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:46:15,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2023-02-15 21:46:15,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:15,688 INFO L225 Difference]: With dead ends: 92 [2023-02-15 21:46:15,688 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 21:46:15,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:46:15,691 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 81 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:15,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 93 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:46:15,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 21:46:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-02-15 21:46:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.6290322580645162) internal successors, (101), 83 states have internal predecessors, (101), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:46:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2023-02-15 21:46:15,709 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 15 [2023-02-15 21:46:15,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:15,709 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2023-02-15 21:46:15,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:15,710 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2023-02-15 21:46:15,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 21:46:15,710 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:15,710 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:15,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 21:46:15,711 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:15,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:15,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1034167796, now seen corresponding path program 1 times [2023-02-15 21:46:15,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:15,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427453305] [2023-02-15 21:46:15,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:15,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:15,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:15,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:15,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:15,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427453305] [2023-02-15 21:46:15,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427453305] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:15,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:15,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:46:15,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460807937] [2023-02-15 21:46:15,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:15,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:46:15,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:15,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:46:15,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:46:15,756 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:15,791 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2023-02-15 21:46:15,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:46:15,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-02-15 21:46:15,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:15,792 INFO L225 Difference]: With dead ends: 87 [2023-02-15 21:46:15,793 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 21:46:15,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:46:15,793 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:15,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 93 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:46:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 21:46:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-15 21:46:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 78 states have internal predecessors, (96), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:46:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2023-02-15 21:46:15,797 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 17 [2023-02-15 21:46:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:15,797 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2023-02-15 21:46:15,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2023-02-15 21:46:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 21:46:15,798 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:15,798 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:15,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 21:46:15,799 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:15,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:15,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1034167795, now seen corresponding path program 1 times [2023-02-15 21:46:15,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:15,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873062195] [2023-02-15 21:46:15,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:15,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:15,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:15,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:15,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:15,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873062195] [2023-02-15 21:46:15,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873062195] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:15,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:15,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:46:15,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612738449] [2023-02-15 21:46:15,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:15,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:46:15,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:15,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:46:15,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:46:15,986 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:16,309 INFO L93 Difference]: Finished difference Result 153 states and 199 transitions. [2023-02-15 21:46:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 21:46:16,309 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-02-15 21:46:16,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:16,310 INFO L225 Difference]: With dead ends: 153 [2023-02-15 21:46:16,310 INFO L226 Difference]: Without dead ends: 153 [2023-02-15 21:46:16,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:46:16,311 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 330 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:16,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 296 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:46:16,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-15 21:46:16,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 89. [2023-02-15 21:46:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.546875) internal successors, (99), 80 states have internal predecessors, (99), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:46:16,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2023-02-15 21:46:16,314 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 17 [2023-02-15 21:46:16,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:16,315 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2023-02-15 21:46:16,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:16,315 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2023-02-15 21:46:16,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 21:46:16,315 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:16,315 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:16,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 21:46:16,315 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:16,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:16,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1093959206, now seen corresponding path program 1 times [2023-02-15 21:46:16,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:16,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911374007] [2023-02-15 21:46:16,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:16,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:16,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:16,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:16,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:16,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911374007] [2023-02-15 21:46:16,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911374007] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:16,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:16,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:46:16,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308869418] [2023-02-15 21:46:16,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:16,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:46:16,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:16,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:46:16,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:46:16,404 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:16,459 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2023-02-15 21:46:16,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:46:16,459 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-02-15 21:46:16,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:16,460 INFO L225 Difference]: With dead ends: 88 [2023-02-15 21:46:16,460 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 21:46:16,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:46:16,461 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 133 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:16,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 114 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:46:16,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 21:46:16,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-15 21:46:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.53125) internal successors, (98), 79 states have internal predecessors, (98), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:46:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2023-02-15 21:46:16,473 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 20 [2023-02-15 21:46:16,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:16,473 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2023-02-15 21:46:16,473 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2023-02-15 21:46:16,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 21:46:16,474 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:16,474 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:16,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 21:46:16,474 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:16,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:16,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1093959205, now seen corresponding path program 1 times [2023-02-15 21:46:16,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:16,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986016229] [2023-02-15 21:46:16,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:16,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:16,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:16,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:16,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:16,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986016229] [2023-02-15 21:46:16,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986016229] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:16,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:16,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:46:16,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241893370] [2023-02-15 21:46:16,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:16,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:46:16,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:16,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:46:16,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:46:16,581 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:16,677 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2023-02-15 21:46:16,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:46:16,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-02-15 21:46:16,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:16,678 INFO L225 Difference]: With dead ends: 122 [2023-02-15 21:46:16,678 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 21:46:16,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:46:16,679 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 80 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:16,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 440 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:46:16,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 21:46:16,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2023-02-15 21:46:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.513157894736842) internal successors, (115), 91 states have internal predecessors, (115), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-15 21:46:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 131 transitions. [2023-02-15 21:46:16,683 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 131 transitions. Word has length 20 [2023-02-15 21:46:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:16,683 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 131 transitions. [2023-02-15 21:46:16,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2023-02-15 21:46:16,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 21:46:16,684 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:16,684 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:16,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 21:46:16,684 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:16,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:16,685 INFO L85 PathProgramCache]: Analyzing trace with hash 495604816, now seen corresponding path program 1 times [2023-02-15 21:46:16,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:16,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346620786] [2023-02-15 21:46:16,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:16,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:16,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:16,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:16,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:16,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346620786] [2023-02-15 21:46:16,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346620786] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:46:16,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313679899] [2023-02-15 21:46:16,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:16,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:46:16,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:46:16,953 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) [2023-02-15 21:46:16,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 21:46:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:17,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 21:46:17,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:17,084 INFO L321 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-02-15 21:46:17,085 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 13 treesize of output 19 [2023-02-15 21:46:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:17,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:17,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313679899] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:17,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:46:17,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2023-02-15 21:46:17,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503906948] [2023-02-15 21:46:17,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:17,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 21:46:17,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:17,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 21:46:17,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2023-02-15 21:46:17,613 INFO L87 Difference]: Start difference. First operand 101 states and 131 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 21:46:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:18,619 INFO L93 Difference]: Finished difference Result 165 states and 216 transitions. [2023-02-15 21:46:18,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 21:46:18,620 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2023-02-15 21:46:18,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:18,620 INFO L225 Difference]: With dead ends: 165 [2023-02-15 21:46:18,620 INFO L226 Difference]: Without dead ends: 165 [2023-02-15 21:46:18,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2023-02-15 21:46:18,621 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 572 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:18,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 563 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 21:46:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-15 21:46:18,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 99. [2023-02-15 21:46:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 89 states have internal predecessors, (113), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-15 21:46:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 129 transitions. [2023-02-15 21:46:18,624 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 129 transitions. Word has length 21 [2023-02-15 21:46:18,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:18,625 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 129 transitions. [2023-02-15 21:46:18,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 21:46:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2023-02-15 21:46:18,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 21:46:18,625 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:18,626 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] [2023-02-15 21:46:18,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:18,830 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,SelfDestructingSolverStorable7 [2023-02-15 21:46:18,830 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:18,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash 45614243, now seen corresponding path program 1 times [2023-02-15 21:46:18,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:18,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623556030] [2023-02-15 21:46:18,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:18,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:18,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:18,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:18,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:18,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623556030] [2023-02-15 21:46:18,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623556030] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:18,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:18,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:46:18,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639663091] [2023-02-15 21:46:18,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:18,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:46:18,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:18,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:46:18,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:46:18,887 INFO L87 Difference]: Start difference. First operand 99 states and 129 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:18,925 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2023-02-15 21:46:18,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:46:18,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-02-15 21:46:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:18,927 INFO L225 Difference]: With dead ends: 144 [2023-02-15 21:46:18,928 INFO L226 Difference]: Without dead ends: 144 [2023-02-15 21:46:18,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:46:18,928 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 68 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:18,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 267 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:46:18,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-15 21:46:18,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2023-02-15 21:46:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.5) internal successors, (150), 114 states have internal predecessors, (150), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 21:46:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 168 transitions. [2023-02-15 21:46:18,932 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 168 transitions. Word has length 23 [2023-02-15 21:46:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:18,932 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 168 transitions. [2023-02-15 21:46:18,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 168 transitions. [2023-02-15 21:46:18,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 21:46:18,933 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:18,933 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] [2023-02-15 21:46:18,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 21:46:18,933 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:18,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:18,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1356766572, now seen corresponding path program 1 times [2023-02-15 21:46:18,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:18,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185135996] [2023-02-15 21:46:18,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:18,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:18,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:18,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:18,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185135996] [2023-02-15 21:46:18,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185135996] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:18,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:18,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:46:18,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072808030] [2023-02-15 21:46:18,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:18,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:46:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:18,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:46:18,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:46:18,988 INFO L87 Difference]: Start difference. First operand 125 states and 168 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:18,998 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2023-02-15 21:46:18,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:46:18,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-15 21:46:18,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:18,999 INFO L225 Difference]: With dead ends: 149 [2023-02-15 21:46:18,999 INFO L226 Difference]: Without dead ends: 149 [2023-02-15 21:46:18,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:46:19,000 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 17 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:19,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 290 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:46:19,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-02-15 21:46:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2023-02-15 21:46:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.471698113207547) internal successors, (156), 120 states have internal predecessors, (156), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 21:46:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2023-02-15 21:46:19,005 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 24 [2023-02-15 21:46:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:19,006 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2023-02-15 21:46:19,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2023-02-15 21:46:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 21:46:19,010 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:19,011 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:19,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 21:46:19,011 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:19,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash 295352039, now seen corresponding path program 1 times [2023-02-15 21:46:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:19,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128070959] [2023-02-15 21:46:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:19,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:19,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:19,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:19,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:19,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128070959] [2023-02-15 21:46:19,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128070959] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:46:19,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109086892] [2023-02-15 21:46:19,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:19,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:46:19,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:46:19,244 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) [2023-02-15 21:46:19,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 21:46:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:19,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 21:46:19,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:19,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:46:19,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-15 21:46:19,350 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 21:46:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:19,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:19,765 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:46:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:19,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109086892] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:19,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:46:19,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2023-02-15 21:46:19,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835598459] [2023-02-15 21:46:19,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:19,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 21:46:19,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:19,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 21:46:19,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-02-15 21:46:19,876 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 21:46:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:20,628 INFO L93 Difference]: Finished difference Result 299 states and 394 transitions. [2023-02-15 21:46:20,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 21:46:20,629 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2023-02-15 21:46:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:20,630 INFO L225 Difference]: With dead ends: 299 [2023-02-15 21:46:20,630 INFO L226 Difference]: Without dead ends: 299 [2023-02-15 21:46:20,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2023-02-15 21:46:20,631 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 410 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:20,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 818 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 21:46:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-02-15 21:46:20,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 125. [2023-02-15 21:46:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.4752475247524752) internal successors, (149), 114 states have internal predecessors, (149), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 21:46:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 167 transitions. [2023-02-15 21:46:20,635 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 167 transitions. Word has length 23 [2023-02-15 21:46:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:20,636 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 167 transitions. [2023-02-15 21:46:20,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 21:46:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2023-02-15 21:46:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 21:46:20,636 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:20,636 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] [2023-02-15 21:46:20,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 21:46:20,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:46:20,841 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:20,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:20,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1536082760, now seen corresponding path program 1 times [2023-02-15 21:46:20,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:20,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111966097] [2023-02-15 21:46:20,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:20,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:21,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:21,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:21,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:21,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111966097] [2023-02-15 21:46:21,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111966097] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:46:21,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187774124] [2023-02-15 21:46:21,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:21,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:46:21,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:46:21,057 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) [2023-02-15 21:46:21,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 21:46:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:21,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 21:46:21,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:46:21,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:46:21,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187774124] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:21,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 21:46:21,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2023-02-15 21:46:21,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307594133] [2023-02-15 21:46:21,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:21,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:46:21,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:21,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:46:21,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-15 21:46:21,136 INFO L87 Difference]: Start difference. First operand 125 states and 167 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:21,206 INFO L93 Difference]: Finished difference Result 127 states and 160 transitions. [2023-02-15 21:46:21,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:46:21,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-15 21:46:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:21,207 INFO L225 Difference]: With dead ends: 127 [2023-02-15 21:46:21,207 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 21:46:21,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:46:21,208 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 70 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:21,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 349 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:46:21,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 21:46:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 114. [2023-02-15 21:46:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 103 states have internal predecessors, (128), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 21:46:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 146 transitions. [2023-02-15 21:46:21,211 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 146 transitions. Word has length 24 [2023-02-15 21:46:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:21,211 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 146 transitions. [2023-02-15 21:46:21,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2023-02-15 21:46:21,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 21:46:21,212 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:21,212 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] [2023-02-15 21:46:21,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:21,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:46:21,417 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:21,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:21,417 INFO L85 PathProgramCache]: Analyzing trace with hash 938576587, now seen corresponding path program 1 times [2023-02-15 21:46:21,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:21,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568741583] [2023-02-15 21:46:21,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:21,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:21,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:21,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:21,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568741583] [2023-02-15 21:46:21,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568741583] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:21,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:21,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:46:21,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087877883] [2023-02-15 21:46:21,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:21,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:46:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:21,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:46:21,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:46:21,478 INFO L87 Difference]: Start difference. First operand 114 states and 146 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:21,538 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2023-02-15 21:46:21,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:46:21,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-02-15 21:46:21,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:21,540 INFO L225 Difference]: With dead ends: 127 [2023-02-15 21:46:21,540 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 21:46:21,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:46:21,540 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 46 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:21,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 433 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:46:21,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 21:46:21,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2023-02-15 21:46:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 106 states have internal predecessors, (131), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 21:46:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2023-02-15 21:46:21,543 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 26 [2023-02-15 21:46:21,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:21,544 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2023-02-15 21:46:21,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:21,544 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2023-02-15 21:46:21,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 21:46:21,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:21,544 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] [2023-02-15 21:46:21,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 21:46:21,545 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:21,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:21,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1223684762, now seen corresponding path program 1 times [2023-02-15 21:46:21,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:21,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800701767] [2023-02-15 21:46:21,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:21,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:21,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:21,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:21,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:21,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800701767] [2023-02-15 21:46:21,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800701767] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:46:21,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568757774] [2023-02-15 21:46:21,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:21,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:46:21,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:46:21,682 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) [2023-02-15 21:46:21,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 21:46:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:21,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 21:46:21,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:21,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:22,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568757774] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:22,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:46:22,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 19 [2023-02-15 21:46:22,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716859922] [2023-02-15 21:46:22,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:22,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 21:46:22,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:22,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 21:46:22,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2023-02-15 21:46:22,011 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:22,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:22,976 INFO L93 Difference]: Finished difference Result 405 states and 496 transitions. [2023-02-15 21:46:22,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 21:46:22,984 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2023-02-15 21:46:22,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:22,985 INFO L225 Difference]: With dead ends: 405 [2023-02-15 21:46:22,985 INFO L226 Difference]: Without dead ends: 405 [2023-02-15 21:46:22,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 21:46:22,986 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 1063 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:22,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 1315 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 21:46:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2023-02-15 21:46:22,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 174. [2023-02-15 21:46:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 147 states have (on average 1.4217687074829932) internal successors, (209), 160 states have internal predecessors, (209), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 21:46:22,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 231 transitions. [2023-02-15 21:46:22,995 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 231 transitions. Word has length 27 [2023-02-15 21:46:22,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:22,996 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 231 transitions. [2023-02-15 21:46:22,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:22,996 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 231 transitions. [2023-02-15 21:46:22,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 21:46:22,996 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:22,996 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] [2023-02-15 21:46:23,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 21:46:23,201 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,SelfDestructingSolverStorable13 [2023-02-15 21:46:23,202 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:23,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:23,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2020711139, now seen corresponding path program 1 times [2023-02-15 21:46:23,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:23,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860567951] [2023-02-15 21:46:23,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:23,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:23,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:23,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:23,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:23,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860567951] [2023-02-15 21:46:23,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860567951] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:23,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:23,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:46:23,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408104180] [2023-02-15 21:46:23,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:23,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:46:23,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:23,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:46:23,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:46:23,251 INFO L87 Difference]: Start difference. First operand 174 states and 231 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:23,261 INFO L93 Difference]: Finished difference Result 174 states and 224 transitions. [2023-02-15 21:46:23,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:46:23,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-02-15 21:46:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:23,262 INFO L225 Difference]: With dead ends: 174 [2023-02-15 21:46:23,262 INFO L226 Difference]: Without dead ends: 174 [2023-02-15 21:46:23,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:46:23,263 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 32 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:23,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 256 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:46:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-15 21:46:23,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2023-02-15 21:46:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 142 states have (on average 1.3943661971830985) internal successors, (198), 155 states have internal predecessors, (198), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 21:46:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 220 transitions. [2023-02-15 21:46:23,267 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 220 transitions. Word has length 29 [2023-02-15 21:46:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:23,267 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 220 transitions. [2023-02-15 21:46:23,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 220 transitions. [2023-02-15 21:46:23,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 21:46:23,268 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:23,268 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] [2023-02-15 21:46:23,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 21:46:23,268 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2065321045, now seen corresponding path program 1 times [2023-02-15 21:46:23,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:23,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886747345] [2023-02-15 21:46:23,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:23,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:23,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:46:23,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:23,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886747345] [2023-02-15 21:46:23,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886747345] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:46:23,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037121132] [2023-02-15 21:46:23,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:23,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:46:23,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:46:23,365 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) [2023-02-15 21:46:23,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 21:46:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:23,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 21:46:23,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:23,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:46:23,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:23,523 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 19 [2023-02-15 21:46:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:46:23,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037121132] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:23,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:46:23,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-02-15 21:46:23,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589437206] [2023-02-15 21:46:23,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:23,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 21:46:23,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:23,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 21:46:23,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:46:23,540 INFO L87 Difference]: Start difference. First operand 169 states and 220 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:23,754 INFO L93 Difference]: Finished difference Result 273 states and 359 transitions. [2023-02-15 21:46:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 21:46:23,754 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-02-15 21:46:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:23,755 INFO L225 Difference]: With dead ends: 273 [2023-02-15 21:46:23,755 INFO L226 Difference]: Without dead ends: 273 [2023-02-15 21:46:23,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2023-02-15 21:46:23,756 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 563 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:23,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 454 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:46:23,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-15 21:46:23,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 175. [2023-02-15 21:46:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 148 states have (on average 1.3986486486486487) internal successors, (207), 161 states have internal predecessors, (207), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 21:46:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 229 transitions. [2023-02-15 21:46:23,759 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 229 transitions. Word has length 28 [2023-02-15 21:46:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:23,760 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 229 transitions. [2023-02-15 21:46:23,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 229 transitions. [2023-02-15 21:46:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 21:46:23,760 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:23,760 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] [2023-02-15 21:46:23,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 21:46:23,965 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,SelfDestructingSolverStorable15 [2023-02-15 21:46:23,965 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:23,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:23,965 INFO L85 PathProgramCache]: Analyzing trace with hash 143992616, now seen corresponding path program 1 times [2023-02-15 21:46:23,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:23,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254394531] [2023-02-15 21:46:23,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:23,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:24,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:24,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:24,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:24,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254394531] [2023-02-15 21:46:24,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254394531] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:46:24,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645058287] [2023-02-15 21:46:24,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:24,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:46:24,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:46:24,151 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) [2023-02-15 21:46:24,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 21:46:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:24,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 21:46:24,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:46:24,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:46:24,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645058287] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:24,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 21:46:24,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2023-02-15 21:46:24,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081256807] [2023-02-15 21:46:24,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:24,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:46:24,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:24,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:46:24,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:46:24,282 INFO L87 Difference]: Start difference. First operand 175 states and 229 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:24,354 INFO L93 Difference]: Finished difference Result 188 states and 240 transitions. [2023-02-15 21:46:24,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:46:24,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-15 21:46:24,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:24,355 INFO L225 Difference]: With dead ends: 188 [2023-02-15 21:46:24,355 INFO L226 Difference]: Without dead ends: 188 [2023-02-15 21:46:24,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:46:24,356 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 125 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:24,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 286 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:46:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-15 21:46:24,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 173. [2023-02-15 21:46:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 145 states have (on average 1.3517241379310345) internal successors, (196), 158 states have internal predecessors, (196), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 21:46:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 218 transitions. [2023-02-15 21:46:24,359 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 218 transitions. Word has length 30 [2023-02-15 21:46:24,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:24,359 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 218 transitions. [2023-02-15 21:46:24,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 218 transitions. [2023-02-15 21:46:24,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 21:46:24,360 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:24,360 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] [2023-02-15 21:46:24,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:24,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:46:24,564 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:24,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:24,565 INFO L85 PathProgramCache]: Analyzing trace with hash -399557048, now seen corresponding path program 1 times [2023-02-15 21:46:24,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:24,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324350330] [2023-02-15 21:46:24,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:24,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:24,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:24,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:46:24,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:24,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324350330] [2023-02-15 21:46:24,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324350330] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:24,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:24,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:46:24,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560143755] [2023-02-15 21:46:24,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:24,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:46:24,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:24,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:46:24,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:46:24,598 INFO L87 Difference]: Start difference. First operand 173 states and 218 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:24,631 INFO L93 Difference]: Finished difference Result 172 states and 216 transitions. [2023-02-15 21:46:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:46:24,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-02-15 21:46:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:24,632 INFO L225 Difference]: With dead ends: 172 [2023-02-15 21:46:24,632 INFO L226 Difference]: Without dead ends: 172 [2023-02-15 21:46:24,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:46:24,633 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 127 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:24,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 112 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:46:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-02-15 21:46:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2023-02-15 21:46:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 157 states have internal predecessors, (194), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 21:46:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 216 transitions. [2023-02-15 21:46:24,636 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 216 transitions. Word has length 29 [2023-02-15 21:46:24,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:24,637 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 216 transitions. [2023-02-15 21:46:24,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:24,637 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 216 transitions. [2023-02-15 21:46:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 21:46:24,637 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:24,637 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] [2023-02-15 21:46:24,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 21:46:24,638 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:24,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:24,638 INFO L85 PathProgramCache]: Analyzing trace with hash -399557047, now seen corresponding path program 1 times [2023-02-15 21:46:24,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:24,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178628540] [2023-02-15 21:46:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:24,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:24,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 21:46:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:24,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 21:46:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:46:24,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:46:24,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178628540] [2023-02-15 21:46:24,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178628540] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:46:24,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647776] [2023-02-15 21:46:24,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:24,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:46:24,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:46:24,775 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) [2023-02-15 21:46:24,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 21:46:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:24,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 21:46:24,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:24,841 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:46:24,842 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-02-15 21:46:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:46:24,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:46:24,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647776] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 21:46:24,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:46:24,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2023-02-15 21:46:24,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027330437] [2023-02-15 21:46:24,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:24,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 21:46:24,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:46:24,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 21:46:24,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2023-02-15 21:46:24,984 INFO L87 Difference]: Start difference. First operand 172 states and 216 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:25,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:25,129 INFO L93 Difference]: Finished difference Result 248 states and 311 transitions. [2023-02-15 21:46:25,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:46:25,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-02-15 21:46:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:25,131 INFO L225 Difference]: With dead ends: 248 [2023-02-15 21:46:25,131 INFO L226 Difference]: Without dead ends: 248 [2023-02-15 21:46:25,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2023-02-15 21:46:25,131 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 470 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:25,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 260 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:46:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-02-15 21:46:25,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 174. [2023-02-15 21:46:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 159 states have internal predecessors, (196), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 21:46:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 218 transitions. [2023-02-15 21:46:25,135 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 218 transitions. Word has length 29 [2023-02-15 21:46:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:25,135 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 218 transitions. [2023-02-15 21:46:25,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 218 transitions. [2023-02-15 21:46:25,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 21:46:25,135 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:25,135 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:25,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:25,337 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 [2023-02-15 21:46:25,337 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:25,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:25,338 INFO L85 PathProgramCache]: Analyzing trace with hash -85984087, now seen corresponding path program 2 times [2023-02-15 21:46:25,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:46:25,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825029019] [2023-02-15 21:46:25,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:25,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:46:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 21:46:25,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 21:46:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 21:46:25,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 21:46:25,381 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 21:46:25,381 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-02-15 21:46:25,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-02-15 21:46:25,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-02-15 21:46:25,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-02-15 21:46:25,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-02-15 21:46:25,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-02-15 21:46:25,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-02-15 21:46:25,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-02-15 21:46:25,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-02-15 21:46:25,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-02-15 21:46:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-02-15 21:46:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-02-15 21:46:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-02-15 21:46:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-02-15 21:46:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-02-15 21:46:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-02-15 21:46:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-02-15 21:46:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2023-02-15 21:46:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2023-02-15 21:46:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2023-02-15 21:46:25,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-02-15 21:46:25,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-02-15 21:46:25,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-02-15 21:46:25,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-02-15 21:46:25,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-02-15 21:46:25,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 26 remaining) [2023-02-15 21:46:25,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 21:46:25,391 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:25,393 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 21:46:25,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 09:46:25 BoogieIcfgContainer [2023-02-15 21:46:25,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 21:46:25,419 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 21:46:25,419 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 21:46:25,421 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 21:46:25,421 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:46:13" (3/4) ... [2023-02-15 21:46:25,423 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 21:46:25,423 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 21:46:25,424 INFO L158 Benchmark]: Toolchain (without parser) took 12880.59ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 100.2MB in the beginning and 115.9MB in the end (delta: -15.7MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2023-02-15 21:46:25,424 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:46:25,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.25ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 104.1MB in the end (delta: -4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 21:46:25,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.72ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 101.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 21:46:25,424 INFO L158 Benchmark]: Boogie Preprocessor took 37.12ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 21:46:25,424 INFO L158 Benchmark]: RCFGBuilder took 458.75ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 79.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-15 21:46:25,425 INFO L158 Benchmark]: TraceAbstraction took 12001.22ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 78.4MB in the beginning and 116.9MB in the end (delta: -38.6MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2023-02-15 21:46:25,425 INFO L158 Benchmark]: Witness Printer took 4.08ms. Allocated memory is still 209.7MB. Free memory was 116.9MB in the beginning and 115.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:46:25,425 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.25ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 104.1MB in the end (delta: -4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.72ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 101.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.12ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 458.75ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 79.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12001.22ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 78.4MB in the beginning and 116.9MB in the end (delta: -38.6MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * Witness Printer took 4.08ms. Allocated memory is still 209.7MB. Free memory was 116.9MB in the beginning and 115.9MB in the end (delta: 1.0MB). There was no memory consumed. 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 - UnprovableResult [Line: 1128]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1128. Possible FailurePath: [L1130] unsigned long pat_len = __VERIFIER_nondet_ulong(), a_len = __VERIFIER_nondet_ulong(); [L1130] unsigned long pat_len = __VERIFIER_nondet_ulong(), a_len = __VERIFIER_nondet_ulong(); [L1132] CALL assume_abort_if_not(pat_len < 4294967296 / sizeof(int)) VAL [\old(cond)=1] [L5] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L1132] RET assume_abort_if_not(pat_len < 4294967296 / sizeof(int)) VAL [pat_len=-4294967294] [L1133] CALL assume_abort_if_not(a_len < 4294967296 / sizeof(int)) VAL [\old(cond)=1] [L5] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L1133] RET assume_abort_if_not(a_len < 4294967296 / sizeof(int)) VAL [a_len=0, pat_len=-4294967294] [L1134] int *pat=malloc(sizeof(int)*pat_len); [L1135] int *a=malloc(sizeof(int)*a_len); [L1139] int j = 0; VAL [a={-1:0}, a_len=0, j=0, pat={-2:0}, pat_len=-4294967294] [L1139] COND TRUE j < pat_len [L1140] pat[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=3, a={-1:0}, a_len=0, j=0, pat={-2:0}, pat_len=-4294967294] [L1139] j++ VAL [a={-1:0}, a_len=0, j=1, pat={-2:0}, pat_len=-4294967294] [L1139] COND TRUE j < pat_len [L1140] pat[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-3, a={-1:0}, a_len=0, j=1, pat={-2:0}, pat_len=-4294967294] [L1139] j++ VAL [a={-1:0}, a_len=0, j=2, pat={-2:0}, pat_len=-4294967294] [L1139] COND FALSE !(j < pat_len) VAL [a={-1:0}, a_len=0, j=2, pat={-2:0}, pat_len=-4294967294] [L1142] int j = 0; VAL [a={-1:0}, a_len=0, j=0, j=2, pat={-2:0}, pat_len=-4294967294] [L1142] COND FALSE !(j < a_len) VAL [a={-1:0}, a_len=0, j=2, j=0, pat={-2:0}, pat_len=-4294967294] [L1147] CALL is_relaxed_prefix(pat, pat_len, a, a_len) [L1106] COND TRUE pat_length>a_length+1 [L1107] return 0; VAL [\old(a_length)=0, \old(pat_length)=2, \result=0, a={-1:0}, a={-1:0}, a_length=0, pat={-2:0}, pat={-2:0}, pat_length=2] [L1147] RET is_relaxed_prefix(pat, pat_len, a, a_len) [L1147] COND FALSE !(is_relaxed_prefix(pat, pat_len, a, a_len)) [L1163] COND FALSE !(pat_len<=a_len+1) VAL [a={-1:0}, a_len=0, j=2, j=0, pat={-2:0}, pat_len=-4294967294] [L1176] return 0; VAL [\result=0, a={-1:0}, a_len=0, j=0, j=2, pat={-2:0}, pat_len=-4294967294] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 93 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4792 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4754 mSDsluCounter, 7043 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5255 mSDsCounter, 458 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3813 IncrementalHoareTripleChecker+Invalid, 4271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 458 mSolverCounterUnsat, 1788 mSDtfsCounter, 3813 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 367 SyntacticMatches, 18 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=16, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 887 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 660 NumberOfCodeBlocks, 660 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 739 ConstructedInterpolants, 1 QuantifiedInterpolants, 5247 SizeOfPredicates, 50 NumberOfNonLiveVariables, 885 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 33 InterpolantComputations, 14 PerfectInterpolantSequences, 125/183 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-15 21:46:25,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-examples/relax-2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 21:46:27,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:46:27,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:46:27,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:46:27,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:46:27,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:46:27,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:46:27,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:46:27,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:46:27,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:46:27,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:46:27,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:46:27,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:46:27,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:46:27,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:46:27,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:46:27,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:46:27,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:46:27,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:46:27,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:46:27,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:46:27,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:46:27,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:46:27,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:46:27,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:46:27,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:46:27,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:46:27,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:46:27,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:46:27,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:46:27,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:46:27,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:46:27,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:46:27,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:46:27,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:46:27,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:46:27,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:46:27,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:46:27,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:46:27,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:46:27,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:46:27,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 21:46:27,254 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:46:27,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:46:27,255 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:46:27,255 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:46:27,256 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:46:27,256 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:46:27,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:46:27,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:46:27,257 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:46:27,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:46:27,258 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:46:27,258 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 21:46:27,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:46:27,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:46:27,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:46:27,258 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 21:46:27,258 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 21:46:27,258 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 21:46:27,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:46:27,258 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 21:46:27,259 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 21:46:27,259 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 21:46:27,259 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:46:27,259 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:46:27,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:46:27,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:46:27,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:46:27,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:46:27,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:46:27,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:46:27,260 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 21:46:27,260 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 21:46:27,260 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:46:27,260 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:46:27,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:46:27,260 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 21:46:27,260 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:46:27,261 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef [2023-02-15 21:46:27,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:46:27,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:46:27,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:46:27,567 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:46:27,568 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:46:27,569 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/relax-2-2.i [2023-02-15 21:46:28,621 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:46:28,840 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:46:28,840 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i [2023-02-15 21:46:28,850 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392c8b7bf/2ed6bf9f967a4f249c5491d35621f6fe/FLAG328e866cd [2023-02-15 21:46:28,859 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392c8b7bf/2ed6bf9f967a4f249c5491d35621f6fe [2023-02-15 21:46:28,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:46:28,862 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:46:28,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:46:28,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:46:28,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:46:28,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:46:28" (1/1) ... [2023-02-15 21:46:28,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a70bd83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:28, skipping insertion in model container [2023-02-15 21:46:28,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:46:28" (1/1) ... [2023-02-15 21:46:28,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:46:28,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:46:29,030 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i[982,995] [2023-02-15 21:46:29,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:46:29,135 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 21:46:29,144 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i[982,995] [2023-02-15 21:46:29,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:46:29,215 INFO L208 MainTranslator]: Completed translation [2023-02-15 21:46:29,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:29 WrapperNode [2023-02-15 21:46:29,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:46:29,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 21:46:29,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 21:46:29,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 21:46:29,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:29" (1/1) ... [2023-02-15 21:46:29,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:29" (1/1) ... [2023-02-15 21:46:29,264 INFO L138 Inliner]: procedures = 123, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 136 [2023-02-15 21:46:29,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 21:46:29,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 21:46:29,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 21:46:29,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 21:46:29,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:29" (1/1) ... [2023-02-15 21:46:29,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:29" (1/1) ... [2023-02-15 21:46:29,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:29" (1/1) ... [2023-02-15 21:46:29,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:29" (1/1) ... [2023-02-15 21:46:29,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:29" (1/1) ... [2023-02-15 21:46:29,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:29" (1/1) ... [2023-02-15 21:46:29,291 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:29" (1/1) ... [2023-02-15 21:46:29,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:29" (1/1) ... [2023-02-15 21:46:29,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 21:46:29,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 21:46:29,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 21:46:29,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 21:46:29,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:29" (1/1) ... [2023-02-15 21:46:29,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:46:29,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:46:29,334 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) [2023-02-15 21:46:29,344 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 [2023-02-15 21:46:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 21:46:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 21:46:29,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 21:46:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-15 21:46:29,363 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-15 21:46:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 21:46:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 21:46:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 21:46:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 21:46:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 21:46:29,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 21:46:29,500 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 21:46:29,501 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 21:46:29,813 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 21:46:29,818 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 21:46:29,818 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 21:46:29,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:46:29 BoogieIcfgContainer [2023-02-15 21:46:29,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 21:46:29,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 21:46:29,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 21:46:29,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 21:46:29,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 09:46:28" (1/3) ... [2023-02-15 21:46:29,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499e36ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:46:29, skipping insertion in model container [2023-02-15 21:46:29,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:46:29" (2/3) ... [2023-02-15 21:46:29,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499e36ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:46:29, skipping insertion in model container [2023-02-15 21:46:29,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:46:29" (3/3) ... [2023-02-15 21:46:29,825 INFO L112 eAbstractionObserver]: Analyzing ICFG relax-2-2.i [2023-02-15 21:46:29,836 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 21:46:29,837 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-02-15 21:46:29,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 21:46:29,877 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7097bda, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 21:46:29,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-02-15 21:46:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 84 states have internal predecessors, (107), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:46:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 21:46:29,886 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:29,886 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:29,886 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:29,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:29,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1952693727, now seen corresponding path program 1 times [2023-02-15 21:46:29,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:29,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574921740] [2023-02-15 21:46:29,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:29,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:29,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:29,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:29,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 21:46:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:29,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 21:46:29,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 21:46:30,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:46:30,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:30,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574921740] [2023-02-15 21:46:30,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574921740] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:30,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:30,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:46:30,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453593903] [2023-02-15 21:46:30,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:30,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 21:46:30,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:30,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 21:46:30,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 21:46:30,071 INFO L87 Difference]: Start difference. First operand has 93 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 84 states have internal predecessors, (107), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 21:46:30,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:30,094 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2023-02-15 21:46:30,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 21:46:30,096 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2023-02-15 21:46:30,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:30,103 INFO L225 Difference]: With dead ends: 93 [2023-02-15 21:46:30,103 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 21:46:30,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 21:46:30,108 INFO L413 NwaCegarLoop]: 114 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, 114 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 [2023-02-15 21:46:30,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:46:30,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 21:46:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-15 21:46:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.75) internal successors, (98), 82 states have internal predecessors, (98), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:46:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2023-02-15 21:46:30,149 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 15 [2023-02-15 21:46:30,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:30,149 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2023-02-15 21:46:30,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 21:46:30,149 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2023-02-15 21:46:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 21:46:30,151 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:30,151 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:30,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 21:46:30,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:30,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:30,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:30,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1194370847, now seen corresponding path program 1 times [2023-02-15 21:46:30,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:30,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516928686] [2023-02-15 21:46:30,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:30,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:30,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:30,360 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:30,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 21:46:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:30,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 21:46:30,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:30,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:46:30,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2023-02-15 21:46:30,537 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 21:46:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:30,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:30,762 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:46:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:30,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:30,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516928686] [2023-02-15 21:46:30,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516928686] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:30,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:46:30,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 21:46:30,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584777993] [2023-02-15 21:46:30,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:30,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 21:46:30,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:30,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 21:46:30,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-02-15 21:46:30,893 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 21:46:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:31,905 INFO L93 Difference]: Finished difference Result 177 states and 223 transitions. [2023-02-15 21:46:31,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:46:31,906 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2023-02-15 21:46:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:31,908 INFO L225 Difference]: With dead ends: 177 [2023-02-15 21:46:31,908 INFO L226 Difference]: Without dead ends: 177 [2023-02-15 21:46:31,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-02-15 21:46:31,909 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 362 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:31,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 331 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 21:46:31,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-15 21:46:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2023-02-15 21:46:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 88 states have internal predecessors, (108), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:46:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 122 transitions. [2023-02-15 21:46:31,917 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 122 transitions. Word has length 15 [2023-02-15 21:46:31,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:31,918 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 122 transitions. [2023-02-15 21:46:31,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 21:46:31,918 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2023-02-15 21:46:31,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 21:46:31,918 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:31,918 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:31,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:32,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:32,125 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:32,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1194370848, now seen corresponding path program 1 times [2023-02-15 21:46:32,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:32,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530728066] [2023-02-15 21:46:32,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:32,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:32,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:32,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:32,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 21:46:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:32,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 21:46:32,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:32,236 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 21:46:32,236 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-02-15 21:46:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:32,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:46:32,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:32,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530728066] [2023-02-15 21:46:32,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530728066] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:32,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:32,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:46:32,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930658169] [2023-02-15 21:46:32,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:32,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:46:32,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:32,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:46:32,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:46:32,248 INFO L87 Difference]: Start difference. First operand 97 states and 122 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:32,328 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2023-02-15 21:46:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:46:32,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2023-02-15 21:46:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:32,329 INFO L225 Difference]: With dead ends: 92 [2023-02-15 21:46:32,329 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 21:46:32,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:46:32,330 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 81 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:32,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 93 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:46:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 21:46:32,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-02-15 21:46:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.6290322580645162) internal successors, (101), 83 states have internal predecessors, (101), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:46:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2023-02-15 21:46:32,341 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 15 [2023-02-15 21:46:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:32,341 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2023-02-15 21:46:32,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2023-02-15 21:46:32,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 21:46:32,345 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:32,345 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:32,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:32,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:32,551 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:32,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:32,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1034167796, now seen corresponding path program 1 times [2023-02-15 21:46:32,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:32,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035474342] [2023-02-15 21:46:32,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:32,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:32,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:32,553 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:32,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 21:46:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:32,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 21:46:32,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:32,609 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 21:46:32,609 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 9 treesize of output 19 [2023-02-15 21:46:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:32,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:46:32,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:32,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035474342] [2023-02-15 21:46:32,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035474342] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:32,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:32,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:46:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005664940] [2023-02-15 21:46:32,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:32,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:46:32,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:32,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:46:32,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:46:32,619 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:32,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:32,694 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2023-02-15 21:46:32,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:46:32,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-02-15 21:46:32,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:32,696 INFO L225 Difference]: With dead ends: 87 [2023-02-15 21:46:32,696 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 21:46:32,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:46:32,696 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:32,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 93 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:46:32,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 21:46:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-15 21:46:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 78 states have internal predecessors, (96), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:46:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2023-02-15 21:46:32,702 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 17 [2023-02-15 21:46:32,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:32,702 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2023-02-15 21:46:32,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:32,702 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2023-02-15 21:46:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 21:46:32,702 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:32,702 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:32,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:32,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:32,905 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:32,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:32,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1034167795, now seen corresponding path program 1 times [2023-02-15 21:46:32,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:32,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671576074] [2023-02-15 21:46:32,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:32,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:32,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:32,907 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:32,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 21:46:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:32,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 21:46:32,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:32,988 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-02-15 21:46:32,988 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 11 treesize of output 17 [2023-02-15 21:46:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:33,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:46:33,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:33,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671576074] [2023-02-15 21:46:33,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671576074] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:33,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:33,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:46:33,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130613317] [2023-02-15 21:46:33,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:33,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:46:33,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:33,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:46:33,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:46:33,080 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:33,636 INFO L93 Difference]: Finished difference Result 153 states and 199 transitions. [2023-02-15 21:46:33,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 21:46:33,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-02-15 21:46:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:33,639 INFO L225 Difference]: With dead ends: 153 [2023-02-15 21:46:33,639 INFO L226 Difference]: Without dead ends: 153 [2023-02-15 21:46:33,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-15 21:46:33,643 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 251 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:33,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 288 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 21:46:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-15 21:46:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 89. [2023-02-15 21:46:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.546875) internal successors, (99), 80 states have internal predecessors, (99), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:46:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2023-02-15 21:46:33,651 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 17 [2023-02-15 21:46:33,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:33,651 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2023-02-15 21:46:33,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2023-02-15 21:46:33,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 21:46:33,652 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:33,653 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:33,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:33,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:33,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:33,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:33,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1093959206, now seen corresponding path program 1 times [2023-02-15 21:46:33,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:33,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149261536] [2023-02-15 21:46:33,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:33,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:33,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:33,860 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:33,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 21:46:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:33,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 21:46:33,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:33,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:46:33,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:33,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149261536] [2023-02-15 21:46:33,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149261536] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:33,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:33,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 21:46:33,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979373592] [2023-02-15 21:46:33,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:33,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:46:33,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:33,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:46:33,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:46:33,964 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:34,128 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2023-02-15 21:46:34,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 21:46:34,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-02-15 21:46:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:34,130 INFO L225 Difference]: With dead ends: 109 [2023-02-15 21:46:34,130 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 21:46:34,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-15 21:46:34,130 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 143 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:34,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 442 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:46:34,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 21:46:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2023-02-15 21:46:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.5263157894736843) internal successors, (116), 92 states have internal predecessors, (116), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-15 21:46:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions. [2023-02-15 21:46:34,136 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 20 [2023-02-15 21:46:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:34,136 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 132 transitions. [2023-02-15 21:46:34,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:34,137 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions. [2023-02-15 21:46:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 21:46:34,137 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:34,137 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:34,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:34,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:34,341 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:34,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:34,341 INFO L85 PathProgramCache]: Analyzing trace with hash 495604816, now seen corresponding path program 1 times [2023-02-15 21:46:34,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:34,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573635548] [2023-02-15 21:46:34,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:34,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:34,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:34,343 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:34,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 21:46:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:34,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 21:46:34,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:34,422 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-02-15 21:46:34,423 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 11 treesize of output 17 [2023-02-15 21:46:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:34,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:35,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:35,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573635548] [2023-02-15 21:46:35,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573635548] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:35,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:46:35,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-02-15 21:46:35,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843218987] [2023-02-15 21:46:35,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:35,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 21:46:35,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:35,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 21:46:35,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-02-15 21:46:35,177 INFO L87 Difference]: Start difference. First operand 102 states and 132 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 21:46:35,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:35,923 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2023-02-15 21:46:35,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 21:46:35,924 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2023-02-15 21:46:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:35,925 INFO L225 Difference]: With dead ends: 167 [2023-02-15 21:46:35,925 INFO L226 Difference]: Without dead ends: 167 [2023-02-15 21:46:35,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2023-02-15 21:46:35,925 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 418 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:35,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 396 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 21:46:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-15 21:46:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 100. [2023-02-15 21:46:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.52) internal successors, (114), 90 states have internal predecessors, (114), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-15 21:46:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2023-02-15 21:46:35,929 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 21 [2023-02-15 21:46:35,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:35,929 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2023-02-15 21:46:35,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 21:46:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2023-02-15 21:46:35,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 21:46:35,930 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:35,930 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] [2023-02-15 21:46:35,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:36,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:36,136 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:36,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:36,137 INFO L85 PathProgramCache]: Analyzing trace with hash 45614243, now seen corresponding path program 1 times [2023-02-15 21:46:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:36,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394470789] [2023-02-15 21:46:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:36,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:36,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:36,139 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:36,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 21:46:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:36,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 21:46:36,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:36,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:46:36,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:36,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394470789] [2023-02-15 21:46:36,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394470789] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:36,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:36,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 21:46:36,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036224753] [2023-02-15 21:46:36,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:36,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 21:46:36,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:36,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 21:46:36,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:46:36,268 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 21:46:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:36,479 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2023-02-15 21:46:36,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:46:36,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-02-15 21:46:36,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:36,481 INFO L225 Difference]: With dead ends: 137 [2023-02-15 21:46:36,481 INFO L226 Difference]: Without dead ends: 137 [2023-02-15 21:46:36,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:46:36,482 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 217 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:36,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 448 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:46:36,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-15 21:46:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2023-02-15 21:46:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.4505494505494505) internal successors, (132), 106 states have internal predecessors, (132), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 21:46:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 150 transitions. [2023-02-15 21:46:36,486 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 150 transitions. Word has length 23 [2023-02-15 21:46:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:36,486 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 150 transitions. [2023-02-15 21:46:36,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 21:46:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 150 transitions. [2023-02-15 21:46:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 21:46:36,486 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:36,486 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:36,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:36,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:36,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:36,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash 295352039, now seen corresponding path program 1 times [2023-02-15 21:46:36,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:36,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551206008] [2023-02-15 21:46:36,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:36,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:36,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:36,695 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:36,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 21:46:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:36,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 21:46:36,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:36,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:46:36,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2023-02-15 21:46:36,789 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 21:46:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:37,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:37,549 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:46:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:37,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:37,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551206008] [2023-02-15 21:46:37,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551206008] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:37,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:46:37,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-02-15 21:46:37,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396580730] [2023-02-15 21:46:37,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:37,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 21:46:37,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:37,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 21:46:37,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-02-15 21:46:37,709 INFO L87 Difference]: Start difference. First operand 117 states and 150 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 21:46:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:40,873 INFO L93 Difference]: Finished difference Result 435 states and 580 transitions. [2023-02-15 21:46:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 21:46:40,875 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2023-02-15 21:46:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:40,876 INFO L225 Difference]: With dead ends: 435 [2023-02-15 21:46:40,876 INFO L226 Difference]: Without dead ends: 435 [2023-02-15 21:46:40,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2023-02-15 21:46:40,877 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 1676 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:40,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 808 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-02-15 21:46:40,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2023-02-15 21:46:40,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 133. [2023-02-15 21:46:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.4205607476635513) internal successors, (152), 122 states have internal predecessors, (152), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 21:46:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 170 transitions. [2023-02-15 21:46:40,899 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 170 transitions. Word has length 23 [2023-02-15 21:46:40,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:40,899 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 170 transitions. [2023-02-15 21:46:40,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 21:46:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 170 transitions. [2023-02-15 21:46:40,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 21:46:40,900 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:40,900 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] [2023-02-15 21:46:40,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-02-15 21:46:41,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:41,105 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:41,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:41,105 INFO L85 PathProgramCache]: Analyzing trace with hash 938576587, now seen corresponding path program 1 times [2023-02-15 21:46:41,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:41,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147730687] [2023-02-15 21:46:41,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:41,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:41,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:41,107 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:41,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 21:46:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:41,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 21:46:41,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:41,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:41,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:41,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147730687] [2023-02-15 21:46:41,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147730687] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 21:46:41,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 21:46:41,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2023-02-15 21:46:41,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768578073] [2023-02-15 21:46:41,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:41,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:46:41,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:41,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:46:41,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:46:41,296 INFO L87 Difference]: Start difference. First operand 133 states and 170 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:41,375 INFO L93 Difference]: Finished difference Result 143 states and 179 transitions. [2023-02-15 21:46:41,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:46:41,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-02-15 21:46:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:41,377 INFO L225 Difference]: With dead ends: 143 [2023-02-15 21:46:41,377 INFO L226 Difference]: Without dead ends: 143 [2023-02-15 21:46:41,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-02-15 21:46:41,377 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 24 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:41,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 425 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:46:41,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-02-15 21:46:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2023-02-15 21:46:41,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 125 states have internal predecessors, (155), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 21:46:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2023-02-15 21:46:41,386 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 26 [2023-02-15 21:46:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:41,386 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2023-02-15 21:46:41,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2023-02-15 21:46:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 21:46:41,387 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:41,387 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] [2023-02-15 21:46:41,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:41,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:41,595 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:41,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:41,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1223684762, now seen corresponding path program 1 times [2023-02-15 21:46:41,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:41,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967623136] [2023-02-15 21:46:41,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:41,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:41,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:41,597 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:41,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 21:46:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:41,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 21:46:41,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:41,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:42,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:42,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967623136] [2023-02-15 21:46:42,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967623136] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:42,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:46:42,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2023-02-15 21:46:42,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703766300] [2023-02-15 21:46:42,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:42,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 21:46:42,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:42,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 21:46:42,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-02-15 21:46:42,074 INFO L87 Difference]: Start difference. First operand 137 states and 173 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 21:46:42,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:42,973 INFO L93 Difference]: Finished difference Result 326 states and 415 transitions. [2023-02-15 21:46:42,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 21:46:42,973 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2023-02-15 21:46:42,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:42,975 INFO L225 Difference]: With dead ends: 326 [2023-02-15 21:46:42,975 INFO L226 Difference]: Without dead ends: 326 [2023-02-15 21:46:42,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2023-02-15 21:46:42,976 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 681 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:42,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 1570 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 21:46:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-02-15 21:46:42,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 162. [2023-02-15 21:46:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 135 states have (on average 1.4296296296296296) internal successors, (193), 150 states have internal predecessors, (193), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 21:46:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 211 transitions. [2023-02-15 21:46:42,981 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 211 transitions. Word has length 27 [2023-02-15 21:46:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:42,981 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 211 transitions. [2023-02-15 21:46:42,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 21:46:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 211 transitions. [2023-02-15 21:46:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 21:46:42,982 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:42,982 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] [2023-02-15 21:46:42,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:43,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:43,189 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:43,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:43,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2020711139, now seen corresponding path program 1 times [2023-02-15 21:46:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:43,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123349221] [2023-02-15 21:46:43,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:43,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:43,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:43,194 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:43,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 21:46:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:43,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 21:46:43,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:43,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:46:43,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:43,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123349221] [2023-02-15 21:46:43,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123349221] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:43,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:43,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:46:43,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185368871] [2023-02-15 21:46:43,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:43,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:46:43,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:43,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:46:43,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:46:43,248 INFO L87 Difference]: Start difference. First operand 162 states and 211 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:43,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:43,260 INFO L93 Difference]: Finished difference Result 202 states and 260 transitions. [2023-02-15 21:46:43,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:46:43,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-02-15 21:46:43,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:43,261 INFO L225 Difference]: With dead ends: 202 [2023-02-15 21:46:43,261 INFO L226 Difference]: Without dead ends: 202 [2023-02-15 21:46:43,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:46:43,262 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 32 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:43,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 307 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:46:43,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-15 21:46:43,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 163. [2023-02-15 21:46:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 136 states have (on average 1.4191176470588236) internal successors, (193), 151 states have internal predecessors, (193), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 21:46:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 211 transitions. [2023-02-15 21:46:43,267 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 211 transitions. Word has length 29 [2023-02-15 21:46:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:43,267 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 211 transitions. [2023-02-15 21:46:43,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 211 transitions. [2023-02-15 21:46:43,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 21:46:43,268 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:43,268 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] [2023-02-15 21:46:43,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-02-15 21:46:43,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:43,471 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:43,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:43,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2065321044, now seen corresponding path program 1 times [2023-02-15 21:46:43,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:43,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896890919] [2023-02-15 21:46:43,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:43,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:43,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:43,473 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:43,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 21:46:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:43,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 21:46:43,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:46:43,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:46:43,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:43,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896890919] [2023-02-15 21:46:43,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896890919] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:43,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:43,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:46:43,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652341817] [2023-02-15 21:46:43,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:43,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:46:43,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:43,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:46:43,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:46:43,558 INFO L87 Difference]: Start difference. First operand 163 states and 211 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:43,658 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2023-02-15 21:46:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:46:43,658 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-02-15 21:46:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:43,659 INFO L225 Difference]: With dead ends: 162 [2023-02-15 21:46:43,659 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 21:46:43,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:46:43,659 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 125 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:43,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 112 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:46:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 21:46:43,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2023-02-15 21:46:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 150 states have internal predecessors, (191), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 21:46:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 209 transitions. [2023-02-15 21:46:43,663 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 209 transitions. Word has length 28 [2023-02-15 21:46:43,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:43,663 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 209 transitions. [2023-02-15 21:46:43,664 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 209 transitions. [2023-02-15 21:46:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 21:46:43,664 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:43,664 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] [2023-02-15 21:46:43,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:43,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:43,873 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:43,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:43,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2065321045, now seen corresponding path program 1 times [2023-02-15 21:46:43,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:43,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499684439] [2023-02-15 21:46:43,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:43,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:43,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:43,875 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:43,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 21:46:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:43,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 21:46:43,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:46:44,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:44,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-02-15 21:46:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:46:44,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:44,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499684439] [2023-02-15 21:46:44,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499684439] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:44,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:46:44,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-02-15 21:46:44,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694145397] [2023-02-15 21:46:44,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:44,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 21:46:44,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:44,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 21:46:44,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-15 21:46:44,246 INFO L87 Difference]: Start difference. First operand 162 states and 209 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:45,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:45,628 INFO L93 Difference]: Finished difference Result 418 states and 541 transitions. [2023-02-15 21:46:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 21:46:45,628 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-02-15 21:46:45,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:45,630 INFO L225 Difference]: With dead ends: 418 [2023-02-15 21:46:45,630 INFO L226 Difference]: Without dead ends: 418 [2023-02-15 21:46:45,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2023-02-15 21:46:45,630 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 830 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:45,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 640 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 21:46:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-02-15 21:46:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 166. [2023-02-15 21:46:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.4071428571428573) internal successors, (197), 154 states have internal predecessors, (197), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 21:46:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 215 transitions. [2023-02-15 21:46:45,636 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 215 transitions. Word has length 28 [2023-02-15 21:46:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:45,637 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 215 transitions. [2023-02-15 21:46:45,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 215 transitions. [2023-02-15 21:46:45,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 21:46:45,638 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:45,638 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] [2023-02-15 21:46:45,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:45,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:45,845 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:45,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:45,845 INFO L85 PathProgramCache]: Analyzing trace with hash 143992616, now seen corresponding path program 1 times [2023-02-15 21:46:45,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:45,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511443942] [2023-02-15 21:46:45,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:45,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:45,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:45,848 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:45,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-15 21:46:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:45,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 21:46:45,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 21:46:46,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:46,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:46,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511443942] [2023-02-15 21:46:46,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511443942] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:46,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:46:46,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-02-15 21:46:46,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663050457] [2023-02-15 21:46:46,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:46,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 21:46:46,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:46,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 21:46:46,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-02-15 21:46:46,384 INFO L87 Difference]: Start difference. First operand 166 states and 215 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 15 states have internal predecessors, (43), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 21:46:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:46,868 INFO L93 Difference]: Finished difference Result 256 states and 320 transitions. [2023-02-15 21:46:46,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 21:46:46,869 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 15 states have internal predecessors, (43), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-02-15 21:46:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:46,871 INFO L225 Difference]: With dead ends: 256 [2023-02-15 21:46:46,871 INFO L226 Difference]: Without dead ends: 256 [2023-02-15 21:46:46,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2023-02-15 21:46:46,871 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 724 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:46,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1045 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 21:46:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-02-15 21:46:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 176. [2023-02-15 21:46:46,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 147 states have (on average 1.3877551020408163) internal successors, (204), 163 states have internal predecessors, (204), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 21:46:46,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 226 transitions. [2023-02-15 21:46:46,875 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 226 transitions. Word has length 30 [2023-02-15 21:46:46,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:46,876 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 226 transitions. [2023-02-15 21:46:46,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 15 states have internal predecessors, (43), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 21:46:46,876 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 226 transitions. [2023-02-15 21:46:46,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 21:46:46,876 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:46,877 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] [2023-02-15 21:46:46,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:47,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:47,083 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:47,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:47,084 INFO L85 PathProgramCache]: Analyzing trace with hash -399557048, now seen corresponding path program 1 times [2023-02-15 21:46:47,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:47,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455126835] [2023-02-15 21:46:47,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:47,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:47,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:47,085 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:47,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 21:46:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:47,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 21:46:47,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:47,150 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 21:46:47,150 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 9 treesize of output 19 [2023-02-15 21:46:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 21:46:47,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:46:47,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:47,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455126835] [2023-02-15 21:46:47,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455126835] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:47,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:47,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:46:47,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18011106] [2023-02-15 21:46:47,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:47,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:46:47,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:47,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:46:47,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:46:47,176 INFO L87 Difference]: Start difference. First operand 176 states and 226 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:47,267 INFO L93 Difference]: Finished difference Result 175 states and 224 transitions. [2023-02-15 21:46:47,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:46:47,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-02-15 21:46:47,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:47,269 INFO L225 Difference]: With dead ends: 175 [2023-02-15 21:46:47,269 INFO L226 Difference]: Without dead ends: 175 [2023-02-15 21:46:47,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:46:47,269 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 121 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:47,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 114 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:46:47,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-15 21:46:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-02-15 21:46:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 147 states have (on average 1.3741496598639455) internal successors, (202), 162 states have internal predecessors, (202), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 21:46:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 224 transitions. [2023-02-15 21:46:47,274 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 224 transitions. Word has length 29 [2023-02-15 21:46:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:47,275 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 224 transitions. [2023-02-15 21:46:47,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 224 transitions. [2023-02-15 21:46:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 21:46:47,276 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:47,276 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] [2023-02-15 21:46:47,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:47,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:47,483 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:47,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash -399557047, now seen corresponding path program 1 times [2023-02-15 21:46:47,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:47,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993448013] [2023-02-15 21:46:47,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:47,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:47,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:47,486 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:47,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-15 21:46:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:47,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 21:46:47,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:46:47,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:47,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-02-15 21:46:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 21:46:47,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:47,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993448013] [2023-02-15 21:46:47,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993448013] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:47,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:46:47,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-02-15 21:46:47,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471383444] [2023-02-15 21:46:47,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:47,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 21:46:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:47,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 21:46:47,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:46:47,916 INFO L87 Difference]: Start difference. First operand 175 states and 224 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:49,864 INFO L93 Difference]: Finished difference Result 478 states and 617 transitions. [2023-02-15 21:46:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 21:46:49,865 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-02-15 21:46:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:49,866 INFO L225 Difference]: With dead ends: 478 [2023-02-15 21:46:49,866 INFO L226 Difference]: Without dead ends: 478 [2023-02-15 21:46:49,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2023-02-15 21:46:49,867 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 690 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:49,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 638 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-15 21:46:49,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-02-15 21:46:49,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 183. [2023-02-15 21:46:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 155 states have (on average 1.367741935483871) internal successors, (212), 170 states have internal predecessors, (212), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 21:46:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 234 transitions. [2023-02-15 21:46:49,873 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 234 transitions. Word has length 29 [2023-02-15 21:46:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:49,873 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 234 transitions. [2023-02-15 21:46:49,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:46:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 234 transitions. [2023-02-15 21:46:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 21:46:49,874 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:49,874 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:49,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:50,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:50,082 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 21:46:50,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:50,082 INFO L85 PathProgramCache]: Analyzing trace with hash -85984087, now seen corresponding path program 2 times [2023-02-15 21:46:50,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:50,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171912602] [2023-02-15 21:46:50,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 21:46:50,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:50,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:50,083 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:46:50,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-15 21:46:50,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 21:46:50,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 21:46:50,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 21:46:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 21:46:50,234 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 21:46:50,235 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 21:46:50,235 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-02-15 21:46:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-02-15 21:46:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-02-15 21:46:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-02-15 21:46:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-02-15 21:46:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-02-15 21:46:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-02-15 21:46:50,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-02-15 21:46:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-02-15 21:46:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-02-15 21:46:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-02-15 21:46:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-02-15 21:46:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-02-15 21:46:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-02-15 21:46:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-02-15 21:46:50,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-02-15 21:46:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-02-15 21:46:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2023-02-15 21:46:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2023-02-15 21:46:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2023-02-15 21:46:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-02-15 21:46:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-02-15 21:46:50,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-02-15 21:46:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-02-15 21:46:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-02-15 21:46:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 26 remaining) [2023-02-15 21:46:50,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-02-15 21:46:50,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:46:50,450 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:50,453 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 21:46:50,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 09:46:50 BoogieIcfgContainer [2023-02-15 21:46:50,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 21:46:50,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 21:46:50,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 21:46:50,472 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 21:46:50,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:46:29" (3/4) ... [2023-02-15 21:46:50,475 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 21:46:50,475 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 21:46:50,476 INFO L158 Benchmark]: Toolchain (without parser) took 21613.20ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 49.4MB in the beginning and 37.8MB in the end (delta: 11.7MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2023-02-15 21:46:50,476 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory is still 35.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:46:50,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.82ms. Allocated memory is still 73.4MB. Free memory was 49.2MB in the beginning and 48.3MB in the end (delta: 968.0kB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2023-02-15 21:46:50,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.50ms. Allocated memory is still 73.4MB. Free memory was 48.3MB in the beginning and 45.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 21:46:50,477 INFO L158 Benchmark]: Boogie Preprocessor took 41.53ms. Allocated memory is still 73.4MB. Free memory was 45.8MB in the beginning and 44.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:46:50,477 INFO L158 Benchmark]: RCFGBuilder took 511.46ms. Allocated memory is still 73.4MB. Free memory was 44.0MB in the beginning and 39.0MB in the end (delta: 5.0MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2023-02-15 21:46:50,477 INFO L158 Benchmark]: TraceAbstraction took 20650.46ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 38.2MB in the beginning and 37.8MB in the end (delta: 425.1kB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2023-02-15 21:46:50,478 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 107.0MB. Free memory is still 37.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:46:50,480 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.18ms. Allocated memory is still 58.7MB. Free memory is still 35.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.82ms. Allocated memory is still 73.4MB. Free memory was 49.2MB in the beginning and 48.3MB in the end (delta: 968.0kB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.50ms. Allocated memory is still 73.4MB. Free memory was 48.3MB in the beginning and 45.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.53ms. Allocated memory is still 73.4MB. Free memory was 45.8MB in the beginning and 44.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 511.46ms. Allocated memory is still 73.4MB. Free memory was 44.0MB in the beginning and 39.0MB in the end (delta: 5.0MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20650.46ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 38.2MB in the beginning and 37.8MB in the end (delta: 425.1kB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 107.0MB. Free memory is still 37.8MB. There was no memory consumed. 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 - UnprovableResult [Line: 1128]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1128. Possible FailurePath: [L1130] unsigned long pat_len = __VERIFIER_nondet_ulong(), a_len = __VERIFIER_nondet_ulong(); [L1130] unsigned long pat_len = __VERIFIER_nondet_ulong(), a_len = __VERIFIER_nondet_ulong(); [L1132] CALL assume_abort_if_not(pat_len < 4294967296 / sizeof(int)) VAL [\old(cond)=1] [L5] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L1132] RET assume_abort_if_not(pat_len < 4294967296 / sizeof(int)) VAL [pat_len=2] [L1133] CALL assume_abort_if_not(a_len < 4294967296 / sizeof(int)) VAL [\old(cond)=1] [L5] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L1133] RET assume_abort_if_not(a_len < 4294967296 / sizeof(int)) VAL [a_len=0, pat_len=2] [L1134] int *pat=malloc(sizeof(int)*pat_len); [L1135] int *a=malloc(sizeof(int)*a_len); [L1139] int j = 0; VAL [a={3:0}, a_len=0, j=0, pat={6:0}, pat_len=2] [L1139] COND TRUE j < pat_len VAL [a={3:0}, a_len=0, j=0, pat={6:0}, pat_len=2] [L1140] pat[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={3:0}, a_len=0, j=0, pat={6:0}, pat_len=2] [L1139] j++ VAL [a={3:0}, a_len=0, j=1, pat={6:0}, pat_len=2] [L1139] COND TRUE j < pat_len VAL [a={3:0}, a_len=0, j=1, pat={6:0}, pat_len=2] [L1140] pat[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={3:0}, a_len=0, j=1, pat={6:0}, pat_len=2] [L1139] j++ VAL [a={3:0}, a_len=0, j=2, pat={6:0}, pat_len=2] [L1139] COND FALSE !(j < pat_len) VAL [a={3:0}, a_len=0, j=2, pat={6:0}, pat_len=2] [L1142] int j = 0; VAL [a={3:0}, a_len=0, j=2, j=0, pat={6:0}, pat_len=2] [L1142] COND FALSE !(j < a_len) VAL [a={3:0}, a_len=0, j=0, j=2, pat={6:0}, pat_len=2] [L1147] CALL is_relaxed_prefix(pat, pat_len, a, a_len) [L1106] COND TRUE pat_length>a_length+1 [L1107] return 0; VAL [\old(a_length)=0, \old(pat_length)=2, \result=0, a={3:0}, a={3:0}, a_length=0, pat={6:0}, pat={6:0}, pat_length=2] [L1147] RET is_relaxed_prefix(pat, pat_len, a, a_len) [L1147] COND FALSE !(is_relaxed_prefix(pat, pat_len, a, a_len)) [L1163] COND FALSE !(pat_len<=a_len+1) VAL [a={3:0}, a_len=0, j=0, j=2, pat={6:0}, pat_len=2] [L1176] return 0; VAL [\result=0, a={3:0}, a_len=0, j=0, j=2, pat={6:0}, pat_len=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 93 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 20.6s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6511 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6449 mSDsluCounter, 7864 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6089 mSDsCounter, 676 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4276 IncrementalHoareTripleChecker+Invalid, 4952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 676 mSolverCounterUnsat, 1775 mSDtfsCounter, 4276 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 627 GetRequests, 432 SyntacticMatches, 6 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=17, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 1376 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 566 ConstructedInterpolants, 4 QuantifiedInterpolants, 3428 SizeOfPredicates, 75 NumberOfNonLiveVariables, 1149 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 93/136 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-15 21:46:50,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample