./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:09:52,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:09:52,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:09:52,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:09:52,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:09:52,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:09:52,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:09:52,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:09:52,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:09:52,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:09:52,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:09:52,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:09:52,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:09:52,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:09:52,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:09:52,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:09:52,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:09:52,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:09:52,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:09:52,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:09:52,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:09:52,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:09:52,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:09:52,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:09:52,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:09:52,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:09:52,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:09:52,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:09:52,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:09:52,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:09:52,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:09:52,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:09:52,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:09:52,752 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:09:52,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:09:52,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:09:52,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:09:52,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:09:52,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:09:52,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:09:52,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:09:52,757 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:09:52,787 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:09:52,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:09:52,788 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:09:52,788 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:09:52,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:09:52,789 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:09:52,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:09:52,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:09:52,790 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:09:52,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:09:52,791 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:09:52,791 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:09:52,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:09:52,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:09:52,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:09:52,792 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:09:52,792 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:09:52,793 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:09:52,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:09:52,793 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:09:52,793 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:09:52,793 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:09:52,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:09:52,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:09:52,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:09:52,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:09:52,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:09:52,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:09:52,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:09:52,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:09:52,795 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:09:52,796 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:09:52,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:09:52,796 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:09:52,796 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 -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2023-02-16 03:09:53,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:09:53,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:09:53,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:09:53,054 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:09:53,055 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:09:53,056 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2023-02-16 03:09:54,166 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:09:54,391 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:09:54,401 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2023-02-16 03:09:54,412 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca5ad0c6/cce0ea55fb764cba926913c75fb214bf/FLAG191f24d21 [2023-02-16 03:09:54,423 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca5ad0c6/cce0ea55fb764cba926913c75fb214bf [2023-02-16 03:09:54,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:09:54,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:09:54,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:09:54,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:09:54,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:09:54,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:09:54" (1/1) ... [2023-02-16 03:09:54,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c12e627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:54, skipping insertion in model container [2023-02-16 03:09:54,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:09:54" (1/1) ... [2023-02-16 03:09:54,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:09:54,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:09:54,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:09:54,764 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:09:54,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:09:54,835 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:09:54,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:54 WrapperNode [2023-02-16 03:09:54,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:09:54,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:09:54,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:09:54,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:09:54,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:54" (1/1) ... [2023-02-16 03:09:54,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:54" (1/1) ... [2023-02-16 03:09:54,874 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2023-02-16 03:09:54,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:09:54,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:09:54,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:09:54,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:09:54,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:54" (1/1) ... [2023-02-16 03:09:54,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:54" (1/1) ... [2023-02-16 03:09:54,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:54" (1/1) ... [2023-02-16 03:09:54,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:54" (1/1) ... [2023-02-16 03:09:54,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:54" (1/1) ... [2023-02-16 03:09:54,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:54" (1/1) ... [2023-02-16 03:09:54,896 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:54" (1/1) ... [2023-02-16 03:09:54,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:54" (1/1) ... [2023-02-16 03:09:54,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:09:54,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:09:54,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:09:54,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:09:54,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:54" (1/1) ... [2023-02-16 03:09:54,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:09:54,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:09:54,927 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-16 03:09:54,933 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-16 03:09:54,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 03:09:54,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 03:09:54,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:09:54,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:09:54,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:09:54,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:09:54,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:09:54,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:09:54,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:09:54,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:09:55,068 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:09:55,070 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:09:55,307 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:09:55,313 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:09:55,313 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 03:09:55,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:09:55 BoogieIcfgContainer [2023-02-16 03:09:55,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:09:55,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:09:55,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:09:55,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:09:55,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:09:54" (1/3) ... [2023-02-16 03:09:55,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4d2c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:09:55, skipping insertion in model container [2023-02-16 03:09:55,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:54" (2/3) ... [2023-02-16 03:09:55,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4d2c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:09:55, skipping insertion in model container [2023-02-16 03:09:55,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:09:55" (3/3) ... [2023-02-16 03:09:55,323 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2023-02-16 03:09:55,353 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:09:55,353 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2023-02-16 03:09:55,421 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:09:55,428 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;@6d4e57f1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:09:55,428 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-02-16 03:09:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-16 03:09:55,436 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:55,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-16 03:09:55,437 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:55,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:55,442 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2023-02-16 03:09:55,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:55,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256189418] [2023-02-16 03:09:55,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:55,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:55,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:55,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256189418] [2023-02-16 03:09:55,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256189418] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:55,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:55,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:09:55,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627451732] [2023-02-16 03:09:55,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:55,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 03:09:55,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:09:55,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 03:09:55,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 03:09:55,656 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:55,678 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2023-02-16 03:09:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 03:09:55,680 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-16 03:09:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:55,689 INFO L225 Difference]: With dead ends: 64 [2023-02-16 03:09:55,689 INFO L226 Difference]: Without dead ends: 62 [2023-02-16 03:09:55,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-16 03:09:55,694 INFO L413 NwaCegarLoop]: 81 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, 81 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-16 03:09:55,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:09:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-16 03:09:55,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-02-16 03:09:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:55,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2023-02-16 03:09:55,727 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2023-02-16 03:09:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:55,728 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2023-02-16 03:09:55,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2023-02-16 03:09:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-16 03:09:55,729 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:55,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:55,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:09:55,730 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:55,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:55,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2023-02-16 03:09:55,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:55,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52674111] [2023-02-16 03:09:55,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:55,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:55,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:55,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52674111] [2023-02-16 03:09:55,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52674111] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:55,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:55,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:09:55,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996794424] [2023-02-16 03:09:55,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:55,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:09:55,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:09:55,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:09:55,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:09:55,803 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:55,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:55,827 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2023-02-16 03:09:55,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:09:55,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-16 03:09:55,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:55,830 INFO L225 Difference]: With dead ends: 63 [2023-02-16 03:09:55,830 INFO L226 Difference]: Without dead ends: 63 [2023-02-16 03:09:55,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:09:55,837 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:55,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:09:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-16 03:09:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-16 03:09:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2023-02-16 03:09:55,851 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2023-02-16 03:09:55,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:55,853 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2023-02-16 03:09:55,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2023-02-16 03:09:55,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-16 03:09:55,856 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:55,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:55,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:09:55,858 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:55,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:55,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2023-02-16 03:09:55,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:55,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817393737] [2023-02-16 03:09:55,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:55,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:55,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:55,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817393737] [2023-02-16 03:09:55,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817393737] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:55,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:55,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:09:55,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005776188] [2023-02-16 03:09:55,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:55,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:09:55,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:09:55,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:09:55,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:09:55,954 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:55,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:55,997 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2023-02-16 03:09:55,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:09:55,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-16 03:09:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:56,001 INFO L225 Difference]: With dead ends: 111 [2023-02-16 03:09:56,002 INFO L226 Difference]: Without dead ends: 111 [2023-02-16 03:09:56,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:09:56,006 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:56,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:09:56,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-16 03:09:56,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2023-02-16 03:09:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2023-02-16 03:09:56,021 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2023-02-16 03:09:56,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:56,021 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2023-02-16 03:09:56,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,022 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2023-02-16 03:09:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-16 03:09:56,022 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:56,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:56,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:09:56,023 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:56,025 INFO L85 PathProgramCache]: Analyzing trace with hash 177749355, now seen corresponding path program 1 times [2023-02-16 03:09:56,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:56,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544037214] [2023-02-16 03:09:56,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:56,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:56,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544037214] [2023-02-16 03:09:56,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544037214] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:56,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:56,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:09:56,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297637824] [2023-02-16 03:09:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:56,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:09:56,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:09:56,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:09:56,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:09:56,146 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:56,189 INFO L93 Difference]: Finished difference Result 101 states and 146 transitions. [2023-02-16 03:09:56,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:09:56,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-16 03:09:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:56,191 INFO L225 Difference]: With dead ends: 101 [2023-02-16 03:09:56,191 INFO L226 Difference]: Without dead ends: 101 [2023-02-16 03:09:56,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 03:09:56,197 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:56,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 215 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:09:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-16 03:09:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2023-02-16 03:09:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 94 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2023-02-16 03:09:56,209 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 8 [2023-02-16 03:09:56,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:56,210 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2023-02-16 03:09:56,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,210 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2023-02-16 03:09:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-16 03:09:56,210 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:56,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:56,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:09:56,211 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:56,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:56,211 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2023-02-16 03:09:56,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:56,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677486249] [2023-02-16 03:09:56,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:56,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:56,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677486249] [2023-02-16 03:09:56,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677486249] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:56,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:56,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:09:56,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001734509] [2023-02-16 03:09:56,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:56,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:09:56,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:09:56,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:09:56,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:09:56,261 INFO L87 Difference]: Start difference. First operand 95 states and 139 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:56,321 INFO L93 Difference]: Finished difference Result 177 states and 261 transitions. [2023-02-16 03:09:56,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:09:56,322 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-16 03:09:56,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:56,324 INFO L225 Difference]: With dead ends: 177 [2023-02-16 03:09:56,324 INFO L226 Difference]: Without dead ends: 174 [2023-02-16 03:09:56,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:09:56,325 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:56,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:09:56,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-16 03:09:56,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 153. [2023-02-16 03:09:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 133 states have (on average 1.849624060150376) internal successors, (246), 152 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 246 transitions. [2023-02-16 03:09:56,349 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 246 transitions. Word has length 8 [2023-02-16 03:09:56,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:56,349 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 246 transitions. [2023-02-16 03:09:56,349 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,349 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2023-02-16 03:09:56,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-16 03:09:56,350 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:56,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:56,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:09:56,350 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:56,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:56,351 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2023-02-16 03:09:56,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:56,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245265885] [2023-02-16 03:09:56,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:56,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:56,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245265885] [2023-02-16 03:09:56,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245265885] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:56,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:56,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:09:56,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572762035] [2023-02-16 03:09:56,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:56,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:09:56,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:09:56,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:09:56,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:09:56,411 INFO L87 Difference]: Start difference. First operand 153 states and 246 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:56,465 INFO L93 Difference]: Finished difference Result 229 states and 354 transitions. [2023-02-16 03:09:56,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:09:56,466 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-16 03:09:56,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:56,467 INFO L225 Difference]: With dead ends: 229 [2023-02-16 03:09:56,467 INFO L226 Difference]: Without dead ends: 229 [2023-02-16 03:09:56,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:09:56,468 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:56,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 172 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:09:56,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-02-16 03:09:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 208. [2023-02-16 03:09:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 190 states have (on average 1.7894736842105263) internal successors, (340), 207 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 340 transitions. [2023-02-16 03:09:56,488 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 340 transitions. Word has length 8 [2023-02-16 03:09:56,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:56,488 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 340 transitions. [2023-02-16 03:09:56,488 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 340 transitions. [2023-02-16 03:09:56,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-16 03:09:56,489 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:56,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:56,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 03:09:56,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:56,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2023-02-16 03:09:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:56,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559089325] [2023-02-16 03:09:56,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:56,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:56,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:56,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559089325] [2023-02-16 03:09:56,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559089325] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:56,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:56,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:09:56,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149120278] [2023-02-16 03:09:56,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:56,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:09:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:09:56,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:09:56,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:09:56,564 INFO L87 Difference]: Start difference. First operand 208 states and 340 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:56,605 INFO L93 Difference]: Finished difference Result 224 states and 345 transitions. [2023-02-16 03:09:56,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:09:56,606 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-16 03:09:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:56,607 INFO L225 Difference]: With dead ends: 224 [2023-02-16 03:09:56,607 INFO L226 Difference]: Without dead ends: 224 [2023-02-16 03:09:56,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:09:56,608 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:56,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:09:56,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-02-16 03:09:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 206. [2023-02-16 03:09:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 190 states have (on average 1.7473684210526317) internal successors, (332), 205 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 332 transitions. [2023-02-16 03:09:56,639 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 332 transitions. Word has length 8 [2023-02-16 03:09:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:56,639 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 332 transitions. [2023-02-16 03:09:56,639 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 332 transitions. [2023-02-16 03:09:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 03:09:56,641 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:56,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:56,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 03:09:56,641 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:56,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:56,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2023-02-16 03:09:56,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:56,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669641946] [2023-02-16 03:09:56,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:56,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:56,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:56,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669641946] [2023-02-16 03:09:56,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669641946] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:56,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:56,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:09:56,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604498064] [2023-02-16 03:09:56,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:56,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:09:56,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:09:56,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:09:56,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:09:56,753 INFO L87 Difference]: Start difference. First operand 206 states and 332 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:56,796 INFO L93 Difference]: Finished difference Result 445 states and 675 transitions. [2023-02-16 03:09:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:09:56,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-16 03:09:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:56,798 INFO L225 Difference]: With dead ends: 445 [2023-02-16 03:09:56,798 INFO L226 Difference]: Without dead ends: 445 [2023-02-16 03:09:56,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:09:56,804 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 105 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:56,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 360 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:09:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2023-02-16 03:09:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 354. [2023-02-16 03:09:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 338 states have (on average 1.680473372781065) internal successors, (568), 353 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 568 transitions. [2023-02-16 03:09:56,815 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 568 transitions. Word has length 9 [2023-02-16 03:09:56,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:56,815 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 568 transitions. [2023-02-16 03:09:56,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 568 transitions. [2023-02-16 03:09:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-16 03:09:56,816 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:56,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:56,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 03:09:56,816 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:56,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:56,816 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2023-02-16 03:09:56,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:56,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090775164] [2023-02-16 03:09:56,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:56,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:56,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:56,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090775164] [2023-02-16 03:09:56,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090775164] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:56,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:56,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:09:56,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23602358] [2023-02-16 03:09:56,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:56,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:09:56,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:09:56,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:09:56,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:09:56,877 INFO L87 Difference]: Start difference. First operand 354 states and 568 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:56,920 INFO L93 Difference]: Finished difference Result 826 states and 1228 transitions. [2023-02-16 03:09:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:09:56,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-16 03:09:56,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:56,924 INFO L225 Difference]: With dead ends: 826 [2023-02-16 03:09:56,924 INFO L226 Difference]: Without dead ends: 826 [2023-02-16 03:09:56,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:09:56,926 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 93 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:56,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 353 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:09:56,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2023-02-16 03:09:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 594. [2023-02-16 03:09:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 578 states have (on average 1.5778546712802768) internal successors, (912), 593 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 912 transitions. [2023-02-16 03:09:56,942 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 912 transitions. Word has length 10 [2023-02-16 03:09:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:56,942 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 912 transitions. [2023-02-16 03:09:56,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 912 transitions. [2023-02-16 03:09:56,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:09:56,945 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:56,945 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:56,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 03:09:56,945 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:56,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:56,946 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2023-02-16 03:09:56,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:56,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150881044] [2023-02-16 03:09:56,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:57,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:57,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150881044] [2023-02-16 03:09:57,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150881044] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:57,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:57,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:09:57,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445161967] [2023-02-16 03:09:57,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:57,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:09:57,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:09:57,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:09:57,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:09:57,043 INFO L87 Difference]: Start difference. First operand 594 states and 912 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:57,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:57,092 INFO L93 Difference]: Finished difference Result 906 states and 1406 transitions. [2023-02-16 03:09:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:09:57,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-16 03:09:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:57,096 INFO L225 Difference]: With dead ends: 906 [2023-02-16 03:09:57,096 INFO L226 Difference]: Without dead ends: 906 [2023-02-16 03:09:57,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:09:57,097 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 99 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:57,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 279 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:09:57,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2023-02-16 03:09:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 888. [2023-02-16 03:09:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 872 states have (on average 1.603211009174312) internal successors, (1398), 887 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1398 transitions. [2023-02-16 03:09:57,114 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1398 transitions. Word has length 16 [2023-02-16 03:09:57,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:57,114 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 1398 transitions. [2023-02-16 03:09:57,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1398 transitions. [2023-02-16 03:09:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:09:57,118 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:57,118 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:57,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 03:09:57,119 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:57,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:57,119 INFO L85 PathProgramCache]: Analyzing trace with hash 617603772, now seen corresponding path program 1 times [2023-02-16 03:09:57,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:57,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596845927] [2023-02-16 03:09:57,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:57,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:57,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:57,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596845927] [2023-02-16 03:09:57,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596845927] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:09:57,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523284508] [2023-02-16 03:09:57,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:57,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:09:57,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:09:57,197 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-16 03:09:57,214 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-16 03:09:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:57,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:09:57,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:57,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:09:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:57,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523284508] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:09:57,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:09:57,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-02-16 03:09:57,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827081801] [2023-02-16 03:09:57,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:09:57,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:09:57,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:09:57,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:09:57,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:09:57,408 INFO L87 Difference]: Start difference. First operand 888 states and 1398 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:57,528 INFO L93 Difference]: Finished difference Result 2236 states and 3388 transitions. [2023-02-16 03:09:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:09:57,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-16 03:09:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:57,536 INFO L225 Difference]: With dead ends: 2236 [2023-02-16 03:09:57,536 INFO L226 Difference]: Without dead ends: 2236 [2023-02-16 03:09:57,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:09:57,537 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 359 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:57,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 543 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:09:57,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2023-02-16 03:09:57,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 1272. [2023-02-16 03:09:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1256 states have (on average 1.5684713375796178) internal successors, (1970), 1271 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:57,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1970 transitions. [2023-02-16 03:09:57,565 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1970 transitions. Word has length 16 [2023-02-16 03:09:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:57,566 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1970 transitions. [2023-02-16 03:09:57,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1970 transitions. [2023-02-16 03:09:57,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 03:09:57,567 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:57,567 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:57,575 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-16 03:09:57,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-16 03:09:57,775 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:57,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1214108262, now seen corresponding path program 1 times [2023-02-16 03:09:57,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:57,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135332899] [2023-02-16 03:09:57,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:57,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:09:57,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:57,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135332899] [2023-02-16 03:09:57,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135332899] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:57,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:57,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:09:57,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777199832] [2023-02-16 03:09:57,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:57,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:09:57,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:09:57,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:09:57,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:09:57,815 INFO L87 Difference]: Start difference. First operand 1272 states and 1970 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:57,842 INFO L93 Difference]: Finished difference Result 473 states and 648 transitions. [2023-02-16 03:09:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:09:57,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-16 03:09:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:57,844 INFO L225 Difference]: With dead ends: 473 [2023-02-16 03:09:57,844 INFO L226 Difference]: Without dead ends: 473 [2023-02-16 03:09:57,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 03:09:57,845 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 106 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:57,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 243 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:09:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-02-16 03:09:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 353. [2023-02-16 03:09:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 341 states have (on average 1.501466275659824) internal successors, (512), 352 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 512 transitions. [2023-02-16 03:09:57,852 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 512 transitions. Word has length 21 [2023-02-16 03:09:57,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:57,852 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 512 transitions. [2023-02-16 03:09:57,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:57,853 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 512 transitions. [2023-02-16 03:09:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 03:09:57,853 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:57,853 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:57,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 03:09:57,854 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:57,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1692627395, now seen corresponding path program 1 times [2023-02-16 03:09:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:57,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024072684] [2023-02-16 03:09:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:57,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:57,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:57,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024072684] [2023-02-16 03:09:57,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024072684] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:09:57,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666382617] [2023-02-16 03:09:57,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:57,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:09:57,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:09:57,927 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-16 03:09:57,948 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-16 03:09:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:58,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:09:58,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:58,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:09:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:58,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666382617] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:09:58,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:09:58,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-02-16 03:09:58,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497851954] [2023-02-16 03:09:58,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:09:58,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:09:58,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:09:58,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:09:58,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:09:58,127 INFO L87 Difference]: Start difference. First operand 353 states and 512 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:58,191 INFO L93 Difference]: Finished difference Result 1047 states and 1508 transitions. [2023-02-16 03:09:58,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:09:58,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-16 03:09:58,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:58,195 INFO L225 Difference]: With dead ends: 1047 [2023-02-16 03:09:58,195 INFO L226 Difference]: Without dead ends: 1047 [2023-02-16 03:09:58,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:09:58,196 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 176 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:58,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 159 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:09:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2023-02-16 03:09:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1007. [2023-02-16 03:09:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 995 states have (on average 1.485427135678392) internal successors, (1478), 1006 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1478 transitions. [2023-02-16 03:09:58,211 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1478 transitions. Word has length 24 [2023-02-16 03:09:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:58,211 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1478 transitions. [2023-02-16 03:09:58,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1478 transitions. [2023-02-16 03:09:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:09:58,212 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:58,212 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:58,219 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-16 03:09:58,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-16 03:09:58,418 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:58,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:58,419 INFO L85 PathProgramCache]: Analyzing trace with hash -6965384, now seen corresponding path program 1 times [2023-02-16 03:09:58,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:58,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122918418] [2023-02-16 03:09:58,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:58,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:58,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:58,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122918418] [2023-02-16 03:09:58,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122918418] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:09:58,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895697780] [2023-02-16 03:09:58,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:58,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:09:58,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:09:58,531 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-16 03:09:58,533 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-16 03:09:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:58,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:09:58,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:58,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:09:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:58,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895697780] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:09:58,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:09:58,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2023-02-16 03:09:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622682479] [2023-02-16 03:09:58,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:09:58,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:09:58,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:09:58,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:09:58,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:09:58,709 INFO L87 Difference]: Start difference. First operand 1007 states and 1478 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:58,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:58,897 INFO L93 Difference]: Finished difference Result 3857 states and 5384 transitions. [2023-02-16 03:09:58,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 03:09:58,898 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-16 03:09:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:58,911 INFO L225 Difference]: With dead ends: 3857 [2023-02-16 03:09:58,912 INFO L226 Difference]: Without dead ends: 3857 [2023-02-16 03:09:58,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2023-02-16 03:09:58,913 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 625 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:58,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 535 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:09:58,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2023-02-16 03:09:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 2177. [2023-02-16 03:09:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2177 states, 2165 states have (on average 1.464203233256351) internal successors, (3170), 2176 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 3170 transitions. [2023-02-16 03:09:58,965 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 3170 transitions. Word has length 27 [2023-02-16 03:09:58,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:58,965 INFO L495 AbstractCegarLoop]: Abstraction has 2177 states and 3170 transitions. [2023-02-16 03:09:58,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 3170 transitions. [2023-02-16 03:09:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:09:58,966 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:58,966 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:58,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 03:09:59,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:09:59,173 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:59,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:59,173 INFO L85 PathProgramCache]: Analyzing trace with hash 554127938, now seen corresponding path program 1 times [2023-02-16 03:09:59,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:59,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49433807] [2023-02-16 03:09:59,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:59,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:09:59,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:59,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49433807] [2023-02-16 03:09:59,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49433807] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:09:59,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834681313] [2023-02-16 03:09:59,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:59,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:09:59,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:09:59,273 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-16 03:09:59,276 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-16 03:09:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:59,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:09:59,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:09:59,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:09:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:09:59,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834681313] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:09:59,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:09:59,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-02-16 03:09:59,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860260073] [2023-02-16 03:09:59,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:09:59,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:09:59,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:09:59,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:09:59,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:09:59,433 INFO L87 Difference]: Start difference. First operand 2177 states and 3170 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:59,546 INFO L93 Difference]: Finished difference Result 1889 states and 2651 transitions. [2023-02-16 03:09:59,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:09:59,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-16 03:09:59,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:59,553 INFO L225 Difference]: With dead ends: 1889 [2023-02-16 03:09:59,553 INFO L226 Difference]: Without dead ends: 1889 [2023-02-16 03:09:59,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:09:59,554 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 455 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:59,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 553 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:09:59,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2023-02-16 03:09:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 831. [2023-02-16 03:09:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 819 states have (on average 1.468864468864469) internal successors, (1203), 830 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1203 transitions. [2023-02-16 03:09:59,576 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1203 transitions. Word has length 27 [2023-02-16 03:09:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:59,576 INFO L495 AbstractCegarLoop]: Abstraction has 831 states and 1203 transitions. [2023-02-16 03:09:59,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1203 transitions. [2023-02-16 03:09:59,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 03:09:59,578 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:59,578 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:59,587 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-16 03:09:59,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-16 03:09:59,785 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:09:59,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:59,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2001409998, now seen corresponding path program 1 times [2023-02-16 03:09:59,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:09:59,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443707740] [2023-02-16 03:09:59,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:59,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:09:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-16 03:09:59,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:09:59,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443707740] [2023-02-16 03:09:59,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443707740] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:09:59,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658152642] [2023-02-16 03:09:59,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:59,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:09:59,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:09:59,944 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-16 03:09:59,946 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-16 03:10:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:00,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:10:00,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:00,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:00,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658152642] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:00,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:10:00,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2023-02-16 03:10:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554485541] [2023-02-16 03:10:00,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:00,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 03:10:00,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:10:00,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 03:10:00,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:10:00,219 INFO L87 Difference]: Start difference. First operand 831 states and 1203 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:00,571 INFO L93 Difference]: Finished difference Result 3249 states and 4495 transitions. [2023-02-16 03:10:00,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-16 03:10:00,572 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-02-16 03:10:00,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:00,582 INFO L225 Difference]: With dead ends: 3249 [2023-02-16 03:10:00,582 INFO L226 Difference]: Without dead ends: 3249 [2023-02-16 03:10:00,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2023-02-16 03:10:00,583 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 1387 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:00,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 888 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2023-02-16 03:10:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 1101. [2023-02-16 03:10:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1089 states have (on average 1.45821854912764) internal successors, (1588), 1100 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:00,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1588 transitions. [2023-02-16 03:10:00,612 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1588 transitions. Word has length 51 [2023-02-16 03:10:00,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:00,614 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1588 transitions. [2023-02-16 03:10:00,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1588 transitions. [2023-02-16 03:10:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-16 03:10:00,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:00,616 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:00,624 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-16 03:10:00,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-16 03:10:00,822 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:00,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:00,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1426339750, now seen corresponding path program 1 times [2023-02-16 03:10:00,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:10:00,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824533253] [2023-02-16 03:10:00,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:00,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:10:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-02-16 03:10:00,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:10:00,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824533253] [2023-02-16 03:10:00,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824533253] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:00,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967660211] [2023-02-16 03:10:00,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:00,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:10:00,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:10:00,936 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-16 03:10:00,959 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-16 03:10:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:01,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 03:10:01,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-16 03:10:01,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-16 03:10:01,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967660211] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:01,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:01,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2023-02-16 03:10:01,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108563824] [2023-02-16 03:10:01,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:01,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:10:01,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:10:01,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:10:01,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:10:01,119 INFO L87 Difference]: Start difference. First operand 1101 states and 1588 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:01,228 INFO L93 Difference]: Finished difference Result 2427 states and 3410 transitions. [2023-02-16 03:10:01,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:10:01,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-02-16 03:10:01,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:01,235 INFO L225 Difference]: With dead ends: 2427 [2023-02-16 03:10:01,235 INFO L226 Difference]: Without dead ends: 2427 [2023-02-16 03:10:01,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:10:01,236 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 250 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:01,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 489 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2023-02-16 03:10:01,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 1749. [2023-02-16 03:10:01,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 1737 states have (on average 1.4352331606217616) internal successors, (2493), 1748 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2493 transitions. [2023-02-16 03:10:01,281 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2493 transitions. Word has length 59 [2023-02-16 03:10:01,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:01,281 INFO L495 AbstractCegarLoop]: Abstraction has 1749 states and 2493 transitions. [2023-02-16 03:10:01,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2493 transitions. [2023-02-16 03:10:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-16 03:10:01,283 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:01,283 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:01,292 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-16 03:10:01,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-16 03:10:01,490 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:01,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:01,490 INFO L85 PathProgramCache]: Analyzing trace with hash -443713253, now seen corresponding path program 1 times [2023-02-16 03:10:01,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:10:01,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120747075] [2023-02-16 03:10:01,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:01,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:10:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-16 03:10:01,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:10:01,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120747075] [2023-02-16 03:10:01,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120747075] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:01,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124220134] [2023-02-16 03:10:01,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:01,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:10:01,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:10:01,612 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-16 03:10:01,615 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-16 03:10:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:01,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 03:10:01,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-16 03:10:01,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:01,803 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-16 03:10:01,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124220134] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:01,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:10:01,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 12 [2023-02-16 03:10:01,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731073451] [2023-02-16 03:10:01,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:01,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:10:01,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:10:01,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:10:01,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:10:01,806 INFO L87 Difference]: Start difference. First operand 1749 states and 2493 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:02,894 INFO L93 Difference]: Finished difference Result 9755 states and 13739 transitions. [2023-02-16 03:10:02,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-16 03:10:02,895 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-02-16 03:10:02,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:02,938 INFO L225 Difference]: With dead ends: 9755 [2023-02-16 03:10:02,938 INFO L226 Difference]: Without dead ends: 9755 [2023-02-16 03:10:02,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=631, Invalid=2021, Unknown=0, NotChecked=0, Total=2652 [2023-02-16 03:10:02,942 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 1015 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:02,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 902 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 03:10:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9755 states. [2023-02-16 03:10:03,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9755 to 4918. [2023-02-16 03:10:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4918 states, 4907 states have (on average 1.4634196046464234) internal successors, (7181), 4917 states have internal predecessors, (7181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4918 states to 4918 states and 7181 transitions. [2023-02-16 03:10:03,054 INFO L78 Accepts]: Start accepts. Automaton has 4918 states and 7181 transitions. Word has length 59 [2023-02-16 03:10:03,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:03,054 INFO L495 AbstractCegarLoop]: Abstraction has 4918 states and 7181 transitions. [2023-02-16 03:10:03,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 4918 states and 7181 transitions. [2023-02-16 03:10:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-16 03:10:03,056 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:03,056 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:03,062 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-16 03:10:03,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:10:03,262 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:03,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:03,263 INFO L85 PathProgramCache]: Analyzing trace with hash -791217300, now seen corresponding path program 1 times [2023-02-16 03:10:03,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:10:03,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264217134] [2023-02-16 03:10:03,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:03,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:10:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-02-16 03:10:03,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:10:03,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264217134] [2023-02-16 03:10:03,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264217134] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:03,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484808737] [2023-02-16 03:10:03,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:03,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:10:03,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:10:03,413 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-16 03:10:03,416 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-16 03:10:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:03,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:10:03,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 101 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:10:03,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 03:10:03,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484808737] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:03,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:10:03,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2023-02-16 03:10:03,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281879552] [2023-02-16 03:10:03,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:03,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:10:03,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:10:03,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:10:03,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:10:03,629 INFO L87 Difference]: Start difference. First operand 4918 states and 7181 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:04,144 INFO L93 Difference]: Finished difference Result 10540 states and 15062 transitions. [2023-02-16 03:10:04,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-16 03:10:04,145 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-02-16 03:10:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:04,165 INFO L225 Difference]: With dead ends: 10540 [2023-02-16 03:10:04,165 INFO L226 Difference]: Without dead ends: 10540 [2023-02-16 03:10:04,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 133 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2023-02-16 03:10:04,166 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 967 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:04,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1571 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10540 states. [2023-02-16 03:10:04,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10540 to 4718. [2023-02-16 03:10:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4718 states, 4707 states have (on average 1.4418950499256427) internal successors, (6787), 4717 states have internal predecessors, (6787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4718 states to 4718 states and 6787 transitions. [2023-02-16 03:10:04,291 INFO L78 Accepts]: Start accepts. Automaton has 4718 states and 6787 transitions. Word has length 63 [2023-02-16 03:10:04,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:04,291 INFO L495 AbstractCegarLoop]: Abstraction has 4718 states and 6787 transitions. [2023-02-16 03:10:04,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:04,291 INFO L276 IsEmpty]: Start isEmpty. Operand 4718 states and 6787 transitions. [2023-02-16 03:10:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-16 03:10:04,293 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:04,293 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:04,301 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-16 03:10:04,499 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-16 03:10:04,500 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:04,500 INFO L85 PathProgramCache]: Analyzing trace with hash 767429099, now seen corresponding path program 1 times [2023-02-16 03:10:04,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:10:04,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277878017] [2023-02-16 03:10:04,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:04,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:10:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-16 03:10:04,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:10:04,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277878017] [2023-02-16 03:10:04,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277878017] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:04,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814566443] [2023-02-16 03:10:04,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:04,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:10:04,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:10:04,640 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:10:04,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-16 03:10:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:04,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 03:10:04,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-16 03:10:04,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-16 03:10:04,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814566443] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:04,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:10:04,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2023-02-16 03:10:04,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401827247] [2023-02-16 03:10:04,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:04,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:10:04,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:10:04,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:10:04,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:10:04,858 INFO L87 Difference]: Start difference. First operand 4718 states and 6787 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:05,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:05,105 INFO L93 Difference]: Finished difference Result 3827 states and 5204 transitions. [2023-02-16 03:10:05,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 03:10:05,106 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-02-16 03:10:05,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:05,113 INFO L225 Difference]: With dead ends: 3827 [2023-02-16 03:10:05,113 INFO L226 Difference]: Without dead ends: 3827 [2023-02-16 03:10:05,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2023-02-16 03:10:05,115 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 794 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:05,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1651 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2023-02-16 03:10:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 2865. [2023-02-16 03:10:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 2854 states have (on average 1.3587946741415557) internal successors, (3878), 2864 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 3878 transitions. [2023-02-16 03:10:05,176 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 3878 transitions. Word has length 63 [2023-02-16 03:10:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:05,176 INFO L495 AbstractCegarLoop]: Abstraction has 2865 states and 3878 transitions. [2023-02-16 03:10:05,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 3878 transitions. [2023-02-16 03:10:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-16 03:10:05,177 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:05,178 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:05,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-16 03:10:05,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:10:05,384 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:05,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:05,385 INFO L85 PathProgramCache]: Analyzing trace with hash 965172541, now seen corresponding path program 1 times [2023-02-16 03:10:05,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:10:05,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004379103] [2023-02-16 03:10:05,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:05,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:10:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 03:10:05,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 03:10:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 03:10:05,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 03:10:05,464 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 03:10:05,465 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2023-02-16 03:10:05,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2023-02-16 03:10:05,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2023-02-16 03:10:05,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2023-02-16 03:10:05,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2023-02-16 03:10:05,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2023-02-16 03:10:05,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2023-02-16 03:10:05,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2023-02-16 03:10:05,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2023-02-16 03:10:05,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2023-02-16 03:10:05,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2023-02-16 03:10:05,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2023-02-16 03:10:05,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2023-02-16 03:10:05,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2023-02-16 03:10:05,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2023-02-16 03:10:05,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2023-02-16 03:10:05,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2023-02-16 03:10:05,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2023-02-16 03:10:05,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2023-02-16 03:10:05,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2023-02-16 03:10:05,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-16 03:10:05,475 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:05,478 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 03:10:05,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 03:10:05 BoogieIcfgContainer [2023-02-16 03:10:05,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 03:10:05,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 03:10:05,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 03:10:05,547 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 03:10:05,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:09:55" (3/4) ... [2023-02-16 03:10:05,550 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-16 03:10:05,550 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 03:10:05,550 INFO L158 Benchmark]: Toolchain (without parser) took 11124.68ms. Allocated memory was 130.0MB in the beginning and 260.0MB in the end (delta: 130.0MB). Free memory was 91.9MB in the beginning and 138.9MB in the end (delta: -47.1MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2023-02-16 03:10:05,552 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 107.0MB. Free memory was 59.4MB in the beginning and 59.3MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:10:05,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.39ms. Allocated memory is still 130.0MB. Free memory was 91.9MB in the beginning and 74.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-16 03:10:05,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.58ms. Allocated memory is still 130.0MB. Free memory was 74.6MB in the beginning and 72.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 03:10:05,552 INFO L158 Benchmark]: Boogie Preprocessor took 24.40ms. Allocated memory is still 130.0MB. Free memory was 72.5MB in the beginning and 70.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 03:10:05,553 INFO L158 Benchmark]: RCFGBuilder took 415.25ms. Allocated memory is still 130.0MB. Free memory was 70.9MB in the beginning and 53.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-16 03:10:05,553 INFO L158 Benchmark]: TraceAbstraction took 10228.49ms. Allocated memory was 130.0MB in the beginning and 260.0MB in the end (delta: 130.0MB). Free memory was 52.5MB in the beginning and 140.0MB in the end (delta: -87.5MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2023-02-16 03:10:05,554 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 260.0MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:10:05,557 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.19ms. Allocated memory is still 107.0MB. Free memory was 59.4MB in the beginning and 59.3MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.39ms. Allocated memory is still 130.0MB. Free memory was 91.9MB in the beginning and 74.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.58ms. Allocated memory is still 130.0MB. Free memory was 74.6MB in the beginning and 72.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.40ms. Allocated memory is still 130.0MB. Free memory was 72.5MB in the beginning and 70.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 415.25ms. Allocated memory is still 130.0MB. Free memory was 70.9MB in the beginning and 53.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10228.49ms. Allocated memory was 130.0MB in the beginning and 260.0MB in the end (delta: 130.0MB). Free memory was 52.5MB in the beginning and 140.0MB in the end (delta: -87.5MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 260.0MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L542] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L548] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - 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: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6696 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6696 mSDsluCounter, 9583 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7169 mSDsCounter, 280 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2105 IncrementalHoareTripleChecker+Invalid, 2385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 280 mSolverCounterUnsat, 2414 mSDtfsCounter, 2105 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1059 GetRequests, 815 SyntacticMatches, 19 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4918occurred in iteration=18, InterpolantAutomatonStates: 219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 18734 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1236 ConstructedInterpolants, 0 QuantifiedInterpolants, 3004 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1797 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 38 InterpolantComputations, 12 PerfectInterpolantSequences, 1459/1809 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-16 03:10:05,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:10:07,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:10:07,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:10:07,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:10:07,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:10:07,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:10:07,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:10:07,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:10:07,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:10:07,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:10:07,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:10:07,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:10:07,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:10:07,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:10:07,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:10:07,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:10:07,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:10:07,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:10:07,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:10:07,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:10:07,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:10:07,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:10:07,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:10:07,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:10:07,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:10:07,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:10:07,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:10:07,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:10:07,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:10:07,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:10:07,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:10:07,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:10:07,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:10:07,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:10:07,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:10:07,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:10:07,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:10:07,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:10:07,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:10:07,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:10:07,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:10:07,848 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-16 03:10:07,881 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:10:07,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:10:07,882 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:10:07,883 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:10:07,884 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:10:07,884 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:10:07,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:10:07,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:10:07,885 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:10:07,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:10:07,886 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:10:07,886 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:10:07,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:10:07,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:10:07,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:10:07,887 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:10:07,887 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:10:07,887 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:10:07,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:10:07,888 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:10:07,888 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 03:10:07,888 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 03:10:07,888 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:10:07,888 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:10:07,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:10:07,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:10:07,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:10:07,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:10:07,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:10:07,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:10:07,890 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 03:10:07,890 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 03:10:07,890 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:10:07,891 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:10:07,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:10:07,891 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 03:10:07,891 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:10:07,891 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 -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2023-02-16 03:10:08,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:10:08,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:10:08,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:10:08,245 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:10:08,246 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:10:08,247 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2023-02-16 03:10:09,457 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:10:09,716 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:10:09,717 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2023-02-16 03:10:09,729 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c589290/c27f78ee86b14abd8fac7e0545d1fc3b/FLAG2a21ba05d [2023-02-16 03:10:09,745 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c589290/c27f78ee86b14abd8fac7e0545d1fc3b [2023-02-16 03:10:09,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:10:09,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:10:09,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:10:09,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:10:09,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:10:09,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:10:09" (1/1) ... [2023-02-16 03:10:09,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ce29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:09, skipping insertion in model container [2023-02-16 03:10:09,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:10:09" (1/1) ... [2023-02-16 03:10:09,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:10:09,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:10:10,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:10:10,056 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:10:10,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:10:10,143 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:10:10,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:10 WrapperNode [2023-02-16 03:10:10,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:10:10,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:10:10,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:10:10,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:10:10,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:10" (1/1) ... [2023-02-16 03:10:10,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:10" (1/1) ... [2023-02-16 03:10:10,212 INFO L138 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2023-02-16 03:10:10,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:10:10,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:10:10,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:10:10,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:10:10,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:10" (1/1) ... [2023-02-16 03:10:10,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:10" (1/1) ... [2023-02-16 03:10:10,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:10" (1/1) ... [2023-02-16 03:10:10,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:10" (1/1) ... [2023-02-16 03:10:10,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:10" (1/1) ... [2023-02-16 03:10:10,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:10" (1/1) ... [2023-02-16 03:10:10,258 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:10" (1/1) ... [2023-02-16 03:10:10,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:10" (1/1) ... [2023-02-16 03:10:10,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:10:10,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:10:10,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:10:10,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:10:10,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:10" (1/1) ... [2023-02-16 03:10:10,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:10:10,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:10:10,303 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-16 03:10:10,325 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-16 03:10:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-16 03:10:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:10:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:10:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:10:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:10:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:10:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-16 03:10:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 03:10:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:10:10,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:10:10,485 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:10:10,487 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:10:10,860 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:10:10,865 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:10:10,865 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 03:10:10,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:10:10 BoogieIcfgContainer [2023-02-16 03:10:10,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:10:10,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:10:10,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:10:10,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:10:10,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:10:09" (1/3) ... [2023-02-16 03:10:10,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df9e926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:10:10, skipping insertion in model container [2023-02-16 03:10:10,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:10" (2/3) ... [2023-02-16 03:10:10,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df9e926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:10:10, skipping insertion in model container [2023-02-16 03:10:10,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:10:10" (3/3) ... [2023-02-16 03:10:10,877 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2023-02-16 03:10:10,892 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:10:10,893 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2023-02-16 03:10:10,943 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:10:10,950 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;@53238d05, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:10:10,951 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-02-16 03:10:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-16 03:10:10,963 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:10,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-16 03:10:10,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:10,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash 28701640, now seen corresponding path program 1 times [2023-02-16 03:10:10,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:10,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796051882] [2023-02-16 03:10:10,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:10,982 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-16 03:10:10,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:10,985 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-16 03:10:10,986 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-16 03:10:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:11,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 03:10:11,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:11,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:11,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:11,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796051882] [2023-02-16 03:10:11,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796051882] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:11,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:11,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:10:11,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671367162] [2023-02-16 03:10:11,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:11,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:10:11,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:11,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:10:11,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:10:11,158 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:11,215 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2023-02-16 03:10:11,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:10:11,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-16 03:10:11,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:11,225 INFO L225 Difference]: With dead ends: 107 [2023-02-16 03:10:11,226 INFO L226 Difference]: Without dead ends: 105 [2023-02-16 03:10:11,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:10:11,230 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 63 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:11,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 134 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:10:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-16 03:10:11,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2023-02-16 03:10:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 86 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2023-02-16 03:10:11,258 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 5 [2023-02-16 03:10:11,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:11,258 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2023-02-16 03:10:11,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2023-02-16 03:10:11,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:10:11,259 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:11,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:10:11,276 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 (2)] Forceful destruction successful, exit code 0 [2023-02-16 03:10:11,470 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-16 03:10:11,471 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:11,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:11,471 INFO L85 PathProgramCache]: Analyzing trace with hash 889749439, now seen corresponding path program 1 times [2023-02-16 03:10:11,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:11,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729366139] [2023-02-16 03:10:11,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:11,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-16 03:10:11,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:11,521 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-16 03:10:11,524 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-16 03:10:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:11,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 03:10:11,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:11,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:11,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:11,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729366139] [2023-02-16 03:10:11,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729366139] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:11,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:11,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:10:11,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235343228] [2023-02-16 03:10:11,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:11,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:10:11,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:11,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:10:11,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:10:11,584 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:11,684 INFO L93 Difference]: Finished difference Result 163 states and 243 transitions. [2023-02-16 03:10:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:10:11,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-16 03:10:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:11,687 INFO L225 Difference]: With dead ends: 163 [2023-02-16 03:10:11,687 INFO L226 Difference]: Without dead ends: 160 [2023-02-16 03:10:11,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-16 03:10:11,689 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 62 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:11,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-16 03:10:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2023-02-16 03:10:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 139 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 229 transitions. [2023-02-16 03:10:11,702 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 229 transitions. Word has length 6 [2023-02-16 03:10:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:11,703 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 229 transitions. [2023-02-16 03:10:11,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 229 transitions. [2023-02-16 03:10:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:10:11,704 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:11,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:10:11,715 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-16 03:10:11,912 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-16 03:10:11,913 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:11,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:11,914 INFO L85 PathProgramCache]: Analyzing trace with hash 889692424, now seen corresponding path program 1 times [2023-02-16 03:10:11,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:11,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827823751] [2023-02-16 03:10:11,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:11,915 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-16 03:10:11,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:11,916 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-16 03:10:11,918 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-16 03:10:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:11,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 03:10:11,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:11,990 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 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:10:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:11,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:11,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:11,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827823751] [2023-02-16 03:10:11,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827823751] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:11,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:11,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:10:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486443270] [2023-02-16 03:10:11,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:11,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:10:11,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:11,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:10:11,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:10:11,999 INFO L87 Difference]: Start difference. First operand 140 states and 229 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:12,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:12,162 INFO L93 Difference]: Finished difference Result 211 states and 330 transitions. [2023-02-16 03:10:12,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:10:12,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-16 03:10:12,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:12,164 INFO L225 Difference]: With dead ends: 211 [2023-02-16 03:10:12,164 INFO L226 Difference]: Without dead ends: 211 [2023-02-16 03:10:12,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-16 03:10:12,166 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 64 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:12,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 163 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-16 03:10:12,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 190. [2023-02-16 03:10:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 172 states have (on average 1.8372093023255813) internal successors, (316), 189 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 316 transitions. [2023-02-16 03:10:12,181 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 316 transitions. Word has length 6 [2023-02-16 03:10:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:12,181 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 316 transitions. [2023-02-16 03:10:12,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 316 transitions. [2023-02-16 03:10:12,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:10:12,190 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:12,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:10:12,219 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-16 03:10:12,399 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-16 03:10:12,400 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:12,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:12,400 INFO L85 PathProgramCache]: Analyzing trace with hash 889692425, now seen corresponding path program 1 times [2023-02-16 03:10:12,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:12,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417235740] [2023-02-16 03:10:12,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:12,401 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-16 03:10:12,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:12,402 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-16 03:10:12,405 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-16 03:10:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:12,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:10:12,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:12,456 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 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:10:12,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:12,465 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:12,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:12,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417235740] [2023-02-16 03:10:12,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417235740] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:12,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:12,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:10:12,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793333247] [2023-02-16 03:10:12,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:12,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:10:12,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:12,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:10:12,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:10:12,468 INFO L87 Difference]: Start difference. First operand 190 states and 316 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:12,598 INFO L93 Difference]: Finished difference Result 206 states and 321 transitions. [2023-02-16 03:10:12,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:10:12,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-16 03:10:12,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:12,600 INFO L225 Difference]: With dead ends: 206 [2023-02-16 03:10:12,600 INFO L226 Difference]: Without dead ends: 206 [2023-02-16 03:10:12,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-16 03:10:12,601 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 63 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:12,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 169 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:12,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-02-16 03:10:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 188. [2023-02-16 03:10:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 172 states have (on average 1.7906976744186047) internal successors, (308), 187 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 308 transitions. [2023-02-16 03:10:12,636 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 308 transitions. Word has length 6 [2023-02-16 03:10:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:12,636 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 308 transitions. [2023-02-16 03:10:12,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 308 transitions. [2023-02-16 03:10:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-16 03:10:12,637 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:12,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:12,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 (5)] Forceful destruction successful, exit code 0 [2023-02-16 03:10:12,837 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-16 03:10:12,838 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:12,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:12,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1810669365, now seen corresponding path program 1 times [2023-02-16 03:10:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:12,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331220163] [2023-02-16 03:10:12,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:12,839 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-16 03:10:12,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:12,842 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-16 03:10:12,846 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-16 03:10:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:12,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:10:12,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:12,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:12,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:12,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331220163] [2023-02-16 03:10:12,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331220163] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:12,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:12,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:10:12,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335864892] [2023-02-16 03:10:12,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:12,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:10:12,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:12,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:10:12,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:10:12,914 INFO L87 Difference]: Start difference. First operand 188 states and 308 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:12,963 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2023-02-16 03:10:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:10:12,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-16 03:10:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:12,965 INFO L225 Difference]: With dead ends: 211 [2023-02-16 03:10:12,965 INFO L226 Difference]: Without dead ends: 211 [2023-02-16 03:10:12,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-16 03:10:12,972 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 101 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:12,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 229 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:10:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-16 03:10:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 144. [2023-02-16 03:10:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 143 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 229 transitions. [2023-02-16 03:10:12,985 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 229 transitions. Word has length 7 [2023-02-16 03:10:12,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:12,985 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 229 transitions. [2023-02-16 03:10:12,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 229 transitions. [2023-02-16 03:10:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-16 03:10:12,986 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:12,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:12,997 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-16 03:10:13,195 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-16 03:10:13,195 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:13,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:13,196 INFO L85 PathProgramCache]: Analyzing trace with hash 347531241, now seen corresponding path program 1 times [2023-02-16 03:10:13,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:13,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547469805] [2023-02-16 03:10:13,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:13,197 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-16 03:10:13,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:13,198 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-16 03:10:13,201 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-16 03:10:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:13,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:10:13,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:13,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:13,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:13,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547469805] [2023-02-16 03:10:13,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547469805] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:13,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:13,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:10:13,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754632625] [2023-02-16 03:10:13,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:13,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:10:13,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:13,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:10:13,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:10:13,254 INFO L87 Difference]: Start difference. First operand 144 states and 229 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:13,293 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2023-02-16 03:10:13,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:10:13,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-16 03:10:13,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:13,295 INFO L225 Difference]: With dead ends: 283 [2023-02-16 03:10:13,296 INFO L226 Difference]: Without dead ends: 283 [2023-02-16 03:10:13,296 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-16 03:10:13,298 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:13,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 196 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:10:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-02-16 03:10:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 198. [2023-02-16 03:10:13,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 186 states have (on average 1.6559139784946237) internal successors, (308), 197 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 308 transitions. [2023-02-16 03:10:13,321 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 308 transitions. Word has length 8 [2023-02-16 03:10:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:13,321 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 308 transitions. [2023-02-16 03:10:13,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 308 transitions. [2023-02-16 03:10:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:10:13,322 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:13,322 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:13,333 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-16 03:10:13,532 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-16 03:10:13,533 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:13,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:13,534 INFO L85 PathProgramCache]: Analyzing trace with hash -527615340, now seen corresponding path program 1 times [2023-02-16 03:10:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:13,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499903568] [2023-02-16 03:10:13,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:13,534 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-16 03:10:13,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:13,536 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-16 03:10:13,536 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-16 03:10:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:13,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:10:13,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:13,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:13,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:13,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:13,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499903568] [2023-02-16 03:10:13,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499903568] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:13,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:13,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-02-16 03:10:13,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054736172] [2023-02-16 03:10:13,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:13,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:10:13,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:13,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:10:13,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:10:13,678 INFO L87 Difference]: Start difference. First operand 198 states and 308 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:13,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:13,781 INFO L93 Difference]: Finished difference Result 461 states and 690 transitions. [2023-02-16 03:10:13,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:10:13,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-16 03:10:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:13,785 INFO L225 Difference]: With dead ends: 461 [2023-02-16 03:10:13,786 INFO L226 Difference]: Without dead ends: 461 [2023-02-16 03:10:13,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:10:13,788 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 221 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:13,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 471 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:13,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2023-02-16 03:10:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 258. [2023-02-16 03:10:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 246 states have (on average 1.6016260162601625) internal successors, (394), 257 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 394 transitions. [2023-02-16 03:10:13,797 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 394 transitions. Word has length 12 [2023-02-16 03:10:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:13,797 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 394 transitions. [2023-02-16 03:10:13,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:13,798 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 394 transitions. [2023-02-16 03:10:13,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:10:13,799 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:13,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:13,809 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-16 03:10:14,008 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-16 03:10:14,008 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:14,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:14,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2027186576, now seen corresponding path program 1 times [2023-02-16 03:10:14,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:14,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531736334] [2023-02-16 03:10:14,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:14,010 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-16 03:10:14,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:14,011 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-16 03:10:14,012 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-16 03:10:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:14,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:10:14,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:14,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:14,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:14,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531736334] [2023-02-16 03:10:14,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531736334] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:14,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:14,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-02-16 03:10:14,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450034796] [2023-02-16 03:10:14,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:14,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:10:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:14,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:10:14,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:10:14,130 INFO L87 Difference]: Start difference. First operand 258 states and 394 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:14,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:14,169 INFO L93 Difference]: Finished difference Result 600 states and 886 transitions. [2023-02-16 03:10:14,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:10:14,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-16 03:10:14,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:14,173 INFO L225 Difference]: With dead ends: 600 [2023-02-16 03:10:14,173 INFO L226 Difference]: Without dead ends: 600 [2023-02-16 03:10:14,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:10:14,174 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 210 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:14,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 343 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:10:14,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2023-02-16 03:10:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 576. [2023-02-16 03:10:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 564 states have (on average 1.570921985815603) internal successors, (886), 575 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 886 transitions. [2023-02-16 03:10:14,188 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 886 transitions. Word has length 12 [2023-02-16 03:10:14,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:14,188 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 886 transitions. [2023-02-16 03:10:14,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 886 transitions. [2023-02-16 03:10:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:10:14,189 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:14,190 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:14,204 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-16 03:10:14,399 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-16 03:10:14,399 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:14,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:14,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1582579647, now seen corresponding path program 2 times [2023-02-16 03:10:14,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:14,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217538608] [2023-02-16 03:10:14,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:10:14,400 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-16 03:10:14,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:14,402 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-16 03:10:14,405 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-16 03:10:14,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:10:14,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:10:14,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:10:14,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:14,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:14,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:14,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217538608] [2023-02-16 03:10:14,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217538608] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:14,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:14,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-16 03:10:14,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6457776] [2023-02-16 03:10:14,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:14,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:10:14,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:14,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:10:14,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:10:14,497 INFO L87 Difference]: Start difference. First operand 576 states and 886 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:14,580 INFO L93 Difference]: Finished difference Result 998 states and 1530 transitions. [2023-02-16 03:10:14,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:10:14,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-16 03:10:14,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:14,585 INFO L225 Difference]: With dead ends: 998 [2023-02-16 03:10:14,585 INFO L226 Difference]: Without dead ends: 998 [2023-02-16 03:10:14,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:10:14,587 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 193 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:14,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 336 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:10:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2023-02-16 03:10:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 968. [2023-02-16 03:10:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 956 states have (on average 1.5502092050209204) internal successors, (1482), 967 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1482 transitions. [2023-02-16 03:10:14,619 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1482 transitions. Word has length 16 [2023-02-16 03:10:14,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:14,620 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 1482 transitions. [2023-02-16 03:10:14,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:14,620 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1482 transitions. [2023-02-16 03:10:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 03:10:14,621 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:14,621 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:14,639 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 (10)] Forceful destruction successful, exit code 0 [2023-02-16 03:10:14,833 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-16 03:10:14,834 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:14,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:14,834 INFO L85 PathProgramCache]: Analyzing trace with hash -480845608, now seen corresponding path program 1 times [2023-02-16 03:10:14,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:14,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556723747] [2023-02-16 03:10:14,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:14,835 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-16 03:10:14,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:14,836 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-16 03:10:14,839 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-16 03:10:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:14,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 03:10:14,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:14,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:14,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:14,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556723747] [2023-02-16 03:10:14,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556723747] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:14,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:14,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2023-02-16 03:10:14,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647205544] [2023-02-16 03:10:14,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:14,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:10:14,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:14,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:10:14,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:10:14,969 INFO L87 Difference]: Start difference. First operand 968 states and 1482 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:15,037 INFO L93 Difference]: Finished difference Result 1243 states and 1844 transitions. [2023-02-16 03:10:15,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:10:15,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-16 03:10:15,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:15,042 INFO L225 Difference]: With dead ends: 1243 [2023-02-16 03:10:15,042 INFO L226 Difference]: Without dead ends: 1243 [2023-02-16 03:10:15,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-16 03:10:15,044 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 89 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:15,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 192 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:15,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2023-02-16 03:10:15,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1100. [2023-02-16 03:10:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1088 states have (on average 1.5110294117647058) internal successors, (1644), 1099 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1644 transitions. [2023-02-16 03:10:15,065 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1644 transitions. Word has length 18 [2023-02-16 03:10:15,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:15,065 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1644 transitions. [2023-02-16 03:10:15,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:15,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1644 transitions. [2023-02-16 03:10:15,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 03:10:15,069 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:15,070 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:15,081 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-16 03:10:15,281 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-16 03:10:15,281 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:15,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:15,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1323238580, now seen corresponding path program 1 times [2023-02-16 03:10:15,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:15,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485060663] [2023-02-16 03:10:15,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:15,283 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-16 03:10:15,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:15,284 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-16 03:10:15,284 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-16 03:10:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:15,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:10:15,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:15,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:15,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:15,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:15,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485060663] [2023-02-16 03:10:15,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485060663] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:15,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:15,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-02-16 03:10:15,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900328079] [2023-02-16 03:10:15,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:15,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:10:15,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:15,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:10:15,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:10:15,420 INFO L87 Difference]: Start difference. First operand 1100 states and 1644 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:15,501 INFO L93 Difference]: Finished difference Result 1384 states and 1990 transitions. [2023-02-16 03:10:15,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:10:15,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-16 03:10:15,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:15,506 INFO L225 Difference]: With dead ends: 1384 [2023-02-16 03:10:15,506 INFO L226 Difference]: Without dead ends: 1384 [2023-02-16 03:10:15,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:10:15,507 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 201 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:15,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 539 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:10:15,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2023-02-16 03:10:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1009. [2023-02-16 03:10:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 997 states have (on average 1.4794383149448345) internal successors, (1475), 1008 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1475 transitions. [2023-02-16 03:10:15,527 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1475 transitions. Word has length 21 [2023-02-16 03:10:15,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:15,528 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1475 transitions. [2023-02-16 03:10:15,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1475 transitions. [2023-02-16 03:10:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:10:15,529 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:15,529 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:15,541 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-16 03:10:15,738 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-16 03:10:15,738 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:15,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:15,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2034622781, now seen corresponding path program 2 times [2023-02-16 03:10:15,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:15,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799943357] [2023-02-16 03:10:15,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:10:15,739 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-16 03:10:15,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:15,741 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-16 03:10:15,742 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-16 03:10:15,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:10:15,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:10:15,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:10:15,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:10:15,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:15,875 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:10:15,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:15,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799943357] [2023-02-16 03:10:15,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799943357] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:15,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:15,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-16 03:10:15,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055582168] [2023-02-16 03:10:15,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:15,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:10:15,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:15,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:10:15,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:10:15,881 INFO L87 Difference]: Start difference. First operand 1009 states and 1475 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:15,949 INFO L93 Difference]: Finished difference Result 994 states and 1410 transitions. [2023-02-16 03:10:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:10:15,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-16 03:10:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:15,953 INFO L225 Difference]: With dead ends: 994 [2023-02-16 03:10:15,953 INFO L226 Difference]: Without dead ends: 994 [2023-02-16 03:10:15,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:10:15,954 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 171 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:15,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 522 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:10:15,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2023-02-16 03:10:15,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 970. [2023-02-16 03:10:15,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 958 states have (on average 1.4718162839248434) internal successors, (1410), 969 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1410 transitions. [2023-02-16 03:10:15,971 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1410 transitions. Word has length 27 [2023-02-16 03:10:15,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:15,972 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1410 transitions. [2023-02-16 03:10:15,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1410 transitions. [2023-02-16 03:10:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:10:15,972 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:15,973 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:15,987 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 (13)] Forceful destruction successful, exit code 0 [2023-02-16 03:10:16,182 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-16 03:10:16,182 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:16,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:16,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1432941687, now seen corresponding path program 1 times [2023-02-16 03:10:16,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:16,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305985360] [2023-02-16 03:10:16,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:16,183 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-16 03:10:16,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:16,184 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-16 03:10:16,185 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-16 03:10:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:16,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 03:10:16,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:16,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:16,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:16,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305985360] [2023-02-16 03:10:16,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305985360] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:16,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:16,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-02-16 03:10:16,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961880316] [2023-02-16 03:10:16,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:16,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:10:16,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:16,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:10:16,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:10:16,341 INFO L87 Difference]: Start difference. First operand 970 states and 1410 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:16,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:16,439 INFO L93 Difference]: Finished difference Result 1049 states and 1452 transitions. [2023-02-16 03:10:16,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:10:16,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-16 03:10:16,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:16,443 INFO L225 Difference]: With dead ends: 1049 [2023-02-16 03:10:16,443 INFO L226 Difference]: Without dead ends: 1049 [2023-02-16 03:10:16,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:10:16,444 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 233 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:16,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 808 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2023-02-16 03:10:16,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 892. [2023-02-16 03:10:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 880 states have (on average 1.4397727272727272) internal successors, (1267), 891 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1267 transitions. [2023-02-16 03:10:16,460 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1267 transitions. Word has length 27 [2023-02-16 03:10:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:16,460 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 1267 transitions. [2023-02-16 03:10:16,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1267 transitions. [2023-02-16 03:10:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:10:16,461 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:16,461 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:16,477 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-16 03:10:16,670 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-16 03:10:16,670 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1945741357, now seen corresponding path program 1 times [2023-02-16 03:10:16,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:16,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980897832] [2023-02-16 03:10:16,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:16,671 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-16 03:10:16,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:16,672 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-16 03:10:16,673 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-16 03:10:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:16,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:10:16,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:16,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:17,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:17,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980897832] [2023-02-16 03:10:17,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980897832] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:17,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:17,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2023-02-16 03:10:17,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037691189] [2023-02-16 03:10:17,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:17,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:10:17,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:17,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:10:17,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:10:17,072 INFO L87 Difference]: Start difference. First operand 892 states and 1267 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:17,444 INFO L93 Difference]: Finished difference Result 1882 states and 2629 transitions. [2023-02-16 03:10:17,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-16 03:10:17,444 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-16 03:10:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:17,450 INFO L225 Difference]: With dead ends: 1882 [2023-02-16 03:10:17,450 INFO L226 Difference]: Without dead ends: 1882 [2023-02-16 03:10:17,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2023-02-16 03:10:17,452 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 649 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:17,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1500 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2023-02-16 03:10:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1834. [2023-02-16 03:10:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1822 states have (on average 1.442919868276619) internal successors, (2629), 1833 states have internal predecessors, (2629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2629 transitions. [2023-02-16 03:10:17,481 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2629 transitions. Word has length 30 [2023-02-16 03:10:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:17,482 INFO L495 AbstractCegarLoop]: Abstraction has 1834 states and 2629 transitions. [2023-02-16 03:10:17,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:17,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2629 transitions. [2023-02-16 03:10:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:10:17,484 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:17,484 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:17,499 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-16 03:10:17,693 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-16 03:10:17,694 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:17,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:17,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1575281728, now seen corresponding path program 1 times [2023-02-16 03:10:17,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:17,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782279689] [2023-02-16 03:10:17,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:17,695 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-16 03:10:17,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:17,696 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-16 03:10:17,697 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-16 03:10:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:17,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:10:17,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:17,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:17,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:17,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782279689] [2023-02-16 03:10:17,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782279689] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:17,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:17,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2023-02-16 03:10:17,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453780426] [2023-02-16 03:10:17,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:17,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:10:17,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:17,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:10:17,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:10:17,894 INFO L87 Difference]: Start difference. First operand 1834 states and 2629 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:18,030 INFO L93 Difference]: Finished difference Result 2281 states and 3205 transitions. [2023-02-16 03:10:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:10:18,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-16 03:10:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:18,037 INFO L225 Difference]: With dead ends: 2281 [2023-02-16 03:10:18,037 INFO L226 Difference]: Without dead ends: 2281 [2023-02-16 03:10:18,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:10:18,038 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 274 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:18,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1139 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:18,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2023-02-16 03:10:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 1782. [2023-02-16 03:10:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1770 states have (on average 1.426553672316384) internal successors, (2525), 1781 states have internal predecessors, (2525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2525 transitions. [2023-02-16 03:10:18,072 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2525 transitions. Word has length 33 [2023-02-16 03:10:18,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:18,072 INFO L495 AbstractCegarLoop]: Abstraction has 1782 states and 2525 transitions. [2023-02-16 03:10:18,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:18,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2525 transitions. [2023-02-16 03:10:18,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:10:18,073 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:18,073 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:18,088 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-16 03:10:18,282 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-16 03:10:18,283 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:18,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:18,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1822753242, now seen corresponding path program 1 times [2023-02-16 03:10:18,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:18,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857775195] [2023-02-16 03:10:18,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:18,284 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-16 03:10:18,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:18,285 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-16 03:10:18,288 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-16 03:10:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:18,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:10:18,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:18,454 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:18,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:18,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:18,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857775195] [2023-02-16 03:10:18,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857775195] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:18,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:18,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-16 03:10:18,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704834644] [2023-02-16 03:10:18,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:18,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:10:18,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:18,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:10:18,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:10:18,521 INFO L87 Difference]: Start difference. First operand 1782 states and 2525 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:18,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:18,692 INFO L93 Difference]: Finished difference Result 2267 states and 3153 transitions. [2023-02-16 03:10:18,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 03:10:18,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-02-16 03:10:18,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:18,701 INFO L225 Difference]: With dead ends: 2267 [2023-02-16 03:10:18,701 INFO L226 Difference]: Without dead ends: 2267 [2023-02-16 03:10:18,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-02-16 03:10:18,701 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 340 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:18,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1561 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:10:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2023-02-16 03:10:18,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1756. [2023-02-16 03:10:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1744 states have (on average 1.4180045871559632) internal successors, (2473), 1755 states have internal predecessors, (2473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2473 transitions. [2023-02-16 03:10:18,734 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2473 transitions. Word has length 41 [2023-02-16 03:10:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:18,734 INFO L495 AbstractCegarLoop]: Abstraction has 1756 states and 2473 transitions. [2023-02-16 03:10:18,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2473 transitions. [2023-02-16 03:10:18,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-16 03:10:18,735 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:18,736 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:18,749 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-16 03:10:18,945 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-16 03:10:18,945 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:18,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:18,946 INFO L85 PathProgramCache]: Analyzing trace with hash 685518324, now seen corresponding path program 2 times [2023-02-16 03:10:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:18,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330300485] [2023-02-16 03:10:18,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:10:18,946 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-16 03:10:18,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:18,947 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-16 03:10:18,948 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-16 03:10:19,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:10:19,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:10:19,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 03:10:19,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:10:19,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:10:19,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:19,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330300485] [2023-02-16 03:10:19,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330300485] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:19,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:19,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2023-02-16 03:10:19,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327805660] [2023-02-16 03:10:19,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:19,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 03:10:19,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:19,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 03:10:19,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:10:19,516 INFO L87 Difference]: Start difference. First operand 1756 states and 2473 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:19,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:19,996 INFO L93 Difference]: Finished difference Result 2042 states and 2790 transitions. [2023-02-16 03:10:19,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-16 03:10:19,997 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-02-16 03:10:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:20,001 INFO L225 Difference]: With dead ends: 2042 [2023-02-16 03:10:20,002 INFO L226 Difference]: Without dead ends: 2042 [2023-02-16 03:10:20,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2023-02-16 03:10:20,002 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 862 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1970 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:20,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1970 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:10:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2023-02-16 03:10:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1982. [2023-02-16 03:10:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1970 states have (on average 1.416243654822335) internal successors, (2790), 1981 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2790 transitions. [2023-02-16 03:10:20,042 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2790 transitions. Word has length 49 [2023-02-16 03:10:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:20,042 INFO L495 AbstractCegarLoop]: Abstraction has 1982 states and 2790 transitions. [2023-02-16 03:10:20,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:10:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2790 transitions. [2023-02-16 03:10:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-16 03:10:20,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:20,044 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:20,056 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-16 03:10:20,253 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-16 03:10:20,254 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-16 03:10:20,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:20,255 INFO L85 PathProgramCache]: Analyzing trace with hash 34201258, now seen corresponding path program 1 times [2023-02-16 03:10:20,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:20,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546608413] [2023-02-16 03:10:20,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:20,256 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-16 03:10:20,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:20,257 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-16 03:10:20,260 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-16 03:10:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 03:10:20,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 03:10:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 03:10:20,469 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-16 03:10:20,485 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 03:10:20,486 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2023-02-16 03:10:20,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2023-02-16 03:10:20,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2023-02-16 03:10:20,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2023-02-16 03:10:20,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2023-02-16 03:10:20,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2023-02-16 03:10:20,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2023-02-16 03:10:20,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2023-02-16 03:10:20,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2023-02-16 03:10:20,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2023-02-16 03:10:20,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2023-02-16 03:10:20,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2023-02-16 03:10:20,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2023-02-16 03:10:20,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2023-02-16 03:10:20,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2023-02-16 03:10:20,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2023-02-16 03:10:20,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2023-02-16 03:10:20,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2023-02-16 03:10:20,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2023-02-16 03:10:20,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2023-02-16 03:10:20,511 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 (19)] Forceful destruction successful, exit code 0 [2023-02-16 03:10:20,701 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-16 03:10:20,704 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:20,707 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 03:10:20,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 03:10:20 BoogieIcfgContainer [2023-02-16 03:10:20,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 03:10:20,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 03:10:20,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 03:10:20,763 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 03:10:20,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:10:10" (3/4) ... [2023-02-16 03:10:20,765 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-16 03:10:20,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 03:10:20,766 INFO L158 Benchmark]: Toolchain (without parser) took 11017.69ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 47.1MB in the beginning and 43.9MB in the end (delta: 3.2MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2023-02-16 03:10:20,766 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 50.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:10:20,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.92ms. Allocated memory is still 71.3MB. Free memory was 46.9MB in the beginning and 45.5MB in the end (delta: 1.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2023-02-16 03:10:20,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.69ms. Allocated memory is still 71.3MB. Free memory was 45.5MB in the beginning and 43.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 03:10:20,767 INFO L158 Benchmark]: Boogie Preprocessor took 52.50ms. Allocated memory is still 71.3MB. Free memory was 43.3MB in the beginning and 41.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 03:10:20,768 INFO L158 Benchmark]: RCFGBuilder took 602.05ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 41.3MB in the beginning and 53.4MB in the end (delta: -12.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2023-02-16 03:10:20,768 INFO L158 Benchmark]: TraceAbstraction took 9890.98ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 52.9MB in the beginning and 43.9MB in the end (delta: 9.0MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2023-02-16 03:10:20,769 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 104.9MB. Free memory is still 43.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:10:20,776 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.19ms. Allocated memory is still 58.7MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 50.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.92ms. Allocated memory is still 71.3MB. Free memory was 46.9MB in the beginning and 45.5MB in the end (delta: 1.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.69ms. Allocated memory is still 71.3MB. Free memory was 45.5MB in the beginning and 43.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.50ms. Allocated memory is still 71.3MB. Free memory was 43.3MB in the beginning and 41.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 602.05ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 41.3MB in the beginning and 53.4MB in the end (delta: -12.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9890.98ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 52.9MB in the beginning and 43.9MB in the end (delta: 9.0MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 104.9MB. Free memory is still 43.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L542] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L548] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - 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: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3899 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3899 mSDsluCounter, 10388 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8027 mSDsCounter, 270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1188 IncrementalHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 270 mSolverCounterUnsat, 2361 mSDtfsCounter, 1188 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 644 GetRequests, 499 SyntacticMatches, 6 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1982occurred in iteration=17, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 2303 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 582 ConstructedInterpolants, 0 QuantifiedInterpolants, 2215 SizeOfPredicates, 44 NumberOfNonLiveVariables, 1510 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 200/538 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-16 03:10:20,794 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