./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf75d7f1708750397c6bdac14ac08b964b10a95dcecc15b57a02c9969977c6ec --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 07:05:42,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 07:05:42,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 07:05:42,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 07:05:42,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 07:05:42,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 07:05:42,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 07:05:42,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 07:05:42,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 07:05:42,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 07:05:42,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 07:05:42,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 07:05:42,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 07:05:42,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 07:05:42,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 07:05:42,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 07:05:42,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 07:05:42,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 07:05:42,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 07:05:42,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 07:05:42,360 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 07:05:42,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 07:05:42,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 07:05:42,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 07:05:42,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 07:05:42,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 07:05:42,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 07:05:42,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 07:05:42,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 07:05:42,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 07:05:42,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 07:05:42,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 07:05:42,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 07:05:42,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 07:05:42,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 07:05:42,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 07:05:42,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 07:05:42,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 07:05:42,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 07:05:42,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 07:05:42,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 07:05:42,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 07:05:42,378 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 07:05:42,399 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 07:05:42,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 07:05:42,400 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 07:05:42,400 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 07:05:42,401 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 07:05:42,401 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 07:05:42,401 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 07:05:42,401 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 07:05:42,402 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 07:05:42,402 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 07:05:42,402 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 07:05:42,403 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 07:05:42,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 07:05:42,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 07:05:42,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 07:05:42,403 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 07:05:42,403 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 07:05:42,404 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 07:05:42,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 07:05:42,404 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 07:05:42,404 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 07:05:42,404 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 07:05:42,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 07:05:42,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 07:05:42,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 07:05:42,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:05:42,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 07:05:42,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 07:05:42,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 07:05:42,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 07:05:42,406 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf75d7f1708750397c6bdac14ac08b964b10a95dcecc15b57a02c9969977c6ec [2022-07-14 07:05:42,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 07:05:42,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 07:05:42,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 07:05:42,635 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 07:05:42,636 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 07:05:42,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-07-14 07:05:42,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ec6f25e/5b6116725216432fba5516258e8e46ec/FLAG3c5188866 [2022-07-14 07:05:43,090 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 07:05:43,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-07-14 07:05:43,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ec6f25e/5b6116725216432fba5516258e8e46ec/FLAG3c5188866 [2022-07-14 07:05:43,470 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ec6f25e/5b6116725216432fba5516258e8e46ec [2022-07-14 07:05:43,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 07:05:43,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 07:05:43,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 07:05:43,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 07:05:43,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 07:05:43,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:05:43" (1/1) ... [2022-07-14 07:05:43,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba66ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:43, skipping insertion in model container [2022-07-14 07:05:43,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:05:43" (1/1) ... [2022-07-14 07:05:43,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 07:05:43,533 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 07:05:43,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-07-14 07:05:43,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:05:43,792 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 07:05:43,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-07-14 07:05:43,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:05:43,872 INFO L208 MainTranslator]: Completed translation [2022-07-14 07:05:43,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:43 WrapperNode [2022-07-14 07:05:43,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 07:05:43,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 07:05:43,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 07:05:43,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 07:05:43,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:43" (1/1) ... [2022-07-14 07:05:43,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:43" (1/1) ... [2022-07-14 07:05:43,939 INFO L137 Inliner]: procedures = 29, calls = 43, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 662 [2022-07-14 07:05:43,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 07:05:43,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 07:05:43,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 07:05:43,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 07:05:43,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:43" (1/1) ... [2022-07-14 07:05:43,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:43" (1/1) ... [2022-07-14 07:05:43,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:43" (1/1) ... [2022-07-14 07:05:43,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:43" (1/1) ... [2022-07-14 07:05:43,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:43" (1/1) ... [2022-07-14 07:05:43,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:43" (1/1) ... [2022-07-14 07:05:43,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:43" (1/1) ... [2022-07-14 07:05:43,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 07:05:43,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 07:05:43,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 07:05:43,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 07:05:43,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:43" (1/1) ... [2022-07-14 07:05:43,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:05:44,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:05:44,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 07:05:44,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 07:05:44,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 07:05:44,056 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-07-14 07:05:44,056 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-07-14 07:05:44,056 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-14 07:05:44,056 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-14 07:05:44,056 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-07-14 07:05:44,056 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-07-14 07:05:44,056 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-14 07:05:44,057 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-14 07:05:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-14 07:05:44,057 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-14 07:05:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 07:05:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-14 07:05:44,057 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-14 07:05:44,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 07:05:44,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 07:05:44,058 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-07-14 07:05:44,058 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-07-14 07:05:44,143 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 07:05:44,145 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 07:05:44,234 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:44,238 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:44,240 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:44,244 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:44,246 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:44,535 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-07-14 07:05:44,535 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-07-14 07:05:44,535 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-07-14 07:05:44,536 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-07-14 07:05:44,536 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-07-14 07:05:44,536 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-07-14 07:05:44,536 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-14 07:05:44,536 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-14 07:05:44,536 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-07-14 07:05:44,536 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-07-14 07:05:44,558 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:44,579 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-14 07:05:44,580 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-14 07:05:44,585 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 07:05:44,595 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 07:05:44,597 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 07:05:44,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:05:44 BoogieIcfgContainer [2022-07-14 07:05:44,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 07:05:44,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 07:05:44,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 07:05:44,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 07:05:44,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 07:05:43" (1/3) ... [2022-07-14 07:05:44,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32751c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:05:44, skipping insertion in model container [2022-07-14 07:05:44,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:43" (2/3) ... [2022-07-14 07:05:44,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32751c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:05:44, skipping insertion in model container [2022-07-14 07:05:44,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:05:44" (3/3) ... [2022-07-14 07:05:44,606 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2022-07-14 07:05:44,618 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 07:05:44,618 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-14 07:05:44,659 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 07:05:44,664 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@44a47550, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6942d0c [2022-07-14 07:05:44,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-14 07:05:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 171 states have (on average 1.6023391812865497) internal successors, (274), 189 states have internal predecessors, (274), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-07-14 07:05:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 07:05:44,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:44,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:44,677 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:44,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:44,682 INFO L85 PathProgramCache]: Analyzing trace with hash -15799124, now seen corresponding path program 1 times [2022-07-14 07:05:44,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:44,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119902059] [2022-07-14 07:05:44,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:44,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:44,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:44,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119902059] [2022-07-14 07:05:44,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119902059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:44,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:44,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:05:44,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755108642] [2022-07-14 07:05:44,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:44,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:05:44,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:44,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:05:44,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:44,874 INFO L87 Difference]: Start difference. First operand has 209 states, 171 states have (on average 1.6023391812865497) internal successors, (274), 189 states have internal predecessors, (274), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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) [2022-07-14 07:05:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:44,948 INFO L93 Difference]: Finished difference Result 211 states and 314 transitions. [2022-07-14 07:05:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:05:44,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) 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 [2022-07-14 07:05:44,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:44,963 INFO L225 Difference]: With dead ends: 211 [2022-07-14 07:05:44,963 INFO L226 Difference]: Without dead ends: 207 [2022-07-14 07:05:44,965 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 [2022-07-14 07:05:44,969 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 179 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:44,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 417 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-14 07:05:45,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2022-07-14 07:05:45,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 169 states have (on average 1.5739644970414202) internal successors, (266), 185 states have internal predecessors, (266), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 07:05:45,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 309 transitions. [2022-07-14 07:05:45,016 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 309 transitions. Word has length 8 [2022-07-14 07:05:45,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:45,017 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 309 transitions. [2022-07-14 07:05:45,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) 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) [2022-07-14 07:05:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 309 transitions. [2022-07-14 07:05:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 07:05:45,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:45,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:45,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 07:05:45,020 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:45,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:45,021 INFO L85 PathProgramCache]: Analyzing trace with hash -191249987, now seen corresponding path program 1 times [2022-07-14 07:05:45,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:45,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768863014] [2022-07-14 07:05:45,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:45,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:45,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:45,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:45,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768863014] [2022-07-14 07:05:45,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768863014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:45,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:45,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:05:45,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462129838] [2022-07-14 07:05:45,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:45,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:05:45,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:45,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:05:45,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:45,073 INFO L87 Difference]: Start difference. First operand 205 states and 309 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:05:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:45,107 INFO L93 Difference]: Finished difference Result 204 states and 308 transitions. [2022-07-14 07:05:45,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:05:45,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-07-14 07:05:45,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:45,113 INFO L225 Difference]: With dead ends: 204 [2022-07-14 07:05:45,114 INFO L226 Difference]: Without dead ends: 198 [2022-07-14 07:05:45,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:45,116 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 199 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:45,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 372 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-14 07:05:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-07-14 07:05:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 163 states have (on average 1.5276073619631902) internal successors, (249), 178 states have internal predecessors, (249), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 07:05:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 292 transitions. [2022-07-14 07:05:45,139 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 292 transitions. Word has length 15 [2022-07-14 07:05:45,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:45,139 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 292 transitions. [2022-07-14 07:05:45,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:05:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 292 transitions. [2022-07-14 07:05:45,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 07:05:45,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:45,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:45,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 07:05:45,142 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:45,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:45,146 INFO L85 PathProgramCache]: Analyzing trace with hash 705160586, now seen corresponding path program 1 times [2022-07-14 07:05:45,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:45,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422900966] [2022-07-14 07:05:45,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:45,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:45,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:45,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422900966] [2022-07-14 07:05:45,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422900966] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:45,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:45,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:05:45,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654982890] [2022-07-14 07:05:45,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:45,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:05:45,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:45,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:05:45,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:45,208 INFO L87 Difference]: Start difference. First operand 198 states and 292 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:05:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:45,298 INFO L93 Difference]: Finished difference Result 263 states and 373 transitions. [2022-07-14 07:05:45,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:05:45,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-14 07:05:45,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:45,300 INFO L225 Difference]: With dead ends: 263 [2022-07-14 07:05:45,300 INFO L226 Difference]: Without dead ends: 262 [2022-07-14 07:05:45,301 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 [2022-07-14 07:05:45,304 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 201 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:45,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 428 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:05:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-14 07:05:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 249. [2022-07-14 07:05:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 213 states have (on average 1.431924882629108) internal successors, (305), 215 states have internal predecessors, (305), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (27), 25 states have call predecessors, (27), 18 states have call successors, (27) [2022-07-14 07:05:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 357 transitions. [2022-07-14 07:05:45,320 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 357 transitions. Word has length 19 [2022-07-14 07:05:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:45,320 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 357 transitions. [2022-07-14 07:05:45,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:05:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 357 transitions. [2022-07-14 07:05:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 07:05:45,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:45,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:45,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 07:05:45,321 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:45,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:45,322 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043499, now seen corresponding path program 1 times [2022-07-14 07:05:45,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:45,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831675687] [2022-07-14 07:05:45,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:45,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:45,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:45,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831675687] [2022-07-14 07:05:45,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831675687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:45,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:45,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:05:45,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041336959] [2022-07-14 07:05:45,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:45,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:05:45,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:45,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:05:45,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:45,372 INFO L87 Difference]: Start difference. First operand 249 states and 357 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:05:45,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:45,384 INFO L93 Difference]: Finished difference Result 306 states and 428 transitions. [2022-07-14 07:05:45,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:05:45,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 07:05:45,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:45,386 INFO L225 Difference]: With dead ends: 306 [2022-07-14 07:05:45,386 INFO L226 Difference]: Without dead ends: 306 [2022-07-14 07:05:45,386 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 [2022-07-14 07:05:45,387 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 238 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:45,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 352 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:45,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-14 07:05:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 287. [2022-07-14 07:05:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 253 states have (on average 1.4189723320158103) internal successors, (359), 253 states have internal predecessors, (359), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-14 07:05:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 406 transitions. [2022-07-14 07:05:45,397 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 406 transitions. Word has length 18 [2022-07-14 07:05:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:45,397 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 406 transitions. [2022-07-14 07:05:45,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:05:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 406 transitions. [2022-07-14 07:05:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 07:05:45,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:45,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:45,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 07:05:45,399 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:45,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:45,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1374657914, now seen corresponding path program 1 times [2022-07-14 07:05:45,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:45,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089810146] [2022-07-14 07:05:45,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:45,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:45,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:45,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089810146] [2022-07-14 07:05:45,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089810146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:45,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:45,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:05:45,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648825470] [2022-07-14 07:05:45,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:45,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:05:45,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:45,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:05:45,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:45,456 INFO L87 Difference]: Start difference. First operand 287 states and 406 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:05:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:45,497 INFO L93 Difference]: Finished difference Result 286 states and 403 transitions. [2022-07-14 07:05:45,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:05:45,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-14 07:05:45,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:45,499 INFO L225 Difference]: With dead ends: 286 [2022-07-14 07:05:45,499 INFO L226 Difference]: Without dead ends: 286 [2022-07-14 07:05:45,499 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 [2022-07-14 07:05:45,500 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 25 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:45,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 469 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-14 07:05:45,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-07-14 07:05:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 253 states have (on average 1.4110671936758894) internal successors, (357), 252 states have internal predecessors, (357), 20 states have call successors, (20), 11 states have call predecessors, (20), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-14 07:05:45,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 403 transitions. [2022-07-14 07:05:45,509 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 403 transitions. Word has length 29 [2022-07-14 07:05:45,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:45,509 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 403 transitions. [2022-07-14 07:05:45,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:05:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 403 transitions. [2022-07-14 07:05:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 07:05:45,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:45,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:45,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 07:05:45,512 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:45,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash -889185583, now seen corresponding path program 1 times [2022-07-14 07:05:45,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:45,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761098052] [2022-07-14 07:05:45,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:45,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:45,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:45,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:45,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761098052] [2022-07-14 07:05:45,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761098052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:45,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:45,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 07:05:45,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259325684] [2022-07-14 07:05:45,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:45,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:05:45,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:45,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:05:45,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:05:45,594 INFO L87 Difference]: Start difference. First operand 286 states and 403 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 07:05:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:45,716 INFO L93 Difference]: Finished difference Result 303 states and 422 transitions. [2022-07-14 07:05:45,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 07:05:45,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-07-14 07:05:45,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:45,719 INFO L225 Difference]: With dead ends: 303 [2022-07-14 07:05:45,719 INFO L226 Difference]: Without dead ends: 303 [2022-07-14 07:05:45,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:05:45,720 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 331 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:45,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 624 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:05:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-14 07:05:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2022-07-14 07:05:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 263 states have (on average 1.403041825095057) internal successors, (369), 261 states have internal predecessors, (369), 20 states have call successors, (20), 11 states have call predecessors, (20), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-14 07:05:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 415 transitions. [2022-07-14 07:05:45,728 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 415 transitions. Word has length 33 [2022-07-14 07:05:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:45,728 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 415 transitions. [2022-07-14 07:05:45,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 07:05:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 415 transitions. [2022-07-14 07:05:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 07:05:45,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:45,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:45,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 07:05:45,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:45,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:45,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2121154083, now seen corresponding path program 1 times [2022-07-14 07:05:45,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:45,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647433350] [2022-07-14 07:05:45,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:45,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:45,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:45,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:45,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647433350] [2022-07-14 07:05:45,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647433350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:45,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:45,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 07:05:45,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863562709] [2022-07-14 07:05:45,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:45,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:05:45,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:45,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:05:45,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:05:45,808 INFO L87 Difference]: Start difference. First operand 296 states and 415 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 07:05:45,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:45,961 INFO L93 Difference]: Finished difference Result 303 states and 421 transitions. [2022-07-14 07:05:45,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 07:05:45,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-14 07:05:45,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:45,966 INFO L225 Difference]: With dead ends: 303 [2022-07-14 07:05:45,966 INFO L226 Difference]: Without dead ends: 303 [2022-07-14 07:05:45,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:05:45,968 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 316 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:45,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 813 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:05:45,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-14 07:05:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2022-07-14 07:05:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 264 states have (on average 1.4015151515151516) internal successors, (370), 262 states have internal predecessors, (370), 20 states have call successors, (20), 11 states have call predecessors, (20), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-14 07:05:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 416 transitions. [2022-07-14 07:05:45,980 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 416 transitions. Word has length 34 [2022-07-14 07:05:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:45,981 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 416 transitions. [2022-07-14 07:05:45,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 07:05:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 416 transitions. [2022-07-14 07:05:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 07:05:45,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:45,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:45,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 07:05:45,984 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:45,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:45,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1780979361, now seen corresponding path program 1 times [2022-07-14 07:05:45,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:45,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228319619] [2022-07-14 07:05:45,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:45,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:46,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:46,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228319619] [2022-07-14 07:05:46,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228319619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:46,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:46,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:05:46,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417064981] [2022-07-14 07:05:46,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:46,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:05:46,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:46,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:05:46,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:05:46,061 INFO L87 Difference]: Start difference. First operand 297 states and 416 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 07:05:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:46,170 INFO L93 Difference]: Finished difference Result 278 states and 380 transitions. [2022-07-14 07:05:46,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:05:46,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-14 07:05:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:46,171 INFO L225 Difference]: With dead ends: 278 [2022-07-14 07:05:46,172 INFO L226 Difference]: Without dead ends: 278 [2022-07-14 07:05:46,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:05:46,172 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 313 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:46,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 731 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:05:46,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-14 07:05:46,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 264. [2022-07-14 07:05:46,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 233 states have (on average 1.390557939914163) internal successors, (324), 231 states have internal predecessors, (324), 18 states have call successors, (18), 10 states have call predecessors, (18), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-14 07:05:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 365 transitions. [2022-07-14 07:05:46,178 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 365 transitions. Word has length 34 [2022-07-14 07:05:46,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:46,179 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 365 transitions. [2022-07-14 07:05:46,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 07:05:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 365 transitions. [2022-07-14 07:05:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 07:05:46,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:46,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:46,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 07:05:46,180 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:46,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817079, now seen corresponding path program 1 times [2022-07-14 07:05:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:46,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578472504] [2022-07-14 07:05:46,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:46,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:46,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578472504] [2022-07-14 07:05:46,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578472504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:46,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:46,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:05:46,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354738132] [2022-07-14 07:05:46,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:46,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:05:46,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:46,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:05:46,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:05:46,204 INFO L87 Difference]: Start difference. First operand 264 states and 365 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:05:46,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:46,275 INFO L93 Difference]: Finished difference Result 282 states and 384 transitions. [2022-07-14 07:05:46,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:05:46,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-14 07:05:46,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:46,277 INFO L225 Difference]: With dead ends: 282 [2022-07-14 07:05:46,277 INFO L226 Difference]: Without dead ends: 282 [2022-07-14 07:05:46,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:05:46,277 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 289 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:46,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 421 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:05:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-14 07:05:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 264. [2022-07-14 07:05:46,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 233 states have (on average 1.3819742489270386) internal successors, (322), 231 states have internal predecessors, (322), 18 states have call successors, (18), 10 states have call predecessors, (18), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-14 07:05:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 363 transitions. [2022-07-14 07:05:46,283 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 363 transitions. Word has length 34 [2022-07-14 07:05:46,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:46,283 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 363 transitions. [2022-07-14 07:05:46,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:05:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 363 transitions. [2022-07-14 07:05:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 07:05:46,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:46,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:46,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 07:05:46,285 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:46,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:46,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1120484039, now seen corresponding path program 1 times [2022-07-14 07:05:46,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:46,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426149587] [2022-07-14 07:05:46,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:46,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:46,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:46,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426149587] [2022-07-14 07:05:46,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426149587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:46,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:46,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:05:46,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886857342] [2022-07-14 07:05:46,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:46,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:05:46,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:46,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:05:46,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:05:46,316 INFO L87 Difference]: Start difference. First operand 264 states and 363 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 07:05:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:46,373 INFO L93 Difference]: Finished difference Result 258 states and 352 transitions. [2022-07-14 07:05:46,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:05:46,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-14 07:05:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:46,374 INFO L225 Difference]: With dead ends: 258 [2022-07-14 07:05:46,374 INFO L226 Difference]: Without dead ends: 82 [2022-07-14 07:05:46,374 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 [2022-07-14 07:05:46,374 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 285 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:46,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 421 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:46,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-14 07:05:46,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-14 07:05:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 72 states have internal predecessors, (87), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 07:05:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2022-07-14 07:05:46,377 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 35 [2022-07-14 07:05:46,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:46,377 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2022-07-14 07:05:46,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 07:05:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2022-07-14 07:05:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 07:05:46,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:46,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:46,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 07:05:46,379 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:46,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:46,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1877593248, now seen corresponding path program 1 times [2022-07-14 07:05:46,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:46,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290638992] [2022-07-14 07:05:46,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:46,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 07:05:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 07:05:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:46,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:46,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290638992] [2022-07-14 07:05:46,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290638992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:46,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:46,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:05:46,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216283261] [2022-07-14 07:05:46,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:46,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:05:46,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:46,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:05:46,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:05:46,428 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:05:46,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:46,478 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2022-07-14 07:05:46,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:05:46,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-07-14 07:05:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:46,492 INFO L225 Difference]: With dead ends: 80 [2022-07-14 07:05:46,492 INFO L226 Difference]: Without dead ends: 80 [2022-07-14 07:05:46,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:05:46,493 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 31 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:46,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 222 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-14 07:05:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-14 07:05:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 70 states have internal predecessors, (84), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 07:05:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2022-07-14 07:05:46,495 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 39 [2022-07-14 07:05:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:46,496 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2022-07-14 07:05:46,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:05:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-07-14 07:05:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 07:05:46,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:46,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:46,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 07:05:46,497 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:46,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1958713032, now seen corresponding path program 1 times [2022-07-14 07:05:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:46,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538822242] [2022-07-14 07:05:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:46,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:46,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538822242] [2022-07-14 07:05:46,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538822242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:46,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:46,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 07:05:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494052511] [2022-07-14 07:05:46,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:46,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 07:05:46,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:46,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 07:05:46,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 07:05:46,551 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:05:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:46,600 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2022-07-14 07:05:46,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 07:05:46,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-07-14 07:05:46,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:46,601 INFO L225 Difference]: With dead ends: 98 [2022-07-14 07:05:46,601 INFO L226 Difference]: Without dead ends: 91 [2022-07-14 07:05:46,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:05:46,602 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 22 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:46,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 356 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-14 07:05:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2022-07-14 07:05:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 74 states have internal predecessors, (88), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 07:05:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2022-07-14 07:05:46,604 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 41 [2022-07-14 07:05:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:46,605 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2022-07-14 07:05:46,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:05:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-07-14 07:05:46,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 07:05:46,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:46,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:46,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 07:05:46,606 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:46,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:46,606 INFO L85 PathProgramCache]: Analyzing trace with hash -306878835, now seen corresponding path program 1 times [2022-07-14 07:05:46,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:46,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666448431] [2022-07-14 07:05:46,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:46,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:46,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:46,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666448431] [2022-07-14 07:05:46,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666448431] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:46,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:46,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 07:05:46,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773629985] [2022-07-14 07:05:46,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:46,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 07:05:46,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:46,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 07:05:46,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 07:05:46,658 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:05:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:46,719 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2022-07-14 07:05:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 07:05:46,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-14 07:05:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:46,720 INFO L225 Difference]: With dead ends: 89 [2022-07-14 07:05:46,720 INFO L226 Difference]: Without dead ends: 89 [2022-07-14 07:05:46,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-14 07:05:46,721 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:46,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 387 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-14 07:05:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-07-14 07:05:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 75 states have internal predecessors, (89), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 07:05:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2022-07-14 07:05:46,723 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 43 [2022-07-14 07:05:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:46,723 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2022-07-14 07:05:46,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:05:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2022-07-14 07:05:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 07:05:46,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:46,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:46,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 07:05:46,725 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:46,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:46,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1924386198, now seen corresponding path program 1 times [2022-07-14 07:05:46,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:46,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779973958] [2022-07-14 07:05:46,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:46,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:46,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:46,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779973958] [2022-07-14 07:05:46,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779973958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:46,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:46,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:05:46,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217852956] [2022-07-14 07:05:46,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:46,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:05:46,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:46,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:05:46,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:05:46,759 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:05:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:46,797 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2022-07-14 07:05:46,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:05:46,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-07-14 07:05:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:46,798 INFO L225 Difference]: With dead ends: 99 [2022-07-14 07:05:46,798 INFO L226 Difference]: Without dead ends: 97 [2022-07-14 07:05:46,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:05:46,799 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 23 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:46,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 230 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-14 07:05:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2022-07-14 07:05:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 07:05:46,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2022-07-14 07:05:46,801 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 42 [2022-07-14 07:05:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:46,802 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2022-07-14 07:05:46,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:05:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2022-07-14 07:05:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 07:05:46,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:46,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:46,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 07:05:46,803 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:46,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:46,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1375541140, now seen corresponding path program 1 times [2022-07-14 07:05:46,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:46,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306134359] [2022-07-14 07:05:46,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:46,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:46,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:46,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306134359] [2022-07-14 07:05:46,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306134359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:46,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:46,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:05:46,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968889870] [2022-07-14 07:05:46,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:46,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:05:46,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:46,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:05:46,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:05:46,842 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:05:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:46,878 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2022-07-14 07:05:46,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 07:05:46,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-14 07:05:46,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:46,879 INFO L225 Difference]: With dead ends: 167 [2022-07-14 07:05:46,879 INFO L226 Difference]: Without dead ends: 167 [2022-07-14 07:05:46,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:05:46,879 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 62 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:46,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 188 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-14 07:05:46,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2022-07-14 07:05:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 137 states have (on average 1.1897810218978102) internal successors, (163), 139 states have internal predecessors, (163), 9 states have call successors, (9), 8 states have call predecessors, (9), 10 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-14 07:05:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2022-07-14 07:05:46,883 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 44 [2022-07-14 07:05:46,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:46,883 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2022-07-14 07:05:46,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:05:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2022-07-14 07:05:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 07:05:46,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:46,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:46,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 07:05:46,884 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:46,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:46,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1144418794, now seen corresponding path program 1 times [2022-07-14 07:05:46,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:46,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513004924] [2022-07-14 07:05:46,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:46,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:46,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:46,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513004924] [2022-07-14 07:05:46,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513004924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:46,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:46,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 07:05:46,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542070121] [2022-07-14 07:05:46,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:46,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 07:05:46,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:46,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 07:05:46,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:05:46,938 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:05:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:46,975 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2022-07-14 07:05:46,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 07:05:46,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-07-14 07:05:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:46,976 INFO L225 Difference]: With dead ends: 145 [2022-07-14 07:05:46,976 INFO L226 Difference]: Without dead ends: 145 [2022-07-14 07:05:46,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:05:46,977 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:46,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 332 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-14 07:05:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-07-14 07:05:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.16) internal successors, (145), 127 states have internal predecessors, (145), 9 states have call successors, (9), 8 states have call predecessors, (9), 10 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-14 07:05:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2022-07-14 07:05:46,980 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 44 [2022-07-14 07:05:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:46,980 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2022-07-14 07:05:46,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:05:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2022-07-14 07:05:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 07:05:46,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:46,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:46,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 07:05:46,981 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:46,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:46,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1135569949, now seen corresponding path program 1 times [2022-07-14 07:05:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:46,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970631317] [2022-07-14 07:05:46,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:46,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 07:05:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:47,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:47,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970631317] [2022-07-14 07:05:47,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970631317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:47,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:47,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 07:05:47,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458873403] [2022-07-14 07:05:47,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:47,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 07:05:47,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:47,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 07:05:47,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:05:47,047 INFO L87 Difference]: Start difference. First operand 145 states and 164 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 07:05:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:47,138 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2022-07-14 07:05:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 07:05:47,138 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-07-14 07:05:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:47,139 INFO L225 Difference]: With dead ends: 133 [2022-07-14 07:05:47,139 INFO L226 Difference]: Without dead ends: 129 [2022-07-14 07:05:47,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-07-14 07:05:47,140 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 76 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:47,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 269 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:05:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-14 07:05:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-14 07:05:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 111 states have (on average 1.1441441441441442) internal successors, (127), 113 states have internal predecessors, (127), 9 states have call successors, (9), 8 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-14 07:05:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2022-07-14 07:05:47,142 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 48 [2022-07-14 07:05:47,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:47,142 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2022-07-14 07:05:47,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 07:05:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2022-07-14 07:05:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 07:05:47,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:47,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:47,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 07:05:47,144 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:47,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:47,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1665628399, now seen corresponding path program 1 times [2022-07-14 07:05:47,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:47,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112044022] [2022-07-14 07:05:47,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:47,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 07:05:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:47,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:47,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112044022] [2022-07-14 07:05:47,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112044022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:47,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:47,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 07:05:47,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338348096] [2022-07-14 07:05:47,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:47,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:05:47,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:47,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:05:47,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:05:47,180 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 07:05:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:47,218 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2022-07-14 07:05:47,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:05:47,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2022-07-14 07:05:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:47,219 INFO L225 Difference]: With dead ends: 141 [2022-07-14 07:05:47,219 INFO L226 Difference]: Without dead ends: 141 [2022-07-14 07:05:47,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:05:47,220 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 14 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:47,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 241 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:47,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-14 07:05:47,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2022-07-14 07:05:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 119 states have internal predecessors, (133), 9 states have call successors, (9), 8 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-14 07:05:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2022-07-14 07:05:47,223 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 49 [2022-07-14 07:05:47,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:47,224 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2022-07-14 07:05:47,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 07:05:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2022-07-14 07:05:47,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 07:05:47,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:47,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:47,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 07:05:47,225 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:47,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:47,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1923793837, now seen corresponding path program 1 times [2022-07-14 07:05:47,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:47,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194849076] [2022-07-14 07:05:47,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:47,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 07:05:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:47,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:47,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194849076] [2022-07-14 07:05:47,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194849076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:47,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:47,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 07:05:47,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648449743] [2022-07-14 07:05:47,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:47,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 07:05:47,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:47,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 07:05:47,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 07:05:47,284 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 07:05:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:47,369 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2022-07-14 07:05:47,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 07:05:47,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-07-14 07:05:47,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:47,370 INFO L225 Difference]: With dead ends: 132 [2022-07-14 07:05:47,370 INFO L226 Difference]: Without dead ends: 115 [2022-07-14 07:05:47,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-14 07:05:47,371 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 106 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:47,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 197 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:05:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-14 07:05:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-07-14 07:05:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.121212121212121) internal successors, (111), 100 states have internal predecessors, (111), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:05:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2022-07-14 07:05:47,373 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 49 [2022-07-14 07:05:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:47,374 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2022-07-14 07:05:47,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 07:05:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2022-07-14 07:05:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 07:05:47,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:47,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:47,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 07:05:47,375 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:47,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash -635303633, now seen corresponding path program 1 times [2022-07-14 07:05:47,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:47,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673083854] [2022-07-14 07:05:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:47,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 07:05:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:47,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:47,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673083854] [2022-07-14 07:05:47,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673083854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:47,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:47,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 07:05:47,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83929222] [2022-07-14 07:05:47,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:47,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:05:47,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:47,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:05:47,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:05:47,424 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 07:05:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:47,461 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-07-14 07:05:47,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 07:05:47,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-07-14 07:05:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:47,462 INFO L225 Difference]: With dead ends: 110 [2022-07-14 07:05:47,462 INFO L226 Difference]: Without dead ends: 108 [2022-07-14 07:05:47,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:05:47,463 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 41 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:47,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 156 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-14 07:05:47,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-07-14 07:05:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.086021505376344) internal successors, (101), 93 states have internal predecessors, (101), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:05:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2022-07-14 07:05:47,465 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 49 [2022-07-14 07:05:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:47,465 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2022-07-14 07:05:47,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 07:05:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2022-07-14 07:05:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 07:05:47,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:47,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:47,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 07:05:47,466 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:47,467 INFO L85 PathProgramCache]: Analyzing trace with hash -870094681, now seen corresponding path program 1 times [2022-07-14 07:05:47,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:47,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456296278] [2022-07-14 07:05:47,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:47,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 07:05:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:47,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:47,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456296278] [2022-07-14 07:05:47,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456296278] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:47,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:47,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 07:05:47,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110116935] [2022-07-14 07:05:47,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:47,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 07:05:47,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:47,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 07:05:47,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:05:47,517 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 07:05:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:47,568 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2022-07-14 07:05:47,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 07:05:47,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-14 07:05:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:47,569 INFO L225 Difference]: With dead ends: 108 [2022-07-14 07:05:47,569 INFO L226 Difference]: Without dead ends: 108 [2022-07-14 07:05:47,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-14 07:05:47,570 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:47,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 287 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-14 07:05:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-07-14 07:05:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.064516129032258) internal successors, (99), 93 states have internal predecessors, (99), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:05:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2022-07-14 07:05:47,572 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 50 [2022-07-14 07:05:47,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:47,573 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2022-07-14 07:05:47,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 07:05:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2022-07-14 07:05:47,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 07:05:47,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:47,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:47,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 07:05:47,574 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:47,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:47,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1424240836, now seen corresponding path program 1 times [2022-07-14 07:05:47,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:47,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597683601] [2022-07-14 07:05:47,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:47,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 07:05:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:47,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:47,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597683601] [2022-07-14 07:05:47,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597683601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:47,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:47,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 07:05:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978232350] [2022-07-14 07:05:47,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:47,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 07:05:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:47,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 07:05:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:05:47,635 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 07:05:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:47,689 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2022-07-14 07:05:47,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 07:05:47,690 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-07-14 07:05:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:47,690 INFO L225 Difference]: With dead ends: 108 [2022-07-14 07:05:47,691 INFO L226 Difference]: Without dead ends: 108 [2022-07-14 07:05:47,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-14 07:05:47,691 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 32 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:47,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 287 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-14 07:05:47,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-07-14 07:05:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.043010752688172) internal successors, (97), 93 states have internal predecessors, (97), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:05:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2022-07-14 07:05:47,694 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 51 [2022-07-14 07:05:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:47,694 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2022-07-14 07:05:47,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 07:05:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2022-07-14 07:05:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 07:05:47,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:47,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:47,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 07:05:47,695 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:47,695 INFO L85 PathProgramCache]: Analyzing trace with hash -613501158, now seen corresponding path program 1 times [2022-07-14 07:05:47,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:47,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618796823] [2022-07-14 07:05:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:47,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 07:05:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:47,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:47,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618796823] [2022-07-14 07:05:47,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618796823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:47,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:47,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 07:05:47,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083396202] [2022-07-14 07:05:47,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:47,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:05:47,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:47,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:05:47,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:05:47,733 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 07:05:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:47,757 INFO L93 Difference]: Finished difference Result 83 states and 82 transitions. [2022-07-14 07:05:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:05:47,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2022-07-14 07:05:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:47,758 INFO L225 Difference]: With dead ends: 83 [2022-07-14 07:05:47,758 INFO L226 Difference]: Without dead ends: 0 [2022-07-14 07:05:47,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:05:47,759 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:47,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 115 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:05:47,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-14 07:05:47,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-14 07:05:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:05:47,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-14 07:05:47,760 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2022-07-14 07:05:47,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:47,760 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 07:05:47,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 07:05:47,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-14 07:05:47,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-14 07:05:47,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-14 07:05:47,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-14 07:05:47,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 07:05:47,765 INFO L356 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, 1, 1] [2022-07-14 07:05:47,766 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 07:05:47,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 07:05:47 BoogieIcfgContainer [2022-07-14 07:05:47,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 07:05:47,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 07:05:47,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 07:05:47,768 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 07:05:47,769 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:05:44" (3/4) ... [2022-07-14 07:05:47,770 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-14 07:05:47,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Complete [2022-07-14 07:05:47,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_CreateClose [2022-07-14 07:05:47,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2022-07-14 07:05:47,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-07-14 07:05:47,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_DispatchPassThrough [2022-07-14 07:05:47,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-07-14 07:05:47,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2022-07-14 07:05:47,782 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2022-07-14 07:05:47,783 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-07-14 07:05:47,783 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-14 07:05:47,784 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-14 07:05:47,837 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 07:05:47,837 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 07:05:47,838 INFO L158 Benchmark]: Toolchain (without parser) took 4365.42ms. Allocated memory was 92.3MB in the beginning and 180.4MB in the end (delta: 88.1MB). Free memory was 59.5MB in the beginning and 71.9MB in the end (delta: -12.4MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2022-07-14 07:05:47,838 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory was 49.1MB in the beginning and 49.1MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 07:05:47,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.32ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 59.2MB in the beginning and 102.5MB in the end (delta: -43.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 07:05:47,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.25ms. Allocated memory is still 134.2MB. Free memory was 102.5MB in the beginning and 99.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 07:05:47,839 INFO L158 Benchmark]: Boogie Preprocessor took 40.15ms. Allocated memory is still 134.2MB. Free memory was 99.1MB in the beginning and 96.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 07:05:47,839 INFO L158 Benchmark]: RCFGBuilder took 613.26ms. Allocated memory is still 134.2MB. Free memory was 96.2MB in the beginning and 60.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-14 07:05:47,839 INFO L158 Benchmark]: TraceAbstraction took 3167.55ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 59.9MB in the beginning and 83.6MB in the end (delta: -23.7MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2022-07-14 07:05:47,839 INFO L158 Benchmark]: Witness Printer took 69.39ms. Allocated memory is still 180.4MB. Free memory was 83.6MB in the beginning and 71.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 07:05:47,840 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory was 49.1MB in the beginning and 49.1MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.32ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 59.2MB in the beginning and 102.5MB in the end (delta: -43.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.25ms. Allocated memory is still 134.2MB. Free memory was 102.5MB in the beginning and 99.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.15ms. Allocated memory is still 134.2MB. Free memory was 99.1MB in the beginning and 96.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 613.26ms. Allocated memory is still 134.2MB. Free memory was 96.2MB in the beginning and 60.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3167.55ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 59.9MB in the beginning and 83.6MB in the end (delta: -23.7MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Witness Printer took 69.39ms. Allocated memory is still 180.4MB. Free memory was 83.6MB in the beginning and 71.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1013]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 295]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 209 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2899 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2869 mSDsluCounter, 8315 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4726 mSDsCounter, 375 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1739 IncrementalHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 375 mSolverCounterUnsat, 3589 mSDtfsCounter, 1739 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=7, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 113 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 866 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 843 ConstructedInterpolants, 0 QuantifiedInterpolants, 2221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-14 07:05:47,880 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: TRUE